Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r107-smll-165260580200005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is FlexibleBarrier-PT-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-165260580200005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 29 13:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 29 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 29 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 29 13:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 29 13:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 69K May 10 09:33 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 FlexibleBarrier-PT-04b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068445416

Running Version 0
[2022-06-12 21:14:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2022-06-12 21:14:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:14:09] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2022-06-12 21:14:09] [INFO ] Transformed 268 places.
[2022-06-12 21:14:09] [INFO ] Transformed 305 transitions.
[2022-06-12 21:14:09] [INFO ] Found NUPN structural information;
[2022-06-12 21:14:09] [INFO ] Parsed PT model containing 268 places and 305 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 235 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 14) seen :9
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 305 rows 268 cols
[2022-06-12 21:14:09] [INFO ] Computed 6 place invariants in 26 ms
[2022-06-12 21:14:10] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2022-06-12 21:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:10] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2022-06-12 21:14:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:10] [INFO ] [Real]Absence check using 6 positive place invariants in 11 ms returned sat
[2022-06-12 21:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:10] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-06-12 21:14:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2022-06-12 21:14:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:11] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2022-06-12 21:14:11] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 5 ms to minimize.
[2022-06-12 21:14:11] [INFO ] Deduced a trap composed of 38 places in 147 ms of which 1 ms to minimize.
[2022-06-12 21:14:11] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2022-06-12 21:14:11] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2022-06-12 21:14:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 603 ms
[2022-06-12 21:14:11] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2022-06-12 21:14:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:12] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 2 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:14:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 380 ms
[2022-06-12 21:14:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2022-06-12 21:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:12] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2022-06-12 21:14:12] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 1 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 1 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 101 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 2 ms to minimize.
[2022-06-12 21:14:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 943 ms
[2022-06-12 21:14:13] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 43 ms.
[2022-06-12 21:14:16] [INFO ] Added : 275 causal constraints over 55 iterations in 2566 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 21:14:16] [INFO ] [Real]Absence check using 6 positive place invariants in 13 ms returned sat
[2022-06-12 21:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:16] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 1 ms to minimize.
[2022-06-12 21:14:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2022-06-12 21:14:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 14 ms returned sat
[2022-06-12 21:14:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:17] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 1 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 0 ms to minimize.
[2022-06-12 21:14:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 322 ms
[2022-06-12 21:14:17] [INFO ] Computed and/alt/rep : 287/559/287 causal constraints (skipped 17 transitions) in 34 ms.
[2022-06-12 21:14:19] [INFO ] Deduced a trap composed of 132 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:14:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2022-06-12 21:14:20] [INFO ] Added : 264 causal constraints over 54 iterations in 2559 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 21:14:20] [INFO ] [Real]Absence check using 6 positive place invariants in 17 ms returned sat
[2022-06-12 21:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:20] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2022-06-12 21:14:20] [INFO ] Solution in real domain found non-integer solution.
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 28700 steps, including 608 resets, run finished after 116 ms. (steps per millisecond=247 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 40300 steps, including 879 resets, run finished after 127 ms. (steps per millisecond=317 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 268 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 268/268 places, 305/305 transitions.
Graph (trivial) has 251 edges and 268 vertex of which 26 / 268 are part of one of the 4 SCC in 58 ms
Free SCC test removed 22 places
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 246 transition count 202
Reduce places removed 76 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 170 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 169 transition count 201
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 155 place count 169 transition count 189
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 179 place count 157 transition count 189
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 248 place count 88 transition count 120
Iterating global reduction 3 with 69 rules applied. Total rules applied 317 place count 88 transition count 120
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 317 place count 88 transition count 114
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 329 place count 82 transition count 114
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 333 place count 82 transition count 110
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 342 place count 73 transition count 101
Iterating global reduction 4 with 9 rules applied. Total rules applied 351 place count 73 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 360 place count 73 transition count 92
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 396 place count 55 transition count 74
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 400 place count 55 transition count 70
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 403 place count 52 transition count 67
Iterating global reduction 6 with 3 rules applied. Total rules applied 406 place count 52 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 408 place count 51 transition count 84
Free-agglomeration rule applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 430 place count 51 transition count 62
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 95 edges and 29 vertex of which 16 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
Discarding 13 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 32 rules applied. Total rules applied 462 place count 16 transition count 53
Drop transitions removed 32 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 497 place count 16 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 498 place count 15 transition count 17
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t263.t84.t85 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 10 edges and 12 vertex of which 4 / 12 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 4 rules applied. Total rules applied 502 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 6 rules applied. Total rules applied 508 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 510 place count 8 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 511 place count 7 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 2 Pre rules applied. Total rules applied 511 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 515 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 517 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 518 place count 4 transition count 4
Applied a total of 518 rules in 208 ms. Remains 4 /268 variables (removed 264) and now considering 4/305 (removed 301) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/268 places, 4/305 transitions.
[2022-06-12 21:14:21] [INFO ] Flatten gal took : 54 ms
[2022-06-12 21:14:21] [INFO ] Flatten gal took : 2 ms
[2022-06-12 21:14:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3004475557724720139.gal : 16 ms
[2022-06-12 21:14:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14445852660639375681.prop : 1 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/ReachabilityCardinality3004475557724720139.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14445852660639375681.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/ReachabilityCardinality3004475557724720139.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14445852660639375681.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality14445852660639375681.prop.
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,4,0.01742,3972,2,7,5,25,8,0,25,14,0
Total reachable state count : 4

Verifying 2 reachability properties.
Reachability property FlexibleBarrier-PT-04b-ReachabilityCardinality-09 is true.
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-09 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
FlexibleBarrier-PT-04b-ReachabilityCardinality-09,2,0.017717,3972,2,6,6,25,8,0,27,14,0
Reachability property FlexibleBarrier-PT-04b-ReachabilityCardinality-11 is true.
FORMULA FlexibleBarrier-PT-04b-ReachabilityCardinality-11 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
FlexibleBarrier-PT-04b-ReachabilityCardinality-11,1,0.018584,3972,2,5,7,25,8,0,28,14,0
All properties solved without resorting to model-checking.

BK_STOP 1655068462895

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="FlexibleBarrier-PT-04b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is FlexibleBarrier-PT-04b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r107-smll-165260580200005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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