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

About the Execution of ITS-Tools for SmartHome-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
244.323 8518.00 15380.00 178.30 TFTTFFFFFTFTTTTT 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.r254-tall-162106745700215.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 SmartHome-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745700215
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 95K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 25 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 25 19:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 64K May 5 16:52 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 SmartHome-PT-08-ReachabilityFireability-00
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-01
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-02
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-03
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-04
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-05
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-06
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-07
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-08
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-09
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-10
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-11
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-12
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-13
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-14
FORMULA_NAME SmartHome-PT-08-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621167109113

Running Version 0
[2021-05-16 12:11:50] [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-16 12:11:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 12:11:50] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2021-05-16 12:11:50] [INFO ] Transformed 252 places.
[2021-05-16 12:11:50] [INFO ] Transformed 291 transitions.
[2021-05-16 12:11:50] [INFO ] Found NUPN structural information;
[2021-05-16 12:11:50] [INFO ] Parsed PT model containing 252 places and 291 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 21 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :10
FORMULA SmartHome-PT-08-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SmartHome-PT-08-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 270 rows 232 cols
[2021-05-16 12:11:50] [INFO ] Computed 11 place invariants in 20 ms
[2021-05-16 12:11:51] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-16 12:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:11:51] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2021-05-16 12:11:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:11:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-16 12:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:11:51] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 72 places in 51 ms of which 1 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 0 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 53 places in 28 ms of which 1 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 53 places in 22 ms of which 0 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 51 places in 31 ms of which 1 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Deduced a trap composed of 53 places in 21 ms of which 1 ms to minimize.
[2021-05-16 12:11:51] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 598 ms
[2021-05-16 12:11:51] [INFO ] Computed and/alt/rep : 244/430/244 causal constraints (skipped 25 transitions) in 15 ms.
[2021-05-16 12:11:52] [INFO ] Added : 200 causal constraints over 40 iterations in 591 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-16 12:11:52] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-16 12:11:52] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-16 12:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:11:52] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-16 12:11:52] [INFO ] Computed and/alt/rep : 244/430/244 causal constraints (skipped 25 transitions) in 18 ms.
[2021-05-16 12:11:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:11:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 12:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:11:52] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-16 12:11:52] [INFO ] Computed and/alt/rep : 244/430/244 causal constraints (skipped 25 transitions) in 15 ms.
[2021-05-16 12:11:53] [INFO ] Deduced a trap composed of 46 places in 28 ms of which 1 ms to minimize.
[2021-05-16 12:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-16 12:11:53] [INFO ] Added : 195 causal constraints over 39 iterations in 611 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-16 12:11:53] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 12:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:11:53] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-16 12:11:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:11:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-16 12:11:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:11:53] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-16 12:11:53] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 0 ms to minimize.
[2021-05-16 12:11:53] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2021-05-16 12:11:53] [INFO ] Deduced a trap composed of 32 places in 25 ms of which 0 ms to minimize.
[2021-05-16 12:11:53] [INFO ] Deduced a trap composed of 29 places in 20 ms of which 1 ms to minimize.
[2021-05-16 12:11:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 159 ms
[2021-05-16 12:11:53] [INFO ] Computed and/alt/rep : 244/430/244 causal constraints (skipped 25 transitions) in 18 ms.
[2021-05-16 12:11:54] [INFO ] Added : 195 causal constraints over 39 iterations in 560 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-16 12:11:54] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2021-05-16 12:11:54] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-16 12:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:11:54] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2021-05-16 12:11:54] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2021-05-16 12:11:54] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2021-05-16 12:11:54] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 0 ms to minimize.
[2021-05-16 12:11:54] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 0 ms to minimize.
[2021-05-16 12:11:54] [INFO ] Deduced a trap composed of 74 places in 41 ms of which 1 ms to minimize.
[2021-05-16 12:11:54] [INFO ] Deduced a trap composed of 75 places in 35 ms of which 0 ms to minimize.
[2021-05-16 12:11:54] [INFO ] Deduced a trap composed of 70 places in 32 ms of which 0 ms to minimize.
[2021-05-16 12:11:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 371 ms
[2021-05-16 12:11:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:11:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-16 12:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:11:55] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-16 12:11:55] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2021-05-16 12:11:55] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2021-05-16 12:11:55] [INFO ] Deduced a trap composed of 68 places in 48 ms of which 1 ms to minimize.
[2021-05-16 12:11:55] [INFO ] Deduced a trap composed of 69 places in 47 ms of which 1 ms to minimize.
[2021-05-16 12:11:55] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 0 ms to minimize.
[2021-05-16 12:11:55] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 0 ms to minimize.
[2021-05-16 12:11:55] [INFO ] Deduced a trap composed of 54 places in 33 ms of which 1 ms to minimize.
[2021-05-16 12:11:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 387 ms
[2021-05-16 12:11:55] [INFO ] Computed and/alt/rep : 244/430/244 causal constraints (skipped 25 transitions) in 15 ms.
[2021-05-16 12:11:55] [INFO ] Added : 199 causal constraints over 40 iterations in 522 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
FORMULA SmartHome-PT-08-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SmartHome-PT-08-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 33300 steps, including 299 resets, run finished after 118 ms. (steps per millisecond=282 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA SmartHome-PT-08-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 17600 steps, including 159 resets, run finished after 65 ms. (steps per millisecond=270 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA SmartHome-PT-08-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 20500 steps, including 166 resets, run finished after 55 ms. (steps per millisecond=372 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 27900 steps, including 224 resets, run finished after 76 ms. (steps per millisecond=367 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 232/232 places, 270/270 transitions.
Graph (trivial) has 222 edges and 232 vertex of which 90 / 232 are part of one of the 6 SCC in 4 ms
Free SCC test removed 84 places
Drop transitions removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 148 transition count 107
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 64 rules applied. Total rules applied 118 place count 95 transition count 96
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 90 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 127 place count 88 transition count 94
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 127 place count 88 transition count 89
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 137 place count 83 transition count 89
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 165 place count 55 transition count 61
Iterating global reduction 4 with 28 rules applied. Total rules applied 193 place count 55 transition count 61
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 199 place count 55 transition count 55
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 199 place count 55 transition count 53
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 203 place count 53 transition count 53
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 233 place count 38 transition count 38
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 105 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 10 rules applied. Total rules applied 243 place count 37 transition count 29
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 249 place count 37 transition count 23
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 255 place count 31 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 256 place count 30 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 257 place count 29 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 257 place count 29 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 259 place count 28 transition count 21
Applied a total of 259 rules in 42 ms. Remains 28 /232 variables (removed 204) and now considering 21/270 (removed 249) transitions.
Finished structural reductions, in 1 iterations. Remains : 28/232 places, 21/270 transitions.
[2021-05-16 12:11:56] [INFO ] Flatten gal took : 21 ms
[2021-05-16 12:11:56] [INFO ] Flatten gal took : 4 ms
[2021-05-16 12:11:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14266987385500845017.gal : 3 ms
[2021-05-16 12:11:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13774473231554838657.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/ReachabilityCardinality14266987385500845017.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13774473231554838657.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/ReachabilityCardinality14266987385500845017.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13774473231554838657.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13774473231554838657.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :108 after 126
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,158,0.010777,4212,2,154,10,634,8,0,136,469,0
Total reachable state count : 158

Verifying 2 reachability properties.
Reachability property SmartHome-PT-08-ReachabilityFireability-00 is true.
FORMULA SmartHome-PT-08-ReachabilityFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SmartHome-PT-08-ReachabilityFireability-00,1,0.011148,4212,2,29,10,634,8,0,140,469,0
Reachability property SmartHome-PT-08-ReachabilityFireability-14 is true.
FORMULA SmartHome-PT-08-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SmartHome-PT-08-ReachabilityFireability-14,4,0.011275,4212,2,32,10,634,8,0,141,469,0
All properties solved without resorting to model-checking.

BK_STOP 1621167117631

--------------------
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="SmartHome-PT-08"
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 SmartHome-PT-08, 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 r254-tall-162106745700215"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-08.tgz
mv SmartHome-PT-08 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 ;