fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r140-tall-162089128200607
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for Peterson-PT-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
224.647 22901.00 13766.00 11408.40 TTTFTFTFTTFTFFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128200607.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 79K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 360K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 257K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.4K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 100K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621019027226

Running Version 0
[2021-05-14 19:04:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 19:04:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:04:05] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-14 19:04:05] [INFO ] Transformed 102 places.
[2021-05-14 19:04:05] [INFO ] Transformed 126 transitions.
[2021-05-14 19:04:05] [INFO ] Found NUPN structural information;
[2021-05-14 19:04:05] [INFO ] Parsed PT model containing 102 places and 126 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-2-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 14) seen :4
FORMULA Peterson-PT-2-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-2-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2021-05-14 19:04:06] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2021-05-14 19:04:06] [INFO ] Computed 11 place invariants in 12 ms
[2021-05-14 19:04:06] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-14 19:04:06] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 19:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:04:06] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-14 19:04:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2021-05-14 19:04:06] [INFO ] [Real]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:04:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:04:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-14 19:04:06] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:04:06] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-14 19:04:06] [INFO ] [Nat]Added 26 Read/Feed constraints in 2 ms returned sat
[2021-05-14 19:04:06] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 6 ms to minimize.
[2021-05-14 19:04:06] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:04:06] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2021-05-14 19:04:06] [INFO ] Deduced a trap composed of 29 places in 19 ms of which 1 ms to minimize.
[2021-05-14 19:04:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 200 ms
[2021-05-14 19:04:06] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 8 ms.
[2021-05-14 19:04:07] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:04:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-14 19:04:07] [INFO ] Added : 102 causal constraints over 21 iterations in 320 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 6 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2021-05-14 19:04:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:04:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned unsat
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-14 19:04:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:04:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:04:07] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Nat]Added 26 Read/Feed constraints in 3 ms returned sat
[2021-05-14 19:04:07] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2021-05-14 19:04:07] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2021-05-14 19:04:07] [INFO ] Deduced a trap composed of 29 places in 23 ms of which 1 ms to minimize.
[2021-05-14 19:04:07] [INFO ] Deduced a trap composed of 29 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:04:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 124 ms
[2021-05-14 19:04:07] [INFO ] Computed and/alt/rep : 111/188/111 causal constraints (skipped 6 transitions) in 10 ms.
[2021-05-14 19:04:07] [INFO ] Added : 106 causal constraints over 22 iterations in 180 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 10 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2021-05-14 19:04:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:04:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned unsat
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 19:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:04:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-14 19:04:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:04:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned unsat
[2021-05-14 19:04:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2021-05-14 19:04:08] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 19:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:04:08] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-14 19:04:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:04:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-14 19:04:08] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 0 ms returned sat
[2021-05-14 19:04:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:04:08] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-14 19:04:08] [INFO ] [Nat]Added 26 Read/Feed constraints in 4 ms returned sat
[2021-05-14 19:04:08] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:04:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2021-05-14 19:04:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2021-05-14 19:04:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
[2021-05-14 19:04:08] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned unsat
FORMULA Peterson-PT-2-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-2-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 18300 steps, including 463 resets, run finished after 67 ms. (steps per millisecond=273 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16500 steps, including 424 resets, run finished after 53 ms. (steps per millisecond=311 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 21 out of 102 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 70 place count 67 transition count 78
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 96 place count 54 transition count 78
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 51 transition count 75
Applied a total of 102 rules in 24 ms. Remains 51 /102 variables (removed 51) and now considering 75/126 (removed 51) transitions.
Finished structural reductions, in 1 iterations. Remains : 51/102 places, 75/126 transitions.
[2021-05-14 19:04:08] [INFO ] Flatten gal took : 30 ms
[2021-05-14 19:04:08] [INFO ] Flatten gal took : 11 ms
[2021-05-14 19:04:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16545435650469535703.gal : 6 ms
[2021-05-14 19:04:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1300661121611939930.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality16545435650469535703.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1300661121611939930.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality16545435650469535703.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1300661121611939930.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1300661121611939930.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 44
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :44 after 159
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :159 after 482
Reachability property Peterson-PT-2-ReachabilityFireability-06 is true.
FORMULA Peterson-PT-2-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property Peterson-PT-2-ReachabilityFireability-00 is true.
FORMULA Peterson-PT-2-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1176,0.068889,5444,2,942,14,6613,6,0,282,4775,0
Total reachable state count : 1176

Verifying 2 reachability properties.
Reachability property Peterson-PT-2-ReachabilityFireability-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-2-ReachabilityFireability-00,2,0.071238,5444,2,61,14,6613,7,0,324,4775,0
Reachability property Peterson-PT-2-ReachabilityFireability-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-2-ReachabilityFireability-06,8,0.07813,5708,2,125,14,6613,8,0,362,4775,0
All properties solved without resorting to model-checking.

BK_STOP 1621019050127

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Peterson-PT-2"
export BK_EXAMINATION="ReachabilityFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162089128200607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-2.tgz
mv Peterson-PT-2 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;