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.r087-tall-171620521600133.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 CSRepetitions-COL-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521600133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K Apr 12 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 09:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 12 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 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 CSRepetitions-COL-07-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716245262938

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=CSRepetitions-COL-07
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-20 22:47:44] [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-20 22:47:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:47:44] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-20 22:47:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-20 22:47:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 629 ms
[2024-05-20 22:47:45] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 498 PT places and 833.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-20 22:47:45] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2024-05-20 22:47:45] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA CSRepetitions-COL-07-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Finished random walk after 66 steps, including 0 resets, run visited all 9 properties in 9 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-20 22:47:45] [INFO ] Flatten gal took : 14 ms
[2024-05-20 22:47:45] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 7
[2024-05-20 22:47:45] [INFO ] Unfolded HLPN to a Petri net with 198 places and 245 transitions 735 arcs in 14 ms.
[2024-05-20 22:47:45] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-07-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 198 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 12 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-05-20 22:47:45] [INFO ] Computed 50 invariants in 17 ms
[2024-05-20 22:47:45] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-20 22:47:45] [INFO ] Invariant cache hit.
[2024-05-20 22:47:45] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:45] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-20 22:47:45] [INFO ] Invariant cache hit.
[2024-05-20 22:47:45] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 471 ms. Remains : 198/198 places, 245/245 transitions.
Support contains 198 out of 198 places after structural reductions.
[2024-05-20 22:47:45] [INFO ] Flatten gal took : 34 ms
[2024-05-20 22:47:46] [INFO ] Flatten gal took : 34 ms
[2024-05-20 22:47:46] [INFO ] Input system was already deterministic with 245 transitions.
Finished random walk after 83 steps, including 0 resets, run visited all 11 properties in 10 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 49 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' '!((F(G(p0))||G(p1)))'
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
Applied a total of 243 rules in 31 ms. Remains 52 /198 variables (removed 146) and now considering 148/245 (removed 97) transitions.
// Phase 1: matrix 148 rows 52 cols
[2024-05-20 22:47:46] [INFO ] Computed 1 invariants in 1 ms
[2024-05-20 22:47:46] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-20 22:47:46] [INFO ] Invariant cache hit.
[2024-05-20 22:47:46] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-20 22:47:46] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-20 22:47:46] [INFO ] Invariant cache hit.
[2024-05-20 22:47:46] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/198 places, 148/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 52/198 places, 148/245 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 174 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (OR (LT s35 1) (LT s50 1)) (OR (LT s45 1) (LT s50 1)) (OR (LT s25 1) (LT s50 1)) (OR (LT s6 1) (LT s50 1)) (OR (LT s16 1) (LT s50 1)) (OR (LT s46 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 4 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-00 finished in 546 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(X(F(p0)))))'
Support contains 98 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-05-20 22:47:47] [INFO ] Computed 50 invariants in 12 ms
[2024-05-20 22:47:47] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-20 22:47:47] [INFO ] Invariant cache hit.
[2024-05-20 22:47:47] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:47] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-20 22:47:47] [INFO ] Invariant cache hit.
[2024-05-20 22:47:47] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 303 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-07 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:(OR (AND (GEQ s21 1) (GEQ s169 1)) (AND (GEQ s48 1) (GEQ s196 1)) (AND (GEQ s6 1) (GEQ s154 1)) (AND (GEQ s16 1) (GEQ s164 1)) (AND (GEQ s26 1) (GEQ s1...], 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 14007 steps with 495 reset in 150 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-07 finished in 616 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(((p1 U p2)||p0)))'
Support contains 50 out of 198 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 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 17 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:47] [INFO ] Invariant cache hit.
[2024-05-20 22:47:47] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-20 22:47:47] [INFO ] Invariant cache hit.
[2024-05-20 22:47:47] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:47] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-20 22:47:47] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-20 22:47:47] [INFO ] Invariant cache hit.
[2024-05-20 22:47:48] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 369 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s84 1) (GEQ s99 1)) (AND (GEQ s94 1) (GEQ s99 1)) (AND (GEQ s74 1) (GEQ s99 1)) (AND (GEQ s55 1) (GEQ s99 1)) (AND (GEQ s65 1) (GEQ s99 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9525 reset in 683 ms.
Product exploration explored 100000 steps with 9579 reset in 717 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-20 22:47:49] [INFO ] Invariant cache hit.
[2024-05-20 22:47:50] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-05-20 22:47:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:50] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-20 22:47:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:47:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2024-05-20 22:47:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:50] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-20 22:47:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:50] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-20 22:47:50] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-20 22:47:50] [INFO ] Added : 0 causal constraints over 0 iterations in 56 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 50 out of 198 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 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 13 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:50] [INFO ] Invariant cache hit.
[2024-05-20 22:47:50] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-20 22:47:50] [INFO ] Invariant cache hit.
[2024-05-20 22:47:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:50] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-20 22:47:50] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-20 22:47:50] [INFO ] Invariant cache hit.
[2024-05-20 22:47:50] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 198/198 places, 245/245 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-20 22:47:51] [INFO ] Invariant cache hit.
[2024-05-20 22:47:51] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-05-20 22:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:51] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-20 22:47:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:47:51] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-05-20 22:47:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:52] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-20 22:47:52] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:52] [INFO ] [Nat]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-20 22:47:52] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-20 22:47:52] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 9573 reset in 626 ms.
Product exploration explored 100000 steps with 9542 reset in 641 ms.
Built C files in :
/tmp/ltsmin10105099181421232476
[2024-05-20 22:47:53] [INFO ] Computing symmetric may disable matrix : 245 transitions.
[2024-05-20 22:47:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:47:53] [INFO ] Computing symmetric may enable matrix : 245 transitions.
[2024-05-20 22:47:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:47:53] [INFO ] Computing Do-Not-Accords matrix : 245 transitions.
[2024-05-20 22:47:53] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:47:53] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10105099181421232476
Running compilation step : cd /tmp/ltsmin10105099181421232476;'/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 557 ms.
Running link step : cd /tmp/ltsmin10105099181421232476;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin10105099181421232476;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8657620539158968109.hoa' '--buchi-type=spotba'
LTSmin run took 446 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-07-LTLFireability-08 finished in 6939 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' '!((!p0 U X(!p1)))'
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:54] [INFO ] Invariant cache hit.
[2024-05-20 22:47:54] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-20 22:47:54] [INFO ] Invariant cache hit.
[2024-05-20 22:47:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:54] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-20 22:47:54] [INFO ] Invariant cache hit.
[2024-05-20 22:47:54] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 129 ms :[p1, true, p1, p1]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s0 1) (GEQ s29 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 815 ms.
Product exploration explored 100000 steps with 50000 reset in 821 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-07-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLFireability-09 finished in 2150 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((F((G(!p1)||G(p2)))&&p0)))'
Support contains 100 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 15 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:56] [INFO ] Invariant cache hit.
[2024-05-20 22:47:56] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-20 22:47:56] [INFO ] Invariant cache hit.
[2024-05-20 22:47:56] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:56] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-20 22:47:56] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-20 22:47:56] [INFO ] Invariant cache hit.
[2024-05-20 22:47:57] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s21 1)) (OR (LT s0 1) (LT s23 1)) (OR (LT s0 1) (LT s17 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s0 1) (LT s29 1)) (OR (LT s0 1) (L...], nbAcceptance=2, 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 71 steps with 0 reset in 4 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-10 finished in 656 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((F((X(!p0) U ((!p1&&X(!p0))||G(X(!p0)))))||!p1))))'
Support contains 148 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:57] [INFO ] Invariant cache hit.
[2024-05-20 22:47:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-20 22:47:57] [INFO ] Invariant cache hit.
[2024-05-20 22:47:57] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:57] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-20 22:47:57] [INFO ] Invariant cache hit.
[2024-05-20 22:47:57] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s84 1) (GEQ s99 1)) (AND (GEQ s94 1) (GEQ s99 1)) (AND (GEQ s74 1) (GEQ s99 1)) (AND (GEQ s55 1) (GEQ s99 1)) (AND (GEQ s65 1) (GEQ s99 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1204 reset in 1013 ms.
Product exploration explored 100000 steps with 1207 reset in 1039 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 7 factoid took 212 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 111 steps, including 1 resets, run visited all 5 properties in 6 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 326 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 99 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Support contains 148 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:48:00] [INFO ] Invariant cache hit.
[2024-05-20 22:48:00] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-20 22:48:00] [INFO ] Invariant cache hit.
[2024-05-20 22:48:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:00] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-20 22:48:00] [INFO ] Invariant cache hit.
[2024-05-20 22:48:00] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 198/198 places, 245/245 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F p1), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 326 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 89 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 114 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 1214 reset in 1095 ms.
Stack based approach found an accepted trace after 44589 steps with 545 reset with depth 62 and stack size 62 in 508 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-11 finished in 6229 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)||(X(p2)&&p1))))'
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:48:03] [INFO ] Invariant cache hit.
[2024-05-20 22:48:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-20 22:48:03] [INFO ] Invariant cache hit.
[2024-05-20 22:48:03] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:03] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-20 22:48:03] [INFO ] Invariant cache hit.
[2024-05-20 22:48:03] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 71 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s84 1) (LT s99 1)) (OR (LT s94 1) (LT s99 1)) (OR (LT s74 1) (LT s99 1)) (OR (LT s55 1) (LT s99 1)) (OR (LT s65 1) (LT s99 1)) (OR (LT s95...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1093 reset in 875 ms.
Product exploration explored 100000 steps with 1101 reset in 906 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge based reduction with 13 factoid took 423 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 120 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
[2024-05-20 22:48:06] [INFO ] Invariant cache hit.
[2024-05-20 22:48:06] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 782 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 81 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
[2024-05-20 22:48:07] [INFO ] Invariant cache hit.
[2024-05-20 22:48:08] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-05-20 22:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:48:08] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-20 22:48:08] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:08] [INFO ] [Real]Added 49 Read/Feed constraints in 10 ms returned sat
[2024-05-20 22:48:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:48:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-05-20 22:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:48:08] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-20 22:48:08] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-20 22:48:08] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-20 22:48:09] [INFO ] Added : 4 causal constraints over 1 iterations in 51 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
[2024-05-20 22:48:09] [INFO ] Invariant cache hit.
[2024-05-20 22:48:09] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-05-20 22:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:48:09] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-20 22:48:09] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:09] [INFO ] [Real]Added 49 Read/Feed constraints in 5 ms returned sat
[2024-05-20 22:48:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:48:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-05-20 22:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:48:10] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-20 22:48:10] [INFO ] [Nat]Added 49 Read/Feed constraints in 5 ms returned sat
[2024-05-20 22:48:10] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-20 22:48:10] [INFO ] Added : 4 causal constraints over 1 iterations in 47 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:48:10] [INFO ] Invariant cache hit.
[2024-05-20 22:48:10] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-20 22:48:10] [INFO ] Invariant cache hit.
[2024-05-20 22:48:10] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:10] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-20 22:48:10] [INFO ] Invariant cache hit.
[2024-05-20 22:48:10] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 198/198 places, 245/245 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 9 factoid took 338 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Finished random walk after 7657 steps, including 93 resets, run visited all 6 properties in 27 ms. (steps per millisecond=283 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p2))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 511 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 66 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
[2024-05-20 22:48:11] [INFO ] Invariant cache hit.
[2024-05-20 22:48:12] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-05-20 22:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:48:12] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2024-05-20 22:48:12] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:12] [INFO ] [Real]Added 49 Read/Feed constraints in 11 ms returned sat
[2024-05-20 22:48:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:48:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-05-20 22:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:48:12] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-20 22:48:12] [INFO ] [Nat]Added 49 Read/Feed constraints in 12 ms returned sat
[2024-05-20 22:48:12] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-20 22:48:13] [INFO ] Added : 4 causal constraints over 1 iterations in 50 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
[2024-05-20 22:48:13] [INFO ] Invariant cache hit.
[2024-05-20 22:48:13] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-05-20 22:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:48:13] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2024-05-20 22:48:13] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:13] [INFO ] [Real]Added 49 Read/Feed constraints in 9 ms returned sat
[2024-05-20 22:48:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:48:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 15 ms returned sat
[2024-05-20 22:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:48:14] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-20 22:48:14] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-20 22:48:14] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-20 22:48:14] [INFO ] Added : 4 causal constraints over 1 iterations in 58 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Stuttering acceptance computed with spot in 76 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 1101 reset in 853 ms.
Product exploration explored 100000 steps with 1096 reset in 898 ms.
Built C files in :
/tmp/ltsmin8979443655366288225
[2024-05-20 22:48:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8979443655366288225
Running compilation step : cd /tmp/ltsmin8979443655366288225;'/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 376 ms.
Running link step : cd /tmp/ltsmin8979443655366288225;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8979443655366288225;'/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/stateBased18308904298055158588.hoa' '--buchi-type=spotba'
LTSmin run took 483 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-07-LTLFireability-12 finished in 13495 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(G(p0))||F(p1))))'
Support contains 148 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 1 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:48:17] [INFO ] Invariant cache hit.
[2024-05-20 22:48:17] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-20 22:48:17] [INFO ] Invariant cache hit.
[2024-05-20 22:48:17] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:17] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2024-05-20 22:48:17] [INFO ] Invariant cache hit.
[2024-05-20 22:48:17] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s84 1) (GEQ s99 1)) (AND (GEQ s94 1) (GEQ s99 1)) (AND (GEQ s74 1) (GEQ s99 1)) (AND (GEQ s55 1) (GEQ s99 1)) (AND (GEQ s65 1) (GEQ s99 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 469 ms.
Product exploration explored 100000 steps with 50000 reset in 487 ms.
Computed a total of 0 stabilizing places and 49 stable transitions
Computed a total of 0 stabilizing places and 49 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-07-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLFireability-13 finished in 1390 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)))'
Support contains 49 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 246 place count 50 transition count 147
Applied a total of 246 rules in 19 ms. Remains 50 /198 variables (removed 148) and now considering 147/245 (removed 98) transitions.
// Phase 1: matrix 147 rows 50 cols
[2024-05-20 22:48:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 22:48:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-20 22:48:18] [INFO ] Invariant cache hit.
[2024-05-20 22:48:18] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-20 22:48:18] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-20 22:48:18] [INFO ] Invariant cache hit.
[2024-05-20 22:48:18] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/198 places, 147/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 50/198 places, 147/245 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-14 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:(OR (GEQ s15 1) (GEQ s17 1) (GEQ s19 1) (GEQ s21 1) (GEQ s23 1) (GEQ s25 1) (GEQ s27 1) (GEQ s29 1) (GEQ s31 1) (GEQ s33 1) (GEQ s35 1) (GEQ s37 1) (GE...], 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 38 steps with 3 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-14 finished in 251 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((F(G(p0))&&(!p1 U (p2||G(!p1))))))'
Support contains 147 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-05-20 22:48:18] [INFO ] Computed 50 invariants in 2 ms
[2024-05-20 22:48:18] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-20 22:48:18] [INFO ] Invariant cache hit.
[2024-05-20 22:48:18] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:18] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-20 22:48:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:48:18] [INFO ] Invariant cache hit.
[2024-05-20 22:48:18] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (OR (GEQ s64 1) (GEQ s66 1) (GEQ s68 1) (GEQ s70 1) (GEQ s72 1) (GEQ s74 1) (GEQ s76 1) (GEQ s78 1) (GEQ s80 1) (GEQ s82 1) (GEQ s84 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1094 reset in 731 ms.
Stack based approach found an accepted trace after 34127 steps with 373 reset with depth 20 and stack size 20 in 237 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-15 finished in 1392 ms.
All properties solved by simple procedures.
Total runtime 35766 ms.

BK_STOP 1716245301208

--------------------
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="CSRepetitions-COL-07"
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 CSRepetitions-COL-07, 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 r087-tall-171620521600133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-07.tgz
mv CSRepetitions-COL-07 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 ;