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

About the Execution of 2023-gold for DrinkVendingMachine-COL-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
314.207 11620.00 18691.00 744.30 TTTTTFFTFTFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151800407.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 DrinkVendingMachine-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151800407
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 6.2K Apr 12 23:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 12 23:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 23:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 23:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 12 23:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 23:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 12 23:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 22K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716447666609

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=DrinkVendingMachine-COL-02
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-23 07:01:08] [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-23 07:01:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:01:08] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-23 07:01:08] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-23 07:01:08] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 424 ms
[2024-05-23 07:01:08] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 24 PT places and 252.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-23 07:01:09] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 490 ms.
[2024-05-23 07:01:09] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 24) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 7 rows 6 cols
[2024-05-23 07:01:09] [INFO ] Computed 3 invariants in 9 ms
[2024-05-23 07:01:09] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-23 07:01:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 07:01:09] [INFO ] After 40ms SMT Verify possible using all constraints in natural 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 12 simplifications.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 07:01:09] [INFO ] Flatten gal took : 12 ms
[2024-05-23 07:01:09] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:8) in guard (AND (GT $x 5) (LEQ $x 7))introduces in Quality(8) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:8) in guard (AND (GT $x 3) (LEQ $x 5))introduces in Quality(8) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:8) in guard (AND (GT $x 1) (LEQ $x 3))introduces in Quality(8) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:8) in guard (LEQ $x 1)introduces in Quality(8) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 8 reducing to 4 values.
For transition elaborate3:(AND (GT $x 5) (LEQ $x 7)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 3) (LEQ $x 5)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 1) (LEQ $x 3)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 1) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 2
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 2
[2024-05-23 07:01:09] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 8 ms.
[2024-05-23 07:01:09] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 5 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-05-23 07:01:09] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 07:01:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 1 transitions.
Found 1 dead transitions using SMT.
Drop transitions removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-23 07:01:09] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 07:01:09] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-23 07:01:09] [INFO ] Invariant cache hit.
[2024-05-23 07:01:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/12 places, 9/10 transitions.
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/9 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 12/12 places, 8/10 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Support contains 10 out of 10 places after structural reductions.
[2024-05-23 07:01:09] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:01:09] [INFO ] Flatten gal took : 2 ms
[2024-05-23 07:01:09] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 20) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 8 rows 10 cols
[2024-05-23 07:01:10] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 07:01:10] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-23 07:01:10] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2024-05-23 07:01:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-23 07:01:10] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)&&X(X(F(p1)))))'
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 07:01:10] [INFO ] Invariant cache hit.
[2024-05-23 07:01:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-23 07:01:10] [INFO ] Invariant cache hit.
[2024-05-23 07:01:10] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-23 07:01:10] [INFO ] Invariant cache hit.
[2024-05-23 07:01:10] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-23 07:01:10] [INFO ] Invariant cache hit.
[2024-05-23 07:01:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 10/10 places, 8/8 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 317 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s7), p1:(LEQ 1 (ADD s0 s1 s2))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29704 reset in 222 ms.
Product exploration explored 100000 steps with 29659 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 198 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-23 07:01:12] [INFO ] Invariant cache hit.
[2024-05-23 07:01:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-23 07:01:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:01:12] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-23 07:01:12] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-23 07:01:12] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 10 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 07:01:12] [INFO ] Invariant cache hit.
[2024-05-23 07:01:12] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-23 07:01:12] [INFO ] Invariant cache hit.
[2024-05-23 07:01:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-23 07:01:12] [INFO ] Invariant cache hit.
[2024-05-23 07:01:12] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-23 07:01:12] [INFO ] Invariant cache hit.
[2024-05-23 07:01:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 10/10 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-23 07:01:13] [INFO ] Invariant cache hit.
[2024-05-23 07:01:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-23 07:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 07:01:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-23 07:01:13] [INFO ] Computed and/alt/rep : 5/8/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 07:01:13] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 29721 reset in 81 ms.
Product exploration explored 100000 steps with 29635 reset in 180 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 7 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-05-23 07:01:14] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 07:01:14] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-23 07:01:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:01:14] [INFO ] Invariant cache hit.
[2024-05-23 07:01:14] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/10 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 10/10 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin17968085028400633493
[2024-05-23 07:01:14] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17968085028400633493
Running compilation step : cd /tmp/ltsmin17968085028400633493;'/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 167 ms.
Running link step : cd /tmp/ltsmin17968085028400633493;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17968085028400633493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7010607709878613659.hoa' '--buchi-type=spotba'
LTSmin run took 341 ms.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DrinkVendingMachine-COL-02-LTLCardinality-03 finished in 4226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(p1)&&X(p2)))))'
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-05-23 07:01:14] [INFO ] Computed 5 invariants in 1 ms
[2024-05-23 07:01:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2024-05-23 07:01:14] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s9), p1:(OR (GT s9 (ADD s0 s1 s2)) (GT 2 s6)), p2:(AND (LEQ 1 s9) (GT s9 (ADD s0 s1 s2)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1066 reset in 199 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLCardinality-05 finished in 469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s0 s1 s2) s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 18712 reset in 118 ms.
Stack based approach found an accepted trace after 9 steps with 1 reset with depth 6 and stack size 6 in 0 ms.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLCardinality-08 finished in 382 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)&&G(F(p1))))'
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-23 07:01:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:01:15] [INFO ] Invariant cache hit.
[2024-05-23 07:01:15] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ (ADD s3 s4 s5 2) s8), p1:(LEQ s9 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Stack based approach found an accepted trace after 18 steps with 1 reset with depth 13 and stack size 13 in 0 ms.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLCardinality-10 finished in 395 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(((p0 U p1)||(G(!p0)&&F(p2)))))'
Support contains 8 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-23 07:01:16] [INFO ] Invariant cache hit.
[2024-05-23 07:01:16] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-23 07:01:16] [INFO ] Invariant cache hit.
[2024-05-23 07:01:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 07:01:16] [INFO ] Invariant cache hit.
[2024-05-23 07:01:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-23 07:01:16] [INFO ] Invariant cache hit.
[2024-05-23 07:01:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 231 ms :[p0, (OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=5, aps=[p0:(LEQ 3 (ADD s3 s4 s5 2)), p2:(LEQ s6 s8), p1:(LEQ (ADD s0 s1 s2) s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 35534 reset in 98 ms.
Stack based approach found an accepted trace after 439 steps with 157 reset with depth 6 and stack size 6 in 1 ms.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLCardinality-11 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1&&F(p0)))))'
Support contains 2 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
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 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 2 transition count 4
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 2 transition count 2
Applied a total of 14 rules in 3 ms. Remains 2 /10 variables (removed 8) and now considering 2/8 (removed 6) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-05-23 07:01:16] [INFO ] Computed 1 invariants in 1 ms
[2024-05-23 07:01:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-23 07:01:16] [INFO ] Invariant cache hit.
[2024-05-23 07:01:16] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-23 07:01:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 07:01:16] [INFO ] Invariant cache hit.
[2024-05-23 07:01:16] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/10 places, 2/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 2/10 places, 2/8 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s1 s0), p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 12 steps with 4 reset in 0 ms.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLCardinality-13 finished in 221 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((p0||G(p1))))'
Support contains 8 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-05-23 07:01:16] [INFO ] Computed 5 invariants in 0 ms
[2024-05-23 07:01:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-23 07:01:16] [INFO ] Invariant cache hit.
[2024-05-23 07:01:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-23 07:01:16] [INFO ] Invariant cache hit.
[2024-05-23 07:01:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-23 07:01:16] [INFO ] Invariant cache hit.
[2024-05-23 07:01:16] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 10/10 places, 8/8 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DrinkVendingMachine-COL-02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LEQ s6 s8), p0:(LEQ (ADD s3 s4 s5 2) (ADD s0 s1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DrinkVendingMachine-COL-02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DrinkVendingMachine-COL-02-LTLCardinality-15 finished in 255 ms.
All properties solved by simple procedures.
Total runtime 9052 ms.

BK_STOP 1716447678229

--------------------
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="DrinkVendingMachine-COL-02"
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 DrinkVendingMachine-COL-02, 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 r153-tall-171631151800407"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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