About the Execution of 2023-gold for DES-PT-20a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16209.472 | 3600000.00 | 5144296.00 | 33651.80 | FTFFFTTFTFFF?FTF | 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.r109-tall-171624208500427.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 DES-PT-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500427
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 12 08:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 08:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 08:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 57K 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 DES-PT-20a-LTLCardinality-00
FORMULA_NAME DES-PT-20a-LTLCardinality-01
FORMULA_NAME DES-PT-20a-LTLCardinality-02
FORMULA_NAME DES-PT-20a-LTLCardinality-03
FORMULA_NAME DES-PT-20a-LTLCardinality-04
FORMULA_NAME DES-PT-20a-LTLCardinality-05
FORMULA_NAME DES-PT-20a-LTLCardinality-06
FORMULA_NAME DES-PT-20a-LTLCardinality-07
FORMULA_NAME DES-PT-20a-LTLCardinality-08
FORMULA_NAME DES-PT-20a-LTLCardinality-09
FORMULA_NAME DES-PT-20a-LTLCardinality-10
FORMULA_NAME DES-PT-20a-LTLCardinality-11
FORMULA_NAME DES-PT-20a-LTLCardinality-12
FORMULA_NAME DES-PT-20a-LTLCardinality-13
FORMULA_NAME DES-PT-20a-LTLCardinality-14
FORMULA_NAME DES-PT-20a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716334528014
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=DES-PT-20a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 23:35:29] [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-21 23:35:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:35:29] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-21 23:35:29] [INFO ] Transformed 195 places.
[2024-05-21 23:35:29] [INFO ] Transformed 152 transitions.
[2024-05-21 23:35:29] [INFO ] Found NUPN structural information;
[2024-05-21 23:35:29] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 113 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-20a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 36 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2024-05-21 23:35:29] [INFO ] Computed 59 invariants in 19 ms
[2024-05-21 23:35:30] [INFO ] Implicit Places using invariants in 506 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 530 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 572 ms. Remains : 193/195 places, 137/138 transitions.
Support contains 23 out of 193 places after structural reductions.
[2024-05-21 23:35:30] [INFO ] Flatten gal took : 45 ms
[2024-05-21 23:35:30] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:35:30] [INFO ] Input system was already deterministic with 137 transitions.
Incomplete random walk after 10000 steps, including 221 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 23:35:31] [INFO ] Computed 58 invariants in 5 ms
[2024-05-21 23:35:31] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-21 23:35:31] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 23:35:31] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 23:35:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2024-05-21 23:35:31] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 90 ms returned sat
[2024-05-21 23:35:31] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-21 23:35:31] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 7 ms to minimize.
[2024-05-21 23:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-21 23:35:32] [INFO ] After 424ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-21 23:35:32] [INFO ] After 744ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 5 properties in 188 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 192 transition count 134
Applied a total of 9 rules in 29 ms. Remains 192 /193 variables (removed 1) and now considering 134/137 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 192/193 places, 134/137 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1135050 steps, run timeout after 3001 ms. (steps per millisecond=378 ) properties seen :{}
Probabilistic random walk after 1135050 steps, saw 158952 distinct states, run finished after 3002 ms. (steps per millisecond=378 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 134 rows 192 cols
[2024-05-21 23:35:35] [INFO ] Computed 60 invariants in 5 ms
[2024-05-21 23:35:35] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2024-05-21 23:35:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 23:35:35] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 23:35:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:35:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 23:35:35] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 23:35:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:35:35] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-21 23:35:35] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-21 23:35:35] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-05-21 23:35:36] [INFO ] After 284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 13 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 6 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2024-05-21 23:35:36] [INFO ] Invariant cache hit.
[2024-05-21 23:35:36] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-21 23:35:36] [INFO ] Invariant cache hit.
[2024-05-21 23:35:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 23:35:36] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2024-05-21 23:35:36] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:35:36] [INFO ] Invariant cache hit.
[2024-05-21 23:35:36] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 719 ms. Remains : 192/192 places, 134/134 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 12 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 134 rows 192 cols
[2024-05-21 23:35:36] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 23:35:36] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:35:36] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 23:35:36] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-21 23:35:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:35:37] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 23:35:37] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-21 23:35:37] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-21 23:35:37] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA DES-PT-20a-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 91 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))&&F((p1&&G(p2)))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 23:35:37] [INFO ] Computed 58 invariants in 6 ms
[2024-05-21 23:35:37] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-21 23:35:37] [INFO ] Invariant cache hit.
[2024-05-21 23:35:37] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-21 23:35:37] [INFO ] Invariant cache hit.
[2024-05-21 23:35:37] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 193/193 places, 137/137 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 282 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s87 0) (EQ s16 1)), p2:(OR (EQ s4 0) (EQ s49 1)), p0:(AND (EQ s49 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 3 ms.
FORMULA DES-PT-20a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-04 finished in 757 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 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2024-05-21 23:35:38] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 23:35:38] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-21 23:35:38] [INFO ] Invariant cache hit.
[2024-05-21 23:35:38] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-21 23:35:38] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 23:35:38] [INFO ] Invariant cache hit.
[2024-05-21 23:35:38] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-05 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 (EQ s139 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2458 reset in 261 ms.
Product exploration explored 100000 steps with 2448 reset in 243 ms.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 101 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
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 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 136/136 transitions.
Applied a total of 0 rules in 18 ms. Remains 192 /192 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-21 23:35:39] [INFO ] Invariant cache hit.
[2024-05-21 23:35:39] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 23:35:39] [INFO ] Invariant cache hit.
[2024-05-21 23:35:39] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-21 23:35:39] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 23:35:39] [INFO ] Invariant cache hit.
[2024-05-21 23:35:39] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 398 ms. Remains : 192/192 places, 136/136 transitions.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
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 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2443 reset in 184 ms.
Product exploration explored 100000 steps with 2468 reset in 199 ms.
Built C files in :
/tmp/ltsmin15737674217659840060
[2024-05-21 23:35:40] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2024-05-21 23:35:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:35:40] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2024-05-21 23:35:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:35:40] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2024-05-21 23:35:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:35:40] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15737674217659840060
Running compilation step : cd /tmp/ltsmin15737674217659840060;'/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 375 ms.
Running link step : cd /tmp/ltsmin15737674217659840060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15737674217659840060;'/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/stateBased15008096811159694131.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 192/192 places, 136/136 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2024-05-21 23:35:55] [INFO ] Invariant cache hit.
[2024-05-21 23:35:56] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 23:35:56] [INFO ] Invariant cache hit.
[2024-05-21 23:35:56] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-21 23:35:56] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 23:35:56] [INFO ] Invariant cache hit.
[2024-05-21 23:35:56] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 483 ms. Remains : 192/192 places, 136/136 transitions.
Built C files in :
/tmp/ltsmin1442059490596674370
[2024-05-21 23:35:56] [INFO ] Computing symmetric may disable matrix : 136 transitions.
[2024-05-21 23:35:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:35:56] [INFO ] Computing symmetric may enable matrix : 136 transitions.
[2024-05-21 23:35:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:35:56] [INFO ] Computing Do-Not-Accords matrix : 136 transitions.
[2024-05-21 23:35:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:35:56] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1442059490596674370
Running compilation step : cd /tmp/ltsmin1442059490596674370;'/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 280 ms.
Running link step : cd /tmp/ltsmin1442059490596674370;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1442059490596674370;'/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/stateBased18322338488988023239.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:36:11] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:36:11] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:36:11] [INFO ] Time to serialize gal into /tmp/LTL9038600747812353599.gal : 3 ms
[2024-05-21 23:36:11] [INFO ] Time to serialize properties into /tmp/LTL17319719436274502912.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9038600747812353599.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11939872195804022662.hoa' '-atoms' '/tmp/LTL17319719436274502912.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17319719436274502912.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11939872195804022662.hoa
Detected timeout of ITS tools.
[2024-05-21 23:36:26] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:36:26] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:36:26] [INFO ] Time to serialize gal into /tmp/LTL11698748614405339921.gal : 10 ms
[2024-05-21 23:36:26] [INFO ] Time to serialize properties into /tmp/LTL9103252161082304254.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11698748614405339921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9103252161082304254.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p141==0)||(p11==1))"))))
Formula 0 simplified : FG!"((p141==0)||(p11==1))"
Detected timeout of ITS tools.
[2024-05-21 23:36:41] [INFO ] Flatten gal took : 25 ms
[2024-05-21 23:36:41] [INFO ] Applying decomposition
[2024-05-21 23:36:41] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2663012491088131944.txt' '-o' '/tmp/graph2663012491088131944.bin' '-w' '/tmp/graph2663012491088131944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2663012491088131944.bin' '-l' '-1' '-v' '-w' '/tmp/graph2663012491088131944.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:36:41] [INFO ] Decomposing Gal with order
[2024-05-21 23:36:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:36:42] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-21 23:36:42] [INFO ] Flatten gal took : 94 ms
[2024-05-21 23:36:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-21 23:36:42] [INFO ] Time to serialize gal into /tmp/LTL13689209192038306487.gal : 3 ms
[2024-05-21 23:36:42] [INFO ] Time to serialize properties into /tmp/LTL8853516137720166250.ltl : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13689209192038306487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8853516137720166250.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.u27.p141==0)||(u14.p11==1))"))))
Formula 0 simplified : FG!"((i4.u27.p141==0)||(u14.p11==1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t130, u13.t90, u14.t11, u48.t5, u48.t31, i0.u2.t8, i0.u2.t51, i0.u2.t55, i0.u2....516
Computing Next relation with stutter on 850244 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2220133554841693282
[2024-05-21 23:36:57] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2220133554841693282
Running compilation step : cd /tmp/ltsmin2220133554841693282;'/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 245 ms.
Running link step : cd /tmp/ltsmin2220133554841693282;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin2220133554841693282;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-20a-LTLCardinality-05 finished in 94270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 23:37:12] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:37:12] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-21 23:37:12] [INFO ] Invariant cache hit.
[2024-05-21 23:37:12] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-21 23:37:12] [INFO ] Invariant cache hit.
[2024-05-21 23:37:12] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 595 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s17 0) (EQ s167 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 234 ms.
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 26 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLCardinality-06 finished in 1214 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 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 23:37:13] [INFO ] Invariant cache hit.
[2024-05-21 23:37:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 23:37:13] [INFO ] Invariant cache hit.
[2024-05-21 23:37:13] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-21 23:37:13] [INFO ] Invariant cache hit.
[2024-05-21 23:37:13] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-07 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:(AND (NEQ s32 0) (NEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-07 finished in 516 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 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /193 variables (removed 1) and now considering 136/137 (removed 1) transitions.
// Phase 1: matrix 136 rows 192 cols
[2024-05-21 23:37:14] [INFO ] Computed 58 invariants in 4 ms
[2024-05-21 23:37:14] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-21 23:37:14] [INFO ] Invariant cache hit.
[2024-05-21 23:37:14] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-21 23:37:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:37:14] [INFO ] Invariant cache hit.
[2024-05-21 23:37:14] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 634 ms. Remains : 192/193 places, 136/137 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s68 0) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-09 finished in 683 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)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 23:37:14] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:37:14] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-21 23:37:14] [INFO ] Invariant cache hit.
[2024-05-21 23:37:15] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-21 23:37:15] [INFO ] Invariant cache hit.
[2024-05-21 23:37:15] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s115 0) (EQ s75 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][false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-10 finished in 557 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 U (G(p0)||(G(p2)&&p1))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 23:37:15] [INFO ] Invariant cache hit.
[2024-05-21 23:37:15] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 23:37:15] [INFO ] Invariant cache hit.
[2024-05-21 23:37:15] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-05-21 23:37:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:37:15] [INFO ] Invariant cache hit.
[2024-05-21 23:37:15] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 511 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-20a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s40 1) (OR (EQ s25 0) (EQ s147 1))), p2:(NEQ s4 1), p0:(OR (EQ s25 0) (EQ s147 1))], 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 2210 reset in 292 ms.
Product exploration explored 100000 steps with 2223 reset in 311 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (AND p2 p0)), (X (AND p1 p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0))))]
Knowledge based reduction with 16 factoid took 518 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 23:37:17] [INFO ] Invariant cache hit.
[2024-05-21 23:37:17] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-21 23:37:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-21 23:37:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 41 ms returned sat
[2024-05-21 23:37:18] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-21 23:37:18] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 114 ms.
[2024-05-21 23:37:18] [INFO ] After 565ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 95 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 736538 steps, run timeout after 3001 ms. (steps per millisecond=245 ) properties seen :{}
Probabilistic random walk after 736538 steps, saw 105840 distinct states, run finished after 3001 ms. (steps per millisecond=245 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 23:37:21] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:37:21] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 23:37:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:37:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 71 ms returned sat
[2024-05-21 23:37:22] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 23:37:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 23:37:22] [INFO ] After 86ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 23:37:22] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-21 23:37:22] [INFO ] After 600ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-21 23:37:22] [INFO ] Invariant cache hit.
[2024-05-21 23:37:22] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 23:37:22] [INFO ] Invariant cache hit.
[2024-05-21 23:37:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 23:37:22] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-21 23:37:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:37:22] [INFO ] Invariant cache hit.
[2024-05-21 23:37:23] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 541 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 23:37:23] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 23:37:23] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 23:37:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:37:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2024-05-21 23:37:23] [INFO ] After 134ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 23:37:23] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-21 23:37:23] [INFO ] After 298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 100 ms.
[2024-05-21 23:37:23] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (AND p2 p0)), (X (AND p1 p2 p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p0) p2 p1)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND (NOT p2) p0))))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND p1 p2 p0)))), (F (NOT (AND p0 p2 p1))), (F (OR (NOT p2) (NOT p1))), (F (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))]
Knowledge based reduction with 18 factoid took 868 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 23:37:24] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:37:24] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 23:37:24] [INFO ] Invariant cache hit.
[2024-05-21 23:37:25] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-21 23:37:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:37:25] [INFO ] Invariant cache hit.
[2024-05-21 23:37:25] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 443 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (AND p0 p2 p1)), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1))))]
Knowledge based reduction with 10 factoid took 331 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 8) seen :3
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-21 23:37:26] [INFO ] Invariant cache hit.
[2024-05-21 23:37:26] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-21 23:37:26] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 23:37:26] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-21 23:37:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2024-05-21 23:37:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2024-05-21 23:37:26] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-05-21 23:37:26] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-05-21 23:37:26] [INFO ] After 475ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 137 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 276 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 966944 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :{}
Probabilistic random walk after 966944 steps, saw 137207 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 23:37:30] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 23:37:30] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-21 23:37:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 23:37:30] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 23:37:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:37:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2024-05-21 23:37:30] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 23:37:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 23:37:30] [INFO ] After 114ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-21 23:37:30] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 106 ms.
[2024-05-21 23:37:30] [INFO ] After 676ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2024-05-21 23:37:30] [INFO ] Invariant cache hit.
[2024-05-21 23:37:31] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-21 23:37:31] [INFO ] Invariant cache hit.
[2024-05-21 23:37:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 23:37:31] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-21 23:37:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:37:31] [INFO ] Invariant cache hit.
[2024-05-21 23:37:31] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 490 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 19 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 135 rows 193 cols
[2024-05-21 23:37:31] [INFO ] Computed 60 invariants in 1 ms
[2024-05-21 23:37:31] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:37:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2024-05-21 23:37:31] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 23:37:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:37:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2024-05-21 23:37:31] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 23:37:31] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 90 ms.
[2024-05-21 23:37:31] [INFO ] After 511ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (AND p0 p2 p1)), (X p0), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND p0 p2 p1)))), (F (NOT (AND p0 p1 p2))), (F (OR (NOT p1) (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))]
Knowledge based reduction with 11 factoid took 533 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2245 reset in 211 ms.
Product exploration explored 100000 steps with 2224 reset in 232 ms.
Built C files in :
/tmp/ltsmin8805947563730620851
[2024-05-21 23:37:33] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2024-05-21 23:37:33] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:37:33] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2024-05-21 23:37:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:37:33] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2024-05-21 23:37:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:37:33] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8805947563730620851
Running compilation step : cd /tmp/ltsmin8805947563730620851;'/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 284 ms.
Running link step : cd /tmp/ltsmin8805947563730620851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8805947563730620851;'/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/stateBased3050554413367057884.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 20 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2024-05-21 23:37:48] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:37:48] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 23:37:48] [INFO ] Invariant cache hit.
[2024-05-21 23:37:48] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-21 23:37:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 23:37:48] [INFO ] Invariant cache hit.
[2024-05-21 23:37:48] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 193/193 places, 137/137 transitions.
Built C files in :
/tmp/ltsmin14300353520026729970
[2024-05-21 23:37:48] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2024-05-21 23:37:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:37:48] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2024-05-21 23:37:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:37:48] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2024-05-21 23:37:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:37:48] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14300353520026729970
Running compilation step : cd /tmp/ltsmin14300353520026729970;'/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 288 ms.
Running link step : cd /tmp/ltsmin14300353520026729970;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin14300353520026729970;'/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/stateBased5678366288325982375.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 23:38:04] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:38:04] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:38:04] [INFO ] Time to serialize gal into /tmp/LTL1915362086205063484.gal : 2 ms
[2024-05-21 23:38:04] [INFO ] Time to serialize properties into /tmp/LTL9940311484902910683.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1915362086205063484.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1284136906408314645.hoa' '-atoms' '/tmp/LTL9940311484902910683.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL9940311484902910683.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1284136906408314645.hoa
Detected timeout of ITS tools.
[2024-05-21 23:38:19] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:38:19] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:38:19] [INFO ] Time to serialize gal into /tmp/LTL17824272524612407809.gal : 2 ms
[2024-05-21 23:38:19] [INFO ] Time to serialize properties into /tmp/LTL10080069703494718221.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17824272524612407809.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10080069703494718221.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p25==0)||(p148==1))")U((G("((p25==0)||(p148==1))"))||((("(p40!=1)")&&(G("(p4!=1)")))&&("((p25==0)||(p148==1))")))))))
Formula 0 simplified : FG((!"(p40!=1)" | F!"(p4!=1)") U !"((p25==0)||(p148==1))")
Detected timeout of ITS tools.
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 14 ms
[2024-05-21 23:38:34] [INFO ] Applying decomposition
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8957529395051689585.txt' '-o' '/tmp/graph8957529395051689585.bin' '-w' '/tmp/graph8957529395051689585.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8957529395051689585.bin' '-l' '-1' '-v' '-w' '/tmp/graph8957529395051689585.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:38:34] [INFO ] Decomposing Gal with order
[2024-05-21 23:38:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:38:34] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-21 23:38:34] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:38:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 5 ms.
[2024-05-21 23:38:34] [INFO ] Time to serialize gal into /tmp/LTL1048381317901548447.gal : 2 ms
[2024-05-21 23:38:34] [INFO ] Time to serialize properties into /tmp/LTL10334092971230766380.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1048381317901548447.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10334092971230766380.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u49.p25==0)||(i7.u32.p148==1))")U((G("((u49.p25==0)||(i7.u32.p148==1))"))||((("(u49.p40!=1)")&&(G("(i3.u14.p4!=1)")))&&("((...193
Formula 0 simplified : FG((!"(u49.p40!=1)" | F!"(i3.u14.p4!=1)") U !"((u49.p25==0)||(i7.u32.p148==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t130, u13.t90, u49.t5, u49.t31, i0.u2.t8, i0.u2.t51, i0.u2.t55, i0.u2.t56, i0.u...514
Computing Next relation with stutter on 850244 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9904717364108777164
[2024-05-21 23:38:49] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9904717364108777164
Running compilation step : cd /tmp/ltsmin9904717364108777164;'/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 260 ms.
Running link step : cd /tmp/ltsmin9904717364108777164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9904717364108777164;'/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' '--ltl' '[](<>(((LTLAPp0==true) U ([]((LTLAPp0==true))||([]((LTLAPp2==true))&&(LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-20a-LTLCardinality-12 finished in 109095 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 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 23:39:04] [INFO ] Invariant cache hit.
[2024-05-21 23:39:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 23:39:04] [INFO ] Invariant cache hit.
[2024-05-21 23:39:04] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-21 23:39:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:39:04] [INFO ] Invariant cache hit.
[2024-05-21 23:39:04] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 391 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s84 0) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-13 finished in 458 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 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2024-05-21 23:39:04] [INFO ] Invariant cache hit.
[2024-05-21 23:39:04] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 23:39:04] [INFO ] Invariant cache hit.
[2024-05-21 23:39:05] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-21 23:39:05] [INFO ] Invariant cache hit.
[2024-05-21 23:39:05] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLCardinality-15 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:(AND (EQ s46 0) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLCardinality-15 finished in 476 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)))'
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 U (G(p0)||(G(p2)&&p1))))))'
[2024-05-21 23:39:05] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4972424832074244445
[2024-05-21 23:39:05] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2024-05-21 23:39:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:39:05] [INFO ] Applying decomposition
[2024-05-21 23:39:05] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2024-05-21 23:39:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:39:05] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2024-05-21 23:39:05] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:39:05] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:39:05] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4972424832074244445
Running compilation step : cd /tmp/ltsmin4972424832074244445;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9346984334067887466.txt' '-o' '/tmp/graph9346984334067887466.bin' '-w' '/tmp/graph9346984334067887466.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9346984334067887466.bin' '-l' '-1' '-v' '-w' '/tmp/graph9346984334067887466.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:39:05] [INFO ] Decomposing Gal with order
[2024-05-21 23:39:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:39:05] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-21 23:39:05] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:39:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 23:39:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality6304449419373898107.gal : 3 ms
[2024-05-21 23:39:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality9227213639572413317.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6304449419373898107.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9227213639572413317.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F("((i4.u27.p141==0)||(u14.p11==1))"))))
Formula 0 simplified : FG!"((i4.u27.p141==0)||(u14.p11==1))"
Compilation finished in 289 ms.
Running link step : cd /tmp/ltsmin4972424832074244445;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4972424832074244445;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t130, u13.t90, u14.t11, u48.t5, u48.t31, i0.u2.t8, i0.u2.t51, i0.u2.t55, i0.u2....519
Computing Next relation with stutter on 850244 deadlock states
97 unique states visited
0 strongly connected components in search stack
118 transitions explored
60 items max in DFS search stack
17942 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,179.451,2197640,1,0,6.30393e+06,38782,854,4.50843e+06,750,197638,3587943
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-20a-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("((u48.p25==0)||(i10.u31.p148==1))")U((G("((u48.p25==0)||(i10.u31.p148==1))"))||(("((u48.p40!=1)&&((u48.p25==0)||(i10.u31.p148...189
Formula 1 simplified : FG(!"((u48.p25==0)||(i10.u31.p148==1))" M (!"((u48.p40!=1)&&((u48.p25==0)||(i10.u31.p148==1)))" | F!"(u14.p4!=1)"))
Computing Next relation with stutter on 850244 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: Initializing POR dependencies: labels 141, guards 137
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.107: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.107: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.107: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.164: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.166: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.172: There are 143 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.172: State length is 194, there are 140 groups
pins2lts-mc-linux64( 0/ 8), 0.172: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.172: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.172: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.172: Visible groups: 0 / 140, labels: 1 / 143
pins2lts-mc-linux64( 0/ 8), 0.172: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.172: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.203: [Blue] ~92 levels ~960 states ~1584 transitions
pins2lts-mc-linux64( 5/ 8), 0.222: [Blue] ~102 levels ~1920 states ~3328 transitions
pins2lts-mc-linux64( 5/ 8), 0.245: [Blue] ~102 levels ~3840 states ~7128 transitions
pins2lts-mc-linux64( 1/ 8), 0.306: [Blue] ~441 levels ~7680 states ~11888 transitions
pins2lts-mc-linux64( 4/ 8), 0.404: [Blue] ~113 levels ~15360 states ~24008 transitions
pins2lts-mc-linux64( 6/ 8), 0.565: [Blue] ~1610 levels ~30720 states ~43984 transitions
pins2lts-mc-linux64( 6/ 8), 0.822: [Blue] ~1879 levels ~61440 states ~86024 transitions
pins2lts-mc-linux64( 6/ 8), 1.304: [Blue] ~2176 levels ~122880 states ~166984 transitions
pins2lts-mc-linux64( 6/ 8), 2.126: [Blue] ~2529 levels ~245760 states ~332224 transitions
pins2lts-mc-linux64( 6/ 8), 3.546: [Blue] ~2529 levels ~491520 states ~670720 transitions
pins2lts-mc-linux64( 7/ 8), 5.658: [Blue] ~3952 levels ~983040 states ~1387352 transitions
pins2lts-mc-linux64( 0/ 8), 9.527: [Blue] ~251 levels ~1966080 states ~3444856 transitions
pins2lts-mc-linux64( 0/ 8), 16.996: [Blue] ~353 levels ~3932160 states ~6882888 transitions
pins2lts-mc-linux64( 0/ 8), 31.923: [Blue] ~557 levels ~7864320 states ~13753872 transitions
pins2lts-mc-linux64( 0/ 8), 61.494: [Blue] ~951 levels ~15728640 states ~27317952 transitions
pins2lts-mc-linux64( 3/ 8), 133.268: [Blue] ~863 levels ~31457280 states ~57907728 transitions
pins2lts-mc-linux64( 3/ 8), 261.160: [Blue] ~911 levels ~62914560 states ~116479520 transitions
pins2lts-mc-linux64( 3/ 8), 411.383: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 411.531:
pins2lts-mc-linux64( 0/ 8), 411.531: Explored 85155618 states 119431769 transitions, fanout: 1.403
pins2lts-mc-linux64( 0/ 8), 411.531: Total exploration time 411.340 sec (411.170 sec minimum, 411.244 sec on average)
pins2lts-mc-linux64( 0/ 8), 411.531: States per second: 207020, Transitions per second: 290348
pins2lts-mc-linux64( 0/ 8), 411.531:
pins2lts-mc-linux64( 0/ 8), 411.531: State space has 83764579 states, 15201342 are accepting
pins2lts-mc-linux64( 0/ 8), 411.531: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 411.531: blue states: 85155618 (101.66%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 411.531: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 411.531: all-red states: 15201342 (18.15%), bogus 3294 (0.00%)
pins2lts-mc-linux64( 0/ 8), 411.531:
pins2lts-mc-linux64( 0/ 8), 411.531: Total memory used for local state coloring: 6.2MB
pins2lts-mc-linux64( 0/ 8), 411.531:
pins2lts-mc-linux64( 0/ 8), 411.531: Queue width: 8B, total height: 409195, memory: 3.12MB
pins2lts-mc-linux64( 0/ 8), 411.531: Tree memory: 895.1MB, 11.2 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 411.531: Tree fill ratio (roots/leafs): 62.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 411.531: Stored 137 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 411.531: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 411.531: Est. total memory use: 898.2MB (~1027.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4972424832074244445;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4972424832074244445;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-22 00:00:18] [INFO ] Applying decomposition
[2024-05-22 00:00:18] [INFO ] Flatten gal took : 102 ms
[2024-05-22 00:00:18] [INFO ] Decomposing Gal with order
[2024-05-22 00:00:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:00:19] [INFO ] Removed a total of 153 redundant transitions.
[2024-05-22 00:00:19] [INFO ] Flatten gal took : 46 ms
[2024-05-22 00:00:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 11 ms.
[2024-05-22 00:00:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality12307034319221762375.gal : 27 ms
[2024-05-22 00:00:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality16184144254389531867.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12307034319221762375.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16184144254389531867.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F(("((u2.p25==0)||(u38.p148==1))")U((G("((u2.p25==0)||(u38.p148==1))"))||(("((u2.p40!=1)&&((u2.p25==0)||(u38.p148==1)))")&&(G("(u...172
Formula 0 simplified : FG(!"((u2.p25==0)||(u38.p148==1))" M (!"((u2.p40!=1)&&((u2.p25==0)||(u38.p148==1)))" | F!"(u1.p4!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t30, t50, t70, t77, t97, t98, t106, t128, t130, t134, u5.t10, u6.t9, u7.t8, u12.t135,...278
Computing Next relation with stutter on 850244 deadlock states
Detected timeout of ITS tools.
[2024-05-22 00:21:31] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:21:31] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-22 00:21:31] [INFO ] Transformed 193 places.
[2024-05-22 00:21:31] [INFO ] Transformed 137 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:21:31] [INFO ] Time to serialize gal into /tmp/LTLCardinality6640145931030757646.gal : 4 ms
[2024-05-22 00:21:31] [INFO ] Time to serialize properties into /tmp/LTLCardinality17865495791946273724.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6640145931030757646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17865495791946273724.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p25==0)||(p148==1))")U((G("((p25==0)||(p148==1))"))||(("((p40!=1)&&((p25==0)||(p148==1)))")&&(G("(p4!=1)"))))))))
Formula 0 simplified : FG(!"((p25==0)||(p148==1))" M (!"((p40!=1)&&((p25==0)||(p148==1)))" | F!"(p4!=1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 164236 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15744460 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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="DES-PT-20a"
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 DES-PT-20a, 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 r109-tall-171624208500427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a 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 '
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 ;