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.r351-tall-171679101500052.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 RingSingleMessageInMbox-PT-d1m040, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679101500052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.3M
-rw-r--r-- 1 mcc users 8.2K 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 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 23:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 23:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 23:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M May 18 16:43 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 RingSingleMessageInMbox-PT-d1m040-LTLCardinality-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m040-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716843624504

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=RingSingleMessageInMbox-PT-d1m040
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 21:00:26] [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-27 21:00:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:00:26] [INFO ] Load time of PNML (sax parser for PT used): 592 ms
[2024-05-27 21:00:27] [INFO ] Transformed 6690 places.
[2024-05-27 21:00:27] [INFO ] Transformed 11934 transitions.
[2024-05-27 21:00:27] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 743 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
Deduced a syphon composed of 4305 places in 49 ms
Reduce places removed 4305 places and 0 transitions.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 2368 transition count 11832
Discarding 1103 places :
Symmetric choice reduction at 1 with 1103 rule applications. Total rules 1222 place count 1265 transition count 2425
Iterating global reduction 1 with 1103 rules applied. Total rules applied 2325 place count 1265 transition count 2425
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 2397 place count 1265 transition count 2353
Discarding 937 places :
Symmetric choice reduction at 2 with 937 rule applications. Total rules 3334 place count 328 transition count 1416
Iterating global reduction 2 with 937 rules applied. Total rules applied 4271 place count 328 transition count 1416
Ensure Unique test removed 890 transitions
Reduce isomorphic transitions removed 890 transitions.
Iterating post reduction 2 with 890 rules applied. Total rules applied 5161 place count 328 transition count 526
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 5291 place count 198 transition count 396
Iterating global reduction 3 with 130 rules applied. Total rules applied 5421 place count 198 transition count 396
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5519 place count 198 transition count 298
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 5527 place count 190 transition count 290
Iterating global reduction 4 with 8 rules applied. Total rules applied 5535 place count 190 transition count 290
Applied a total of 5535 rules in 342 ms. Remains 190 /2385 variables (removed 2195) and now considering 290/11934 (removed 11644) transitions.
// Phase 1: matrix 290 rows 190 cols
[2024-05-27 21:00:27] [INFO ] Computed 3 invariants in 26 ms
[2024-05-27 21:00:28] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-27 21:00:28] [INFO ] Invariant cache hit.
[2024-05-27 21:00:28] [INFO ] State equation strengthened by 111 read => feed constraints.
[2024-05-27 21:00:28] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2024-05-27 21:00:28] [INFO ] Invariant cache hit.
[2024-05-27 21:00:28] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/2385 places, 290/11934 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1412 ms. Remains : 190/2385 places, 290/11934 transitions.
Support contains 6 out of 190 places after structural reductions.
[2024-05-27 21:00:28] [INFO ] Flatten gal took : 50 ms
[2024-05-27 21:00:29] [INFO ] Flatten gal took : 28 ms
[2024-05-27 21:00:29] [INFO ] Input system was already deterministic with 290 transitions.
Incomplete random walk after 10000 steps, including 1818 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 452 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 466 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-27 21:00:29] [INFO ] Invariant cache hit.
[2024-05-27 21:00:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 21:00:29] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:00:29] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 3 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 46 stable transitions
Graph (complete) has 705 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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(G(p0)) U (G(F(p1))||G(p2)))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 290/290 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 287
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 184 transition count 284
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 184 transition count 284
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 184 transition count 281
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 183 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 183 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 182 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 182 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 182 transition count 266
Applied a total of 20 rules in 16 ms. Remains 182 /190 variables (removed 8) and now considering 266/290 (removed 24) transitions.
// Phase 1: matrix 266 rows 182 cols
[2024-05-27 21:00:29] [INFO ] Computed 3 invariants in 5 ms
[2024-05-27 21:00:30] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-27 21:00:30] [INFO ] Invariant cache hit.
[2024-05-27 21:00:30] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-27 21:00:30] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
[2024-05-27 21:00:30] [INFO ] Invariant cache hit.
[2024-05-27 21:00:30] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 182/190 places, 266/290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1028 ms. Remains : 182/190 places, 266/290 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 346 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s93 0), p2:(LEQ s11 0), p0:(LEQ 1 s98)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20713 reset in 319 ms.
Product exploration explored 100000 steps with 20717 reset in 238 ms.
Computed a total of 5 stabilizing places and 28 stable transitions
Graph (complete) has 666 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 136 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2080 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 664 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 655 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 723 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 21:00:32] [INFO ] Invariant cache hit.
[2024-05-27 21:00:32] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 21:00:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:00:32] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:00:32] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2)), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 489 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Support contains 2 out of 182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 266/266 transitions.
Applied a total of 0 rules in 26 ms. Remains 182 /182 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-27 21:00:33] [INFO ] Invariant cache hit.
[2024-05-27 21:00:33] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-27 21:00:33] [INFO ] Invariant cache hit.
[2024-05-27 21:00:33] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-27 21:00:33] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2024-05-27 21:00:33] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-27 21:00:33] [INFO ] Invariant cache hit.
[2024-05-27 21:00:34] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 868 ms. Remains : 182/182 places, 266/266 transitions.
Computed a total of 5 stabilizing places and 28 stable transitions
Graph (complete) has 666 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) p2))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2019 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 637 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:00:34] [INFO ] Invariant cache hit.
[2024-05-27 21:00:34] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:00:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-27 21:00:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 8 ms returned sat
[2024-05-27 21:00:34] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) p2))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X p1)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 20579 reset in 212 ms.
Product exploration explored 100000 steps with 20646 reset in 247 ms.
Built C files in :
/tmp/ltsmin13337832378398651546
[2024-05-27 21:00:35] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-27 21:00:35] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:00:35] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-27 21:00:35] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:00:35] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-27 21:00:35] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:00:35] [INFO ] Built C files in 108ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13337832378398651546
Running compilation step : cd /tmp/ltsmin13337832378398651546;'/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 717 ms.
Running link step : cd /tmp/ltsmin13337832378398651546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13337832378398651546;'/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/stateBased1014894904983237943.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 266/266 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 181 transition count 265
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 181 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 181 transition count 264
Applied a total of 3 rules in 30 ms. Remains 181 /182 variables (removed 1) and now considering 264/266 (removed 2) transitions.
// Phase 1: matrix 264 rows 181 cols
[2024-05-27 21:00:50] [INFO ] Computed 3 invariants in 3 ms
[2024-05-27 21:00:51] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-27 21:00:51] [INFO ] Invariant cache hit.
[2024-05-27 21:00:51] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-05-27 21:00:51] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2024-05-27 21:00:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 21:00:51] [INFO ] Invariant cache hit.
[2024-05-27 21:00:51] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 181/182 places, 264/266 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 801 ms. Remains : 181/182 places, 264/266 transitions.
Built C files in :
/tmp/ltsmin8381145655231417481
[2024-05-27 21:00:51] [INFO ] Computing symmetric may disable matrix : 264 transitions.
[2024-05-27 21:00:51] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:00:51] [INFO ] Computing symmetric may enable matrix : 264 transitions.
[2024-05-27 21:00:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:00:51] [INFO ] Computing Do-Not-Accords matrix : 264 transitions.
[2024-05-27 21:00:51] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:00:51] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8381145655231417481
Running compilation step : cd /tmp/ltsmin8381145655231417481;'/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 599 ms.
Running link step : cd /tmp/ltsmin8381145655231417481;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8381145655231417481;'/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/stateBased4216494629919946866.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 21:01:06] [INFO ] Flatten gal took : 44 ms
[2024-05-27 21:01:07] [INFO ] Flatten gal took : 19 ms
[2024-05-27 21:01:07] [INFO ] Time to serialize gal into /tmp/LTL1683336283611527711.gal : 27 ms
[2024-05-27 21:01:07] [INFO ] Time to serialize properties into /tmp/LTL18043701813859679426.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/LTL1683336283611527711.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13638250811171149462.hoa' '-atoms' '/tmp/LTL18043701813859679426.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/LTL18043701813859679426.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13638250811171149462.hoa
Detected timeout of ITS tools.
[2024-05-27 21:01:22] [INFO ] Flatten gal took : 26 ms
[2024-05-27 21:01:22] [INFO ] Flatten gal took : 34 ms
[2024-05-27 21:01:22] [INFO ] Time to serialize gal into /tmp/LTL8580054171464294186.gal : 3 ms
[2024-05-27 21:01:22] [INFO ] Time to serialize properties into /tmp/LTL14034900635763912120.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/LTL8580054171464294186.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14034900635763912120.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 : !((X((F(G("(l3028>=1)")))U((G(F("(l2581<=0)")))||(G("(p836<=0)"))))))
Formula 0 simplified : X(GF!"(l3028>=1)" R (FG!"(l2581<=0)" & F!"(p836<=0)"))
Detected timeout of ITS tools.
[2024-05-27 21:01:37] [INFO ] Flatten gal took : 16 ms
[2024-05-27 21:01:37] [INFO ] Applying decomposition
[2024-05-27 21:01:37] [INFO ] Flatten gal took : 14 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/graph8309466499105758661.txt' '-o' '/tmp/graph8309466499105758661.bin' '-w' '/tmp/graph8309466499105758661.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8309466499105758661.bin' '-l' '-1' '-v' '-w' '/tmp/graph8309466499105758661.weights' '-q' '0' '-e' '0.001'
[2024-05-27 21:01:37] [INFO ] Decomposing Gal with order
[2024-05-27 21:01:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 21:01:37] [INFO ] Removed a total of 264 redundant transitions.
[2024-05-27 21:01:37] [INFO ] Flatten gal took : 215 ms
[2024-05-27 21:01:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 161 labels/synchronizations in 37 ms.
[2024-05-27 21:01:37] [INFO ] Time to serialize gal into /tmp/LTL1235355988697317529.gal : 31 ms
[2024-05-27 21:01:37] [INFO ] Time to serialize properties into /tmp/LTL6899248651533098657.ltl : 31 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/LTL1235355988697317529.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6899248651533098657.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...254
Read 1 LTL properties
Checking formula 0 : !((X((F(G("(u0.l3028>=1)")))U((G(F("(u0.l2581<=0)")))||(G("(u0.p836<=0)"))))))
Formula 0 simplified : X(GF!"(u0.l3028>=1)" R (FG!"(u0.l2581<=0)" & F!"(u0.p836<=0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6376576653290769211
[2024-05-27 21:01:52] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6376576653290769211
Running compilation step : cd /tmp/ltsmin6376576653290769211;'/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 438 ms.
Running link step : cd /tmp/ltsmin6376576653290769211;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6376576653290769211;'/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' 'X((<>([]((LTLAPp0==true))) U ([](<>((LTLAPp1==true)))||[]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLCardinality-02 finished in 98395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 290/290 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 185 transition count 285
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 185 transition count 285
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 185 transition count 283
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 182 transition count 280
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 182 transition count 280
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 21 place count 182 transition count 277
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 23 place count 180 transition count 251
Iterating global reduction 2 with 2 rules applied. Total rules applied 25 place count 180 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 179 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 179 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 179 transition count 249
Applied a total of 28 rules in 69 ms. Remains 179 /190 variables (removed 11) and now considering 249/290 (removed 41) transitions.
// Phase 1: matrix 249 rows 179 cols
[2024-05-27 21:02:08] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 21:02:08] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-05-27 21:02:08] [INFO ] Invariant cache hit.
[2024-05-27 21:02:08] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-27 21:02:09] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
[2024-05-27 21:02:09] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-27 21:02:09] [INFO ] Invariant cache hit.
[2024-05-27 21:02:09] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 179/190 places, 249/290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1201 ms. Remains : 179/190 places, 249/290 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s11 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLCardinality-13 finished in 1278 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(G(p0)) U (G(F(p1))||G(p2)))))'
Found a Lengthening insensitive property : RingSingleMessageInMbox-PT-d1m040-LTLCardinality-02
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2)]
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 290/290 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 287
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 184 transition count 284
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 184 transition count 284
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 184 transition count 281
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 183 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 183 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 182 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 182 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 182 transition count 266
Applied a total of 20 rules in 27 ms. Remains 182 /190 variables (removed 8) and now considering 266/290 (removed 24) transitions.
// Phase 1: matrix 266 rows 182 cols
[2024-05-27 21:02:09] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 21:02:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-27 21:02:09] [INFO ] Invariant cache hit.
[2024-05-27 21:02:09] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-27 21:02:10] [INFO ] Implicit Places using invariants and state equation in 622 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
[2024-05-27 21:02:10] [INFO ] Invariant cache hit.
[2024-05-27 21:02:10] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 182/190 places, 266/290 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 894 ms. Remains : 182/190 places, 266/290 transitions.
Running random walk in product with property : RingSingleMessageInMbox-PT-d1m040-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s93 0), p2:(LEQ s11 0), p0:(LEQ 1 s98)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20491 reset in 187 ms.
Product exploration explored 100000 steps with 20539 reset in 196 ms.
Computed a total of 5 stabilizing places and 28 stable transitions
Graph (complete) has 666 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 5 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 130 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2063 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 618 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 697 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 688 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-27 21:02:11] [INFO ] Invariant cache hit.
[2024-05-27 21:02:11] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 21:02:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:02:11] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:02:11] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (G (NOT (AND (NOT p1) p0))), (G (NOT (AND (NOT p1) (NOT p2) p0))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p2)), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 357 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) p2)]
Support contains 2 out of 182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 266/266 transitions.
Applied a total of 0 rules in 20 ms. Remains 182 /182 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-27 21:02:12] [INFO ] Invariant cache hit.
[2024-05-27 21:02:12] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-27 21:02:12] [INFO ] Invariant cache hit.
[2024-05-27 21:02:12] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-05-27 21:02:13] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-05-27 21:02:13] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-27 21:02:13] [INFO ] Invariant cache hit.
[2024-05-27 21:02:13] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 789 ms. Remains : 182/182 places, 266/266 transitions.
Computed a total of 5 stabilizing places and 28 stable transitions
Graph (complete) has 666 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) p2))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 84 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2054 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 634 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:02:13] [INFO ] Invariant cache hit.
[2024-05-27 21:02:13] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 21:02:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 21:02:13] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 21:02:13] [INFO ] After 103ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) p2))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X p1)), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 8 factoid took 217 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) p2)]
Product exploration explored 100000 steps with 20513 reset in 182 ms.
Product exploration explored 100000 steps with 20473 reset in 192 ms.
Built C files in :
/tmp/ltsmin4777488219232442934
[2024-05-27 21:02:14] [INFO ] Computing symmetric may disable matrix : 266 transitions.
[2024-05-27 21:02:14] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:02:14] [INFO ] Computing symmetric may enable matrix : 266 transitions.
[2024-05-27 21:02:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:02:14] [INFO ] Computing Do-Not-Accords matrix : 266 transitions.
[2024-05-27 21:02:14] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:02:14] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4777488219232442934
Running compilation step : cd /tmp/ltsmin4777488219232442934;'/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 577 ms.
Running link step : cd /tmp/ltsmin4777488219232442934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4777488219232442934;'/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/stateBased12565224328695342348.hoa' '--buchi-type=spotba'
LTSmin run took 456 ms.
Treatment of property RingSingleMessageInMbox-PT-d1m040-LTLCardinality-02 finished in 6545 ms.
FORMULA RingSingleMessageInMbox-PT-d1m040-LTLCardinality-02 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-27 21:02:15] [INFO ] Flatten gal took : 19 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 109663 ms.

BK_STOP 1716843737177

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RingSingleMessageInMbox-PT-d1m040"
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 RingSingleMessageInMbox-PT-d1m040, 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 r351-tall-171679101500052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RingSingleMessageInMbox-PT-d1m040.tgz
mv RingSingleMessageInMbox-PT-d1m040 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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