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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 23:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 12 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 23:46 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 64K 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-d0m080-LTLCardinality-00
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-01
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-02
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-03
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-04
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-05
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-06
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-07
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-08
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-09
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-10
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-11
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-12
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-13
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-14
FORMULA_NAME RingSingleMessageInMbox-PT-d0m080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716840029164

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-d0m080
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 20:00:30] [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 20:00:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:00:30] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2024-05-27 20:00:30] [INFO ] Transformed 385 places.
[2024-05-27 20:00:30] [INFO ] Transformed 59 transitions.
[2024-05-27 20:00:30] [INFO ] Parsed PT model containing 385 places and 59 transitions and 236 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Deduced a syphon composed of 329 places in 1 ms
Reduce places removed 329 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 59/59 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 59
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 9 place count 47 transition count 50
Iterating global reduction 1 with 7 rules applied. Total rules applied 16 place count 47 transition count 50
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 46 transition count 49
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 46 transition count 49
Applied a total of 18 rules in 16 ms. Remains 46 /56 variables (removed 10) and now considering 49/59 (removed 10) transitions.
// Phase 1: matrix 49 rows 46 cols
[2024-05-27 20:00:31] [INFO ] Computed 3 invariants in 12 ms
[2024-05-27 20:00:31] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-27 20:00:31] [INFO ] Invariant cache hit.
[2024-05-27 20:00:31] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:31] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-27 20:00:31] [INFO ] Invariant cache hit.
[2024-05-27 20:00:31] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/56 places, 49/59 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 46/56 places, 49/59 transitions.
Support contains 1 out of 46 places after structural reductions.
[2024-05-27 20:00:31] [INFO ] Flatten gal took : 21 ms
[2024-05-27 20:00:31] [INFO ] Flatten gal took : 9 ms
[2024-05-27 20:00:31] [INFO ] Input system was already deterministic with 49 transitions.
Incomplete random walk after 10000 steps, including 2162 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3335061 steps, run timeout after 3001 ms. (steps per millisecond=1111 ) properties seen :{}
Probabilistic random walk after 3335061 steps, saw 1281219 distinct states, run finished after 3002 ms. (steps per millisecond=1110 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:00:34] [INFO ] Invariant cache hit.
[2024-05-27 20:00:34] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-27 20:00:34] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-27 20:00:34] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-27 20:00:34] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:34] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:34] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:34] [INFO ] After 7ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:34] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-27 20:00:34] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 49/49 transitions.
Graph (complete) has 123 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 45 transition count 46
Applied a total of 4 rules in 18 ms. Remains 45 /46 variables (removed 1) and now considering 46/49 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 45/46 places, 46/49 transitions.
Incomplete random walk after 10000 steps, including 2171 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 952 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3460267 steps, run timeout after 3001 ms. (steps per millisecond=1153 ) properties seen :{}
Probabilistic random walk after 3460267 steps, saw 1322841 distinct states, run finished after 3001 ms. (steps per millisecond=1153 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 45 cols
[2024-05-27 20:00:37] [INFO ] Computed 4 invariants in 4 ms
[2024-05-27 20:00:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:37] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:37] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 20:00:37] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 20:00:37] [INFO ] After 5ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:37] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 20:00:37] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:37] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:37] [INFO ] After 5ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:37] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-27 20:00:37] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 45/45 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-27 20:00:37] [INFO ] Invariant cache hit.
[2024-05-27 20:00:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-27 20:00:38] [INFO ] Invariant cache hit.
[2024-05-27 20:00:38] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 20:00:38] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-27 20:00:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:00:38] [INFO ] Invariant cache hit.
[2024-05-27 20:00:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 45/45 places, 46/46 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 45 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 43
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 44 transition count 36
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 37 transition count 36
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 33 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 32 transition count 32
Applied a total of 28 rules in 12 ms. Remains 32 /45 variables (removed 13) and now considering 32/46 (removed 14) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 32 cols
[2024-05-27 20:00:38] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 20:00:38] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-27 20:00:38] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:38] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-27 20:00:38] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 20:00:38] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:38] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-27 20:00:38] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 142 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 46 cols
[2024-05-27 20:00:38] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 20:00:38] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-27 20:00:38] [INFO ] Invariant cache hit.
[2024-05-27 20:00:38] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:38] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-27 20:00:38] [INFO ] Invariant cache hit.
[2024-05-27 20:00:38] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 46/46 places, 49/49 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 215 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RingSingleMessageInMbox-PT-d0m080-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:(LEQ 3 s14)], 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]]
Product exploration explored 100000 steps with 21631 reset in 217 ms.
Product exploration explored 100000 steps with 21458 reset in 120 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 142 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2155 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 956 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3920993 steps, run timeout after 3001 ms. (steps per millisecond=1306 ) properties seen :{}
Probabilistic random walk after 3920993 steps, saw 1505728 distinct states, run finished after 3001 ms. (steps per millisecond=1306 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:00:42] [INFO ] Invariant cache hit.
[2024-05-27 20:00:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:42] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:42] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:42] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:42] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:42] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:42] [INFO ] After 8ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:42] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-27 20:00:42] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 49/49 transitions.
Graph (complete) has 123 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 45 transition count 46
Applied a total of 4 rules in 4 ms. Remains 45 /46 variables (removed 1) and now considering 46/49 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 45/46 places, 46/49 transitions.
Incomplete random walk after 10000 steps, including 2208 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4134243 steps, run timeout after 3004 ms. (steps per millisecond=1376 ) properties seen :{}
Probabilistic random walk after 4134243 steps, saw 1578010 distinct states, run finished after 3004 ms. (steps per millisecond=1376 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 45 cols
[2024-05-27 20:00:45] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 20:00:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 20:00:45] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:45] [INFO ] After 15ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 20:00:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 20:00:45] [INFO ] After 6ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:45] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 20:00:45] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:00:45] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:45] [INFO ] After 7ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:45] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-27 20:00:45] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 45/45 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-27 20:00:45] [INFO ] Invariant cache hit.
[2024-05-27 20:00:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-27 20:00:45] [INFO ] Invariant cache hit.
[2024-05-27 20:00:45] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 20:00:45] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-27 20:00:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:00:45] [INFO ] Invariant cache hit.
[2024-05-27 20:00:45] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 45/45 places, 46/46 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 45 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 43
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 44 transition count 36
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 37 transition count 36
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 33 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 32 transition count 32
Applied a total of 28 rules in 7 ms. Remains 32 /45 variables (removed 13) and now considering 32/46 (removed 14) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 32 cols
[2024-05-27 20:00:45] [INFO ] Computed 6 invariants in 3 ms
[2024-05-27 20:00:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-27 20:00:45] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:45] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:45] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:45] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-27 20:00:45] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 72 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 63 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 49/49 transitions.
Applied a total of 0 rules in 8 ms. Remains 46 /46 variables (removed 0) and now considering 49/49 (removed 0) transitions.
// Phase 1: matrix 49 rows 46 cols
[2024-05-27 20:00:46] [INFO ] Computed 3 invariants in 2 ms
[2024-05-27 20:00:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-27 20:00:46] [INFO ] Invariant cache hit.
[2024-05-27 20:00:46] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-27 20:00:46] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 20:00:46] [INFO ] Invariant cache hit.
[2024-05-27 20:00:46] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 145 ms. Remains : 46/46 places, 49/49 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Graph (complete) has 142 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 85 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 60 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2117 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3704103 steps, run timeout after 3001 ms. (steps per millisecond=1234 ) properties seen :{}
Probabilistic random walk after 3704103 steps, saw 1419934 distinct states, run finished after 3001 ms. (steps per millisecond=1234 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:00:49] [INFO ] Invariant cache hit.
[2024-05-27 20:00:49] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-27 20:00:49] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:49] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:49] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-27 20:00:49] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-27 20:00:49] [INFO ] After 5ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:49] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-27 20:00:49] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 49/49 transitions.
Graph (complete) has 123 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 45 transition count 46
Applied a total of 4 rules in 3 ms. Remains 45 /46 variables (removed 1) and now considering 46/49 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 45/46 places, 46/49 transitions.
Incomplete random walk after 10000 steps, including 2155 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3831913 steps, run timeout after 3001 ms. (steps per millisecond=1276 ) properties seen :{}
Probabilistic random walk after 3831913 steps, saw 1462627 distinct states, run finished after 3002 ms. (steps per millisecond=1276 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 45 cols
[2024-05-27 20:00:52] [INFO ] Computed 4 invariants in 2 ms
[2024-05-27 20:00:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:52] [INFO ] [Real]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:00:52] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 20:00:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 20:00:52] [INFO ] After 13ms SMT Verify possible using 18 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:52] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:52] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-27 20:00:52] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:52] [INFO ] After 4ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:52] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-27 20:00:52] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 45/45 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2024-05-27 20:00:52] [INFO ] Invariant cache hit.
[2024-05-27 20:00:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-27 20:00:52] [INFO ] Invariant cache hit.
[2024-05-27 20:00:52] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-27 20:00:52] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-27 20:00:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:00:52] [INFO ] Invariant cache hit.
[2024-05-27 20:00:52] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 45/45 places, 46/46 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 45 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 43
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 44 transition count 36
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 18 place count 37 transition count 36
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 33 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 32 transition count 32
Applied a total of 28 rules in 7 ms. Remains 32 /45 variables (removed 13) and now considering 32/46 (removed 14) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 32 cols
[2024-05-27 20:00:52] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 20:00:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-27 20:00:52] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:52] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:00:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-27 20:00:52] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-27 20:00:52] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 20:00:52] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-27 20:00:52] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 70 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 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 21385 reset in 71 ms.
Product exploration explored 100000 steps with 21587 reset in 81 ms.
Built C files in :
/tmp/ltsmin14953077020144385624
[2024-05-27 20:00:53] [INFO ] Computing symmetric may disable matrix : 49 transitions.
[2024-05-27 20:00:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:00:53] [INFO ] Computing symmetric may enable matrix : 49 transitions.
[2024-05-27 20:00:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:00:53] [INFO ] Computing Do-Not-Accords matrix : 49 transitions.
[2024-05-27 20:00:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:00:53] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14953077020144385624
Running compilation step : cd /tmp/ltsmin14953077020144385624;'/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 227 ms.
Running link step : cd /tmp/ltsmin14953077020144385624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14953077020144385624;'/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/stateBased12815841442812760267.hoa' '--buchi-type=spotba'
LTSmin run took 189 ms.
FORMULA RingSingleMessageInMbox-PT-d0m080-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RingSingleMessageInMbox-PT-d0m080-LTLCardinality-15 finished in 15473 ms.
All properties solved by simple procedures.
Total runtime 23244 ms.

BK_STOP 1716840054814

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

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

Sequence of Actions to be Executed by the VM

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

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

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