About the Execution of LTSMin+red for PermAdmissibility-COL-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
241.535 | 8253.00 | 13129.00 | 543.10 | 2 1 2 2 1 1 1 1 1 2 2 2 1 2 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r265-smll-167863540100461.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PermAdmissibility-COL-01, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540100461
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 01:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-00
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-01
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-02
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-03
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-04
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-05
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-06
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-07
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-08
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-09
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-10
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-11
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-12
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-13
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-14
FORMULA_NAME PermAdmissibility-COL-01-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679029753764
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-01
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 05:09:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-17 05:09:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 05:09:16] [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.
[2023-03-17 05:09:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 05:09:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 878 ms
[2023-03-17 05:09:17] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2023-03-17 05:09:17] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2023-03-17 05:09:17] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 16 rows 40 cols
[2023-03-17 05:09:17] [INFO ] Computed 24 place invariants in 6 ms
[2023-03-17 05:09:17] [INFO ] Invariant cache hit.
[2023-03-17 05:09:17] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 24 ms returned sat
[2023-03-17 05:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:17] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-17 05:09:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:17] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-17 05:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:17] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-17 05:09:17] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-17 05:09:17] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 14 ms.
[2023-03-17 05:09:17] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-17 05:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-17 05:09:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-17 05:09:18] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 05:09:18] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 9 ms.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-17 05:09:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-17 05:09:18] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-17 05:09:18] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 12 ms.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned unsat
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-17 05:09:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-17 05:09:18] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 05:09:18] [INFO ] Added : 15 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 11 ms.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-17 05:09:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 20 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-17 05:09:18] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 05:09:18] [INFO ] Added : 13 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 10 ms.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-17 05:09:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-17 05:09:18] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 05:09:18] [INFO ] Added : 13 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 12 ms.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-17 05:09:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-17 05:09:18] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 05:09:18] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:18] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-17 05:09:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-17 05:09:19] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 05:09:19] [INFO ] Added : 12 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 14 ms.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-17 05:09:19] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 05:09:19] [INFO ] Added : 10 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 10 ms.
[2023-03-17 05:09:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-17 05:09:19] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:09:19] [INFO ] Added : 10 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 13 ms.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-17 05:09:19] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 05:09:19] [INFO ] Added : 10 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 11 ms.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-17 05:09:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-17 05:09:19] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 05:09:19] [INFO ] Added : 8 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 05:09:19] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 05:09:19] [INFO ] Added : 10 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 11 ms.
[2023-03-17 05:09:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-17 05:09:19] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:09:19] [INFO ] Added : 10 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 12 ms.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 05:09:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-17 05:09:19] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-17 05:09:19] [INFO ] Added : 15 causal constraints over 3 iterations in 26 ms. Result :sat
Minimization took 10 ms.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 05:09:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-17 05:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:19] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-17 05:09:19] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-17 05:09:19] [INFO ] Added : 14 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 2, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1]
FORMULA PermAdmissibility-COL-01-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PermAdmissibility-COL-01-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-17 05:09:19] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 12 ms.
[2023-03-17 05:09:19] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :20
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :20
[2023-03-17 05:09:20] [INFO ] Invariant cache hit.
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-17 05:09:20] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 1, 2, 1, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1] Max seen :[2, 1, 2, 1, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1]
FORMULA PermAdmissibility-COL-01-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-01-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 4268 ms.
ITS solved all properties within timeout
BK_STOP 1679029762017
--------------------
content from stderr:
+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
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="PermAdmissibility-COL-01"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is PermAdmissibility-COL-01, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540100461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;