fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r102-smll-162075331000031
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for FlexibleBarrier-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
418.987 63980.00 84816.00 421.40 TTTFTTTTTTTFTTFF 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.r102-smll-162075331000031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 itstools
Input is FlexibleBarrier-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-162075331000031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K 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 3.3K Mar 28 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 11:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 141K 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 FlexibleBarrier-PT-06b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-06b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621120343166

Running Version 0
[2021-05-15 23:12:25] [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-15 23:12:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 23:12:25] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2021-05-15 23:12:25] [INFO ] Transformed 542 places.
[2021-05-15 23:12:25] [INFO ] Transformed 621 transitions.
[2021-05-15 23:12:25] [INFO ] Found NUPN structural information;
[2021-05-15 23:12:25] [INFO ] Parsed PT model containing 542 places and 621 transitions in 215 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 194 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :5
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :2
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :1
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 621 rows 542 cols
[2021-05-15 23:12:26] [INFO ] Computed 8 place invariants in 29 ms
[2021-05-15 23:12:26] [INFO ] [Real]Absence check using 8 positive place invariants in 20 ms returned sat
[2021-05-15 23:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:27] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2021-05-15 23:12:27] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 96 ms.
[2021-05-15 23:12:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:12:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-15 23:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:28] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-15 23:12:28] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 117 ms.
[2021-05-15 23:12:32] [INFO ] Added : 420 causal constraints over 84 iterations in 4225 ms. Result :unknown
[2021-05-15 23:12:33] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned unsat
[2021-05-15 23:12:33] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-15 23:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:33] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2021-05-15 23:12:33] [INFO ] Deduced a trap composed of 42 places in 373 ms of which 5 ms to minimize.
[2021-05-15 23:12:34] [INFO ] Deduced a trap composed of 184 places in 305 ms of which 2 ms to minimize.
[2021-05-15 23:12:34] [INFO ] Deduced a trap composed of 164 places in 229 ms of which 1 ms to minimize.
[2021-05-15 23:12:34] [INFO ] Deduced a trap composed of 97 places in 218 ms of which 1 ms to minimize.
[2021-05-15 23:12:35] [INFO ] Deduced a trap composed of 192 places in 263 ms of which 2 ms to minimize.
[2021-05-15 23:12:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1598 ms
[2021-05-15 23:12:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:12:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2021-05-15 23:12:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:35] [INFO ] [Nat]Absence check using state equation in 272 ms returned sat
[2021-05-15 23:12:35] [INFO ] Deduced a trap composed of 42 places in 309 ms of which 1 ms to minimize.
[2021-05-15 23:12:36] [INFO ] Deduced a trap composed of 184 places in 287 ms of which 1 ms to minimize.
[2021-05-15 23:12:36] [INFO ] Deduced a trap composed of 65 places in 271 ms of which 1 ms to minimize.
[2021-05-15 23:12:36] [INFO ] Deduced a trap composed of 195 places in 208 ms of which 0 ms to minimize.
[2021-05-15 23:12:36] [INFO ] Deduced a trap composed of 180 places in 169 ms of which 1 ms to minimize.
[2021-05-15 23:12:37] [INFO ] Deduced a trap composed of 184 places in 160 ms of which 1 ms to minimize.
[2021-05-15 23:12:37] [INFO ] Deduced a trap composed of 196 places in 190 ms of which 1 ms to minimize.
[2021-05-15 23:12:37] [INFO ] Deduced a trap composed of 192 places in 157 ms of which 1 ms to minimize.
[2021-05-15 23:12:37] [INFO ] Deduced a trap composed of 163 places in 202 ms of which 0 ms to minimize.
[2021-05-15 23:12:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2240 ms
[2021-05-15 23:12:37] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 66 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2021-05-15 23:12:40] [INFO ] Deduced a trap composed of 64 places in 235 ms of which 0 ms to minimize.
[2021-05-15 23:12:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2021-05-15 23:12:40] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2021-05-15 23:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:40] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2021-05-15 23:12:40] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 1 ms to minimize.
[2021-05-15 23:12:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2021-05-15 23:12:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:12:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2021-05-15 23:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:41] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2021-05-15 23:12:41] [INFO ] Deduced a trap composed of 69 places in 151 ms of which 1 ms to minimize.
[2021-05-15 23:12:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 208 ms
[2021-05-15 23:12:41] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 45 ms.
[2021-05-15 23:12:46] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 0 ms to minimize.
[2021-05-15 23:12:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2021-05-15 23:12:46] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-15 23:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:46] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2021-05-15 23:12:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:12:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-15 23:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:46] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2021-05-15 23:12:47] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 39 ms.
[2021-05-15 23:12:51] [INFO ] Deduced a trap composed of 64 places in 229 ms of which 1 ms to minimize.
[2021-05-15 23:12:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
[2021-05-15 23:12:51] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-15 23:12:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:52] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2021-05-15 23:12:52] [INFO ] Deduced a trap composed of 18 places in 293 ms of which 0 ms to minimize.
[2021-05-15 23:12:52] [INFO ] Deduced a trap composed of 99 places in 359 ms of which 2 ms to minimize.
[2021-05-15 23:12:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 743 ms
[2021-05-15 23:12:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:12:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2021-05-15 23:12:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:53] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2021-05-15 23:12:53] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 2 ms to minimize.
[2021-05-15 23:12:54] [INFO ] Deduced a trap composed of 42 places in 282 ms of which 1 ms to minimize.
[2021-05-15 23:12:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 578 ms
[2021-05-15 23:12:54] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 44 ms.
[2021-05-15 23:12:58] [INFO ] Deduced a trap composed of 64 places in 329 ms of which 1 ms to minimize.
[2021-05-15 23:12:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2021-05-15 23:12:58] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-15 23:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:58] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2021-05-15 23:12:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:12:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2021-05-15 23:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:12:59] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2021-05-15 23:12:59] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 41 ms.
[2021-05-15 23:13:03] [INFO ] Added : 469 causal constraints over 94 iterations in 4443 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-15 23:13:03] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-15 23:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 23:13:04] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2021-05-15 23:13:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 23:13:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2021-05-15 23:13:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 23:13:04] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2021-05-15 23:13:04] [INFO ] Deduced a trap composed of 195 places in 143 ms of which 0 ms to minimize.
[2021-05-15 23:13:04] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 0 ms to minimize.
[2021-05-15 23:13:05] [INFO ] Deduced a trap composed of 188 places in 181 ms of which 1 ms to minimize.
[2021-05-15 23:13:05] [INFO ] Deduced a trap composed of 190 places in 144 ms of which 1 ms to minimize.
[2021-05-15 23:13:05] [INFO ] Deduced a trap composed of 192 places in 141 ms of which 1 ms to minimize.
[2021-05-15 23:13:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 898 ms
[2021-05-15 23:13:05] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 41 ms.
[2021-05-15 23:13:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 84700 steps, including 1002 resets, run finished after 227 ms. (steps per millisecond=373 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 59300 steps, including 951 resets, run finished after 127 ms. (steps per millisecond=466 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 38 out of 542 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 378 edges and 542 vertex of which 18 / 542 are part of one of the 3 SCC in 18 ms
Free SCC test removed 15 places
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 527 transition count 519
Reduce places removed 84 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 96 rules applied. Total rules applied 181 place count 443 transition count 507
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 192 place count 432 transition count 507
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 192 place count 432 transition count 441
Deduced a syphon composed of 66 places in 9 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 324 place count 366 transition count 441
Discarding 147 places :
Symmetric choice reduction at 3 with 147 rule applications. Total rules 471 place count 219 transition count 294
Iterating global reduction 3 with 147 rules applied. Total rules applied 618 place count 219 transition count 294
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 618 place count 219 transition count 293
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 620 place count 218 transition count 293
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 632 place count 206 transition count 281
Iterating global reduction 3 with 12 rules applied. Total rules applied 644 place count 206 transition count 281
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 654 place count 206 transition count 271
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 734 place count 166 transition count 231
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 742 place count 162 transition count 252
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 773 place count 162 transition count 221
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 804 place count 131 transition count 221
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 809 place count 131 transition count 216
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 810 place count 131 transition count 216
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 811 place count 131 transition count 215
Applied a total of 811 rules in 328 ms. Remains 131 /542 variables (removed 411) and now considering 215/621 (removed 406) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/542 places, 215/621 transitions.
[2021-05-15 23:13:10] [INFO ] Flatten gal took : 109 ms
[2021-05-15 23:13:10] [INFO ] Flatten gal took : 33 ms
[2021-05-15 23:13:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9222076623435272906.gal : 16 ms
[2021-05-15 23:13:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1919890267387825027.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/ReachabilityCardinality9222076623435272906.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1919890267387825027.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/ReachabilityCardinality9222076623435272906.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1919890267387825027.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality1919890267387825027.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :9 after 12
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :12 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 21
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :21 after 661
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :661 after 7345
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :7345 after 8054
Reachability property FlexibleBarrier-PT-06b-ReachabilityFireability-12 is true.
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property FlexibleBarrier-PT-06b-ReachabilityFireability-08 is true.
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :8054 after 10091
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :10091 after 89734
Reachability property FlexibleBarrier-PT-06b-ReachabilityFireability-05 is true.
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :89734 after 98654
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :98654 after 441519
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :441519 after 1.1218e+06
Reachability property FlexibleBarrier-PT-06b-ReachabilityFireability-13 is true.
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.1218e+06 after 2.57806e+06
Detected timeout of ITS tools.
[2021-05-15 23:13:25] [INFO ] Flatten gal took : 28 ms
[2021-05-15 23:13:25] [INFO ] Applying decomposition
[2021-05-15 23:13:25] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10477931985120659109.txt, -o, /tmp/graph10477931985120659109.bin, -w, /tmp/graph10477931985120659109.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10477931985120659109.bin, -l, -1, -v, -w, /tmp/graph10477931985120659109.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 23:13:25] [INFO ] Decomposing Gal with order
[2021-05-15 23:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 23:13:25] [INFO ] Removed a total of 153 redundant transitions.
[2021-05-15 23:13:25] [INFO ] Flatten gal took : 125 ms
[2021-05-15 23:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 22 ms.
[2021-05-15 23:13:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality930757724724775696.gal : 8 ms
[2021-05-15 23:13:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11118257426640897503.prop : 13 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/ReachabilityCardinality930757724724775696.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11118257426640897503.prop, --nowitness], 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/ReachabilityCardinality930757724724775696.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11118257426640897503.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11118257426640897503.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1 after 93191
Reachability property FlexibleBarrier-PT-06b-ReachabilityFireability-01 is true.
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :93191 after 1.7448e+07
Invariant property FlexibleBarrier-PT-06b-ReachabilityFireability-15 does not hold.
FORMULA FlexibleBarrier-PT-06b-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 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\_mod\_flat,5.21915e+07,0.235874,9920,993,560,10547,8030,521,13830,284,13477,0
Total reachable state count : 52191491

Verifying 2 reachability properties.
Reachability property FlexibleBarrier-PT-06b-ReachabilityFireability-01 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
FlexibleBarrier-PT-06b-ReachabilityFireability-01,540,0.245271,10184,40,75,10547,8030,564,13830,301,13477,0
Invariant property FlexibleBarrier-PT-06b-ReachabilityFireability-15 does not hold.

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-06b-ReachabilityFireability-15,1.14352e+06,0.265736,10184,233,171,10547,8030,614,13830,311,13477,0
All properties solved without resorting to model-checking.

BK_STOP 1621120407146

--------------------
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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r102-smll-162075331000031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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