About the Execution of LoLa+red for RobotManipulation-PT-02000
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.r359-smll-167891808400085.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 lolaxred
Input is RobotManipulation-PT-02000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891808400085
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.7K Feb 26 05:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 05:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 05:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 05:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 05:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 05:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.4K 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 RobotManipulation-PT-02000-UpperBounds-00
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-01
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-02
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-03
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-04
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-05
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-06
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-07
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-08
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-09
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-10
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-11
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-12
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-13
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-14
FORMULA_NAME RobotManipulation-PT-02000-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678996303824
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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RobotManipulation-PT-02000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 19:51:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 19:51:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:51:47] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-16 19:51:47] [INFO ] Transformed 15 places.
[2023-03-16 19:51:47] [INFO ] Transformed 11 transitions.
[2023-03-16 19:51:47] [INFO ] Parsed PT model containing 15 places and 11 transitions and 34 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
// Phase 1: matrix 11 rows 15 cols
[2023-03-16 19:51:47] [INFO ] Computed 6 place invariants in 7 ms
FORMULA RobotManipulation-PT-02000-UpperBounds-15 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-UpperBounds-02 4001 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 12008 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=545 ) properties (out of 14) seen :8002
FORMULA RobotManipulation-PT-02000-UpperBounds-08 4001 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-07 4001 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :158
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :253
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :453
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :522
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :198
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :156
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :369
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :275
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :1431
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :511
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :1431
[2023-03-16 19:51:48] [INFO ] Invariant cache hit.
[2023-03-16 19:51:48] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:48] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-16 19:51:48] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 19:51:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:48] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-16 19:51:48] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 19:51:48] [INFO ] Added : 8 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 14 ms.
[2023-03-16 19:51:48] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:48] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-16 19:51:48] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 19:51:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-16 19:51:48] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 19:51:48] [INFO ] Added : 8 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 19:51:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:48] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 19:51:48] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-16 19:51:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 19:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 19:51:48] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 19:51:48] [INFO ] Added : 8 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 19:51:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 19:51:49] [INFO ] Added : 8 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 19:51:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 19:51:49] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Minimization took 12 ms.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 19:51:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 19:51:49] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 19:51:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 19:51:49] [INFO ] Added : 8 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 19:51:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-16 19:51:49] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 19:51:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-16 19:51:49] [INFO ] Added : 8 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 8 ms.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-16 19:51:49] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 19:51:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-16 19:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:49] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-16 19:51:50] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 19:51:50] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2023-03-16 19:51:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 19:51:50] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:50] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-16 19:51:50] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-16 19:51:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 19:51:50] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-16 19:51:50] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 19:51:50] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 13 ms.
[2023-03-16 19:51:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:50] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-16 19:51:50] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 19:51:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:51:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:51:50] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:51:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:51:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-16 19:51:50] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-16 19:51:50] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [4001, 4001, 4000, 4000, 8001, 4000, 4001, 4001, 4001, 4001, 8001, 4001] Max seen :[56, 56, 53, 477, 155, 53, 33, 157, 56, 477, 155, 477]
FORMULA RobotManipulation-PT-02000-UpperBounds-04 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-06 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-03 4000 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 9
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 5 place count 12 transition count 9
Applied a total of 5 rules in 24 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 12/15 places, 9/11 transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-16 19:52:06] [INFO ] Computed 5 place invariants in 1 ms
FORMULA RobotManipulation-PT-02000-UpperBounds-13 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-02000-UpperBounds-05 4000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000251 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=3774 ) properties (out of 7) seen :28000
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 314 ms. (steps per millisecond=3184 ) properties (out of 7) seen :4474
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=3436 ) properties (out of 7) seen :12236
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=3164 ) properties (out of 7) seen :4510
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=3690 ) properties (out of 7) seen :4412
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 293 ms. (steps per millisecond=3412 ) properties (out of 7) seen :12258
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=3484 ) properties (out of 7) seen :8005
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=3521 ) properties (out of 7) seen :8005
[2023-03-16 19:52:08] [INFO ] Invariant cache hit.
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned unsat
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:52:08] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-16 19:52:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:52:09] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned unsat
[2023-03-16 19:52:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:52:09] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : [4000, 4000, 4000, 4000, 4000, 4000, 4000] Max seen :[4000, 4000, 4000, 4000, 4000, 4000, 4000]
FORMULA RobotManipulation-PT-02000-UpperBounds-14 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-12 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-11 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-10 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-09 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-01 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA RobotManipulation-PT-02000-UpperBounds-00 4000 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21509 ms.
ITS solved all properties within timeout
BK_STOP 1678996329986
--------------------
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="RobotManipulation-PT-02000"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is RobotManipulation-PT-02000, 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 r359-smll-167891808400085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-02000.tgz
mv RobotManipulation-PT-02000 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 ;