About the Execution of ITS-Tools for Philosophers-COL-000050
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.r293-tall-167873945000109.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 itstools
Input is Philosophers-COL-000050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r293-tall-167873945000109
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:07 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:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Feb 25 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12K 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 Philosophers-COL-000050-UpperBounds-00
FORMULA_NAME Philosophers-COL-000050-UpperBounds-01
FORMULA_NAME Philosophers-COL-000050-UpperBounds-02
FORMULA_NAME Philosophers-COL-000050-UpperBounds-03
FORMULA_NAME Philosophers-COL-000050-UpperBounds-04
FORMULA_NAME Philosophers-COL-000050-UpperBounds-05
FORMULA_NAME Philosophers-COL-000050-UpperBounds-06
FORMULA_NAME Philosophers-COL-000050-UpperBounds-07
FORMULA_NAME Philosophers-COL-000050-UpperBounds-08
FORMULA_NAME Philosophers-COL-000050-UpperBounds-09
FORMULA_NAME Philosophers-COL-000050-UpperBounds-10
FORMULA_NAME Philosophers-COL-000050-UpperBounds-11
FORMULA_NAME Philosophers-COL-000050-UpperBounds-12
FORMULA_NAME Philosophers-COL-000050-UpperBounds-13
FORMULA_NAME Philosophers-COL-000050-UpperBounds-14
FORMULA_NAME Philosophers-COL-000050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678788558560
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=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000050
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-14 10:09:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 10:09:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:09:20] [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-14 10:09:20] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 10:09:20] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 392 ms
[2023-03-14 10:09:20] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250 PT places and 250.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-14 10:09:21] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 1075 ms.
[2023-03-14 10:09:21] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 10:09:21] [INFO ] Computed 2 place invariants in 4 ms
FORMULA Philosophers-COL-000050-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000050-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-14 10:09:21] [INFO ] Invariant cache hit.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 10:09:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-14 10:09:21] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 10:09:21] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 9 ms.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 10:09:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 10:09:21] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 10:09:21] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 10:09:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 10:09:21] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 10:09:21] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 10:09:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 10:09:21] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 10:09:21] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 10:09:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:21] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 10:09:21] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 10:09:22] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-14 10:09:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 10:09:22] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 10:09:22] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 10:09:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 10:09:22] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-14 10:09:22] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-14 10:09:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-14 10:09:22] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 10:09:22] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-14 10:09:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-14 10:09:22] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 10:09:22] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [50, 50, 50, 25, 50, 50, 25, 25, 50]
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50) 50) 50)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 10:09:22] [INFO ] Unfolded HLPN to a Petri net with 250 places and 250 transitions 800 arcs in 27 ms.
[2023-03-14 10:09:22] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 9) seen :336
FORMULA Philosophers-COL-000050-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000050-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000050-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000050-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000050-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000050-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :60
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :54
// Phase 1: matrix 250 rows 250 cols
[2023-03-14 10:09:22] [INFO ] Computed 100 place invariants in 12 ms
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using 100 positive place invariants in 20 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-14 10:09:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using 100 positive place invariants in 22 ms returned sat
[2023-03-14 10:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:22] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-14 10:09:22] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-14 10:09:22] [INFO ] Added : 21 causal constraints over 5 iterations in 117 ms. Result :sat
Minimization took 33 ms.
[2023-03-14 10:09:23] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2023-03-14 10:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:23] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-14 10:09:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 14 ms returned sat
[2023-03-14 10:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:23] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-14 10:09:23] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-14 10:09:23] [INFO ] Added : 21 causal constraints over 5 iterations in 108 ms. Result :sat
Minimization took 29 ms.
[2023-03-14 10:09:23] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2023-03-14 10:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:23] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-14 10:09:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 10:09:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 21 ms returned sat
[2023-03-14 10:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 10:09:23] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-14 10:09:23] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-14 10:09:23] [INFO ] Added : 21 causal constraints over 5 iterations in 106 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [25, 25, 25] Max seen :[20, 20, 20]
Support contains 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 250/250 transitions.
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 250 transition count 150
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 150 rules applied. Total rules applied 250 place count 150 transition count 100
Applied a total of 250 rules in 37 ms. Remains 150 /250 variables (removed 100) and now considering 100/250 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 150/250 places, 100/250 transitions.
// Phase 1: matrix 100 rows 150 cols
[2023-03-14 10:09:24] [INFO ] Computed 100 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6578 ms. (steps per millisecond=152 ) properties (out of 3) seen :66
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1979 ms. (steps per millisecond=505 ) properties (out of 3) seen :75
FORMULA Philosophers-COL-000050-UpperBounds-14 25 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-13 25 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Philosophers-COL-000050-UpperBounds-05 25 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 12601 ms.
BK_STOP 1678788576080
--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="Philosophers-COL-000050"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is Philosophers-COL-000050, 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 r293-tall-167873945000109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000050.tgz
mv Philosophers-COL-000050 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 ;