fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r087-tall-171620521600132
Last Updated
July 7, 2024

About the Execution of 2023-gold for CSRepetitions-COL-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1364.991 40047.00 83588.00 514.70 TTFFFTFTFFFFFFFT normal

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

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

=== Now, execution of the tool begins

BK_START 1716245251392

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-07
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-20 22:47:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 22:47:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 22:47:33] [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:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-20 22:47:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 399 ms
[2024-05-20 22:47:33] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 498 PT places and 833.0 transition bindings in 12 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-20 22:47:33] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 4 ms.
[2024-05-20 22:47:33] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-COL-07-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Finished random walk after 166 steps, including 1 resets, run visited all 21 properties in 11 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-20 22:47:33] [INFO ] Flatten gal took : 12 ms
[2024-05-20 22:47:33] [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:33] [INFO ] Unfolded HLPN to a Petri net with 198 places and 245 transitions 735 arcs in 11 ms.
[2024-05-20 22:47:33] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 149 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 10 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:33] [INFO ] Computed 50 invariants in 9 ms
[2024-05-20 22:47:34] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-20 22:47:34] [INFO ] Invariant cache hit.
[2024-05-20 22:47:34] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:34] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2024-05-20 22:47:34] [INFO ] Invariant cache hit.
[2024-05-20 22:47:34] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 198/198 places, 245/245 transitions.
Support contains 149 out of 198 places after structural reductions.
[2024-05-20 22:47:34] [INFO ] Flatten gal took : 22 ms
[2024-05-20 22:47:34] [INFO ] Flatten gal took : 19 ms
[2024-05-20 22:47:34] [INFO ] Input system was already deterministic with 245 transitions.
Finished random walk after 85 steps, including 0 resets, run visited all 20 properties in 28 ms. (steps per millisecond=3 )
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' '!(X(F(p0)))'
Support contains 49 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:34] [INFO ] Invariant cache hit.
[2024-05-20 22:47:34] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-20 22:47:34] [INFO ] Invariant cache hit.
[2024-05-20 22:47:35] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:35] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-20 22:47:35] [INFO ] Invariant cache hit.
[2024-05-20 22:47:35] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 198/198 places, 245/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 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 387 ms.
Product exploration explored 100000 steps with 50000 reset in 323 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-07-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLCardinality-01 finished in 1399 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(p0) U (p1&&X(p0))))||G(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 8 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:36] [INFO ] Invariant cache hit.
[2024-05-20 22:47:36] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-20 22:47:36] [INFO ] Invariant cache hit.
[2024-05-20 22:47:36] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:36] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-20 22:47:36] [INFO ] Invariant cache hit.
[2024-05-20 22:47:36] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (LEQ 1 s0) (LEQ 1 (ADD s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s17...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25091 reset in 468 ms.
Product exploration explored 100000 steps with 25079 reset in 407 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 p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 204 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Finished random walk after 22 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT p2))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 272 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
[2024-05-20 22:47:38] [INFO ] Invariant cache hit.
[2024-05-20 22:47:39] [INFO ] [Real]Absence check using 50 positive place invariants in 58 ms returned sat
[2024-05-20 22:47:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:39] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2024-05-20 22:47:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:47:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-05-20 22:47:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:39] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-05-20 22:47:39] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:39] [INFO ] [Nat]Added 49 Read/Feed constraints in 10 ms returned sat
[2024-05-20 22:47:39] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-20 22:47:39] [INFO ] Added : 4 causal constraints over 1 iterations in 62 ms. Result :sat
Could not prove EG (NOT p1)
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 LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:39] [INFO ] Invariant cache hit.
[2024-05-20 22:47:39] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-20 22:47:39] [INFO ] Invariant cache hit.
[2024-05-20 22:47:39] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:39] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-20 22:47:39] [INFO ] Invariant cache hit.
[2024-05-20 22:47:39] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 257 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) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
[2024-05-20 22:47:40] [INFO ] Invariant cache hit.
[2024-05-20 22:47:40] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2024-05-20 22:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:40] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-05-20 22:47:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:47:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-05-20 22:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:41] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-05-20 22:47:41] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:41] [INFO ] [Nat]Added 49 Read/Feed constraints in 9 ms returned sat
[2024-05-20 22:47:41] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-20 22:47:41] [INFO ] Added : 4 causal constraints over 1 iterations in 66 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Product exploration explored 100000 steps with 25074 reset in 334 ms.
Product exploration explored 100000 steps with 25035 reset in 319 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
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.
Applied a total of 0 rules in 21 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:42] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-20 22:47:42] [INFO ] Invariant cache hit.
[2024-05-20 22:47:42] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 198/198 places, 245/245 transitions.
Built C files in :
/tmp/ltsmin4520095382272249512
[2024-05-20 22:47:42] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4520095382272249512
Running compilation step : cd /tmp/ltsmin4520095382272249512;'/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 429 ms.
Running link step : cd /tmp/ltsmin4520095382272249512;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4520095382272249512;'/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/stateBased8133671768728784687.hoa' '--buchi-type=spotba'
LTSmin run took 2201 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-07-LTLCardinality-02 finished in 9078 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 p1)&&X(G(p2))))'
Support contains 51 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.
[2024-05-20 22:47:45] [INFO ] Invariant cache hit.
[2024-05-20 22:47:45] [INFO ] Implicit Places using invariants in 124 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 134 ms returned []
Implicit Place search using SMT with State Equation took 273 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 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), true, (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LEQ 3 s99), p1:(LEQ 1 s99), p0:(LEQ (ADD s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 110 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-04 finished in 643 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(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 4 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:45] [INFO ] Invariant cache hit.
[2024-05-20 22:47:46] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-20 22:47:46] [INFO ] Invariant cache hit.
[2024-05-20 22:47:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:46] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[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 105 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-05 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:(GT (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 272 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)), (X 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 16 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-07-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLCardinality-05 finished in 1001 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((G(!p0)||(p1&&G(p2))))))'
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.
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:46] [INFO ] Invariant cache hit.
[2024-05-20 22:47:47] [INFO ] Implicit Places using invariants in 72 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 160 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-20 22:47:47] [INFO ] Redundant transitions in 15 ms returned []
[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 108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 p2), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 s99), p2:(GT 2 s99), p0:(LEQ 2 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s12...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1084 reset in 929 ms.
Product exploration explored 100000 steps with 1088 reset in 912 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 p2) p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 191 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Incomplete random walk after 10004 steps, including 123 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-20 22:47:50] [INFO ] Invariant cache hit.
[2024-05-20 22:47:50] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (G (NOT (AND p0 p1 p2))), (G (NOT (AND (NOT p0) p1 p2))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (F (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge based reduction with 16 factoid took 557 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[p0]
Stuttering acceptance computed with spot in 29 ms :[p0]
[2024-05-20 22:47:50] [INFO ] Invariant cache hit.
[2024-05-20 22:47:51] [INFO ] [Real]Absence check using 50 positive place invariants in 20 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 109 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 12 ms returned sat
[2024-05-20 22:47:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:51] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-20 22:47:51] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:51] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-20 22:47:51] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-20 22:47:51] [INFO ] Added : 2 causal constraints over 1 iterations in 50 ms. Result :sat
Could not prove EG p0
Support contains 49 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 9 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:51] [INFO ] Invariant cache hit.
[2024-05-20 22:47:51] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-20 22:47:51] [INFO ] Invariant cache hit.
[2024-05-20 22:47:51] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:51] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-20 22:47:51] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-20 22:47:51] [INFO ] Invariant cache hit.
[2024-05-20 22:47:51] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 455 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[p0]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 45 ms :[p0]
[2024-05-20 22:47:52] [INFO ] Invariant cache hit.
[2024-05-20 22:47:52] [INFO ] [Real]Absence check using 50 positive place invariants in 19 ms returned sat
[2024-05-20 22:47:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:52] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-20 22:47:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 22:47:52] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2024-05-20 22:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-20 22:47:52] [INFO ] [Nat]Absence check using state equation in 96 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 11 ms returned sat
[2024-05-20 22:47:52] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-20 22:47:52] [INFO ] Added : 2 causal constraints over 1 iterations in 53 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 45 ms :[p0]
Product exploration explored 100000 steps with 1096 reset in 565 ms.
Product exploration explored 100000 steps with 1081 reset in 591 ms.
Built C files in :
/tmp/ltsmin9334074328172219191
[2024-05-20 22:47:54] [INFO ] Computing symmetric may disable matrix : 245 transitions.
[2024-05-20 22:47:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:47:54] [INFO ] Computing symmetric may enable matrix : 245 transitions.
[2024-05-20 22:47:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:47:54] [INFO ] Computing Do-Not-Accords matrix : 245 transitions.
[2024-05-20 22:47:54] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:47:54] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9334074328172219191
Running compilation step : cd /tmp/ltsmin9334074328172219191;'/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 433 ms.
Running link step : cd /tmp/ltsmin9334074328172219191;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9334074328172219191;'/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/stateBased3644035517846016712.hoa' '--buchi-type=spotba'
LTSmin run took 1133 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-07-LTLCardinality-06 finished in 8917 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)))'
Support contains 1 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:55] [INFO ] Invariant cache hit.
[2024-05-20 22:47:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-20 22:47:55] [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 174 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-20 22:47:56] [INFO ] Invariant cache hit.
[2024-05-20 22:47:56] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s0)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 25 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-08 finished in 498 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 U p1)||F(p2)))))'
Support contains 99 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 13 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 45 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 96 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-20 22:47:56] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-20 22:47:56] [INFO ] Invariant cache hit.
[2024-05-20 22:47:56] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ (ADD s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s176 s...], 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 1336 reset in 594 ms.
Product exploration explored 100000 steps with 1321 reset in 633 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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 115 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 150 steps, including 1 resets, run visited all 3 properties in 6 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p1) (AND (NOT p2) (NOT p0))))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 99 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 13 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:47:58] [INFO ] Invariant cache hit.
[2024-05-20 22:47:58] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-20 22:47:58] [INFO ] Invariant cache hit.
[2024-05-20 22:47:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:47:58] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-20 22:47:58] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-20 22:47:58] [INFO ] Invariant cache hit.
[2024-05-20 22:47:58] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 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 p1) p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 83 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1333 reset in 521 ms.
Product exploration explored 100000 steps with 1322 reset in 568 ms.
Built C files in :
/tmp/ltsmin17167734606689551114
[2024-05-20 22:48:00] [INFO ] Computing symmetric may disable matrix : 245 transitions.
[2024-05-20 22:48:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:48:00] [INFO ] Computing symmetric may enable matrix : 245 transitions.
[2024-05-20 22:48:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:48:00] [INFO ] Computing Do-Not-Accords matrix : 245 transitions.
[2024-05-20 22:48:00] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-20 22:48:00] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17167734606689551114
Running compilation step : cd /tmp/ltsmin17167734606689551114;'/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 458 ms.
Running link step : cd /tmp/ltsmin17167734606689551114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17167734606689551114;'/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/stateBased4184559880916235634.hoa' '--buchi-type=spotba'
LTSmin run took 6447 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-07-LTLCardinality-09 finished in 11602 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 50 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 11 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:48:07] [INFO ] Invariant cache hit.
[2024-05-20 22:48:08] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-20 22:48:08] [INFO ] Invariant cache hit.
[2024-05-20 22:48:08] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:08] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-20 22:48:08] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-20 22:48:08] [INFO ] Invariant cache hit.
[2024-05-20 22:48:08] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s99 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], 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 91 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-10 finished in 385 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)))'
Support contains 50 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 3 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:48:08] [INFO ] Invariant cache hit.
[2024-05-20 22:48:08] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-20 22:48:08] [INFO ] Invariant cache hit.
[2024-05-20 22:48:08] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:08] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-20 22:48:08] [INFO ] Invariant cache hit.
[2024-05-20 22:48:08] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 268 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s0 (ADD s149 s150 s151 s152 s153 s154 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s165 s166 s167 s168 s169 s170 s171 s172 s173 s174 s175 s17...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-11 finished in 372 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((!p0||G(p0)))&&F(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 0 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
Applied a total of 147 rules in 24 ms. Remains 100 /198 variables (removed 98) and now considering 196/245 (removed 49) transitions.
// Phase 1: matrix 196 rows 100 cols
[2024-05-20 22:48:08] [INFO ] Computed 1 invariants in 4 ms
[2024-05-20 22:48:08] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-20 22:48:08] [INFO ] Invariant cache hit.
[2024-05-20 22:48:08] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-20 22:48:08] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-20 22:48:08] [INFO ] Invariant cache hit.
[2024-05-20 22:48:08] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/198 places, 196/245 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 100/198 places, 196/245 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p0), (NOT p1), true]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s83 s84 s85 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 33270 reset in 207 ms.
Entered a terminal (fully accepting) state of product in 21528 steps with 7122 reset in 50 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-12 finished in 591 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 147 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.
// Phase 1: matrix 245 rows 198 cols
[2024-05-20 22:48:09] [INFO ] Computed 50 invariants in 3 ms
[2024-05-20 22:48:09] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-20 22:48:09] [INFO ] Invariant cache hit.
[2024-05-20 22:48:09] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:09] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-20 22:48:09] [INFO ] Invariant cache hit.
[2024-05-20 22:48:09] [INFO ] Dead Transitions using invariants and state equation in 95 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 161 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(LEQ (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-13 finished in 433 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(p0)||G((p1 U p2))))'
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.
Applied a total of 0 rules in 5 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
[2024-05-20 22:48:09] [INFO ] Invariant cache hit.
[2024-05-20 22:48:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-20 22:48:09] [INFO ] Invariant cache hit.
[2024-05-20 22:48:09] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-20 22:48:09] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-05-20 22:48:09] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-20 22:48:09] [INFO ] Invariant cache hit.
[2024-05-20 22:48:10] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 338 ms. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : CSRepetitions-COL-07-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 2 ms.
FORMULA CSRepetitions-COL-07-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLCardinality-14 finished in 555 ms.
All properties solved by simple procedures.
Total runtime 37139 ms.

BK_STOP 1716245291439

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521600132"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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