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.r216-tall-162098204800255.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 ShieldIIPs-PT-010B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098204800255
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 154K 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 94K 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.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 11:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 17:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 17:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 164K 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 ShieldIIPs-PT-010B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621066583005

Running Version 0
[2021-05-15 08:16:36] [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 08:16:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 08:16:36] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2021-05-15 08:16:36] [INFO ] Transformed 603 places.
[2021-05-15 08:16:36] [INFO ] Transformed 593 transitions.
[2021-05-15 08:16:36] [INFO ] Found NUPN structural information;
[2021-05-15 08:16:36] [INFO ] Parsed PT model containing 603 places and 593 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 16) seen :13
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 593 rows 603 cols
[2021-05-15 08:16:36] [INFO ] Computed 91 place invariants in 24 ms
[2021-05-15 08:16:37] [INFO ] [Real]Absence check using 91 positive place invariants in 31 ms returned sat
[2021-05-15 08:16:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 08:16:37] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2021-05-15 08:16:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 08:16:37] [INFO ] [Nat]Absence check using 91 positive place invariants in 71 ms returned sat
[2021-05-15 08:16:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 08:16:37] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2021-05-15 08:16:38] [INFO ] Deduced a trap composed of 17 places in 175 ms of which 4 ms to minimize.
[2021-05-15 08:16:38] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 1 ms to minimize.
[2021-05-15 08:16:38] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2021-05-15 08:16:38] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 4 ms to minimize.
[2021-05-15 08:16:38] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 2 ms to minimize.
[2021-05-15 08:16:39] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 0 ms to minimize.
[2021-05-15 08:16:39] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 0 ms to minimize.
[2021-05-15 08:16:39] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2021-05-15 08:16:39] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 1 ms to minimize.
[2021-05-15 08:16:39] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 0 ms to minimize.
[2021-05-15 08:16:39] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 1 ms to minimize.
[2021-05-15 08:16:39] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2021-05-15 08:16:39] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 1 ms to minimize.
[2021-05-15 08:16:40] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2021-05-15 08:16:40] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2021-05-15 08:16:40] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2021-05-15 08:16:40] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 0 ms to minimize.
[2021-05-15 08:16:40] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2021-05-15 08:16:40] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2021-05-15 08:16:40] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2021-05-15 08:16:40] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 0 ms to minimize.
[2021-05-15 08:16:41] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2021-05-15 08:16:41] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 0 ms to minimize.
[2021-05-15 08:16:41] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 0 ms to minimize.
[2021-05-15 08:16:41] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2021-05-15 08:16:41] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2021-05-15 08:16:41] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3484 ms
[2021-05-15 08:16:41] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints (skipped 0 transitions) in 45 ms.
[2021-05-15 08:16:42] [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 0
[2021-05-15 08:16:42] [INFO ] [Real]Absence check using 91 positive place invariants in 29 ms returned sat
[2021-05-15 08:16:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 08:16:42] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2021-05-15 08:16:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 08:16:42] [INFO ] [Nat]Absence check using 91 positive place invariants in 26 ms returned sat
[2021-05-15 08:16:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 08:16:43] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2021-05-15 08:16:43] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 0 ms to minimize.
[2021-05-15 08:16:43] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 1 ms to minimize.
[2021-05-15 08:16:43] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 0 ms to minimize.
[2021-05-15 08:16:43] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 1 ms to minimize.
[2021-05-15 08:16:43] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 0 ms to minimize.
[2021-05-15 08:16:43] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 0 ms to minimize.
[2021-05-15 08:16:44] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 0 ms to minimize.
[2021-05-15 08:16:44] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2021-05-15 08:16:44] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 4 ms to minimize.
[2021-05-15 08:16:44] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 1 ms to minimize.
[2021-05-15 08:16:44] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 12 ms to minimize.
[2021-05-15 08:16:44] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 0 ms to minimize.
[2021-05-15 08:16:44] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 0 ms to minimize.
[2021-05-15 08:16:44] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2021-05-15 08:16:45] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2021-05-15 08:16:45] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 0 ms to minimize.
[2021-05-15 08:16:45] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2021-05-15 08:16:45] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 0 ms to minimize.
[2021-05-15 08:16:45] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 0 ms to minimize.
[2021-05-15 08:16:45] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 0 ms to minimize.
[2021-05-15 08:16:45] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 1 ms to minimize.
[2021-05-15 08:16:45] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 1 ms to minimize.
[2021-05-15 08:16:45] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 0 ms to minimize.
[2021-05-15 08:16:46] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2021-05-15 08:16:46] [INFO ] Deduced a trap composed of 19 places in 93 ms of which 1 ms to minimize.
[2021-05-15 08:16:46] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 1 ms to minimize.
[2021-05-15 08:16:46] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2021-05-15 08:16:46] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2021-05-15 08:16:46] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 0 ms to minimize.
[2021-05-15 08:16:46] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 7 ms to minimize.
[2021-05-15 08:16:46] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3528 ms
[2021-05-15 08:16:46] [INFO ] Computed and/alt/rep : 592/1243/592 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-15 08:16:47] [INFO ] Added : 165 causal constraints over 33 iterations in 1166 ms. Result :unknown
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 149800 steps, including 631 resets, run finished after 541 ms. (steps per millisecond=276 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 603 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 603/603 places, 593/593 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 603 transition count 544
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 100 place count 554 transition count 542
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 552 transition count 542
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 102 place count 552 transition count 491
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 204 place count 501 transition count 491
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 272 place count 433 transition count 423
Iterating global reduction 3 with 68 rules applied. Total rules applied 340 place count 433 transition count 423
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 340 place count 433 transition count 395
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 396 place count 405 transition count 395
Performed 147 Post agglomeration using F-continuation condition.Transition count delta: 147
Deduced a syphon composed of 147 places in 1 ms
Reduce places removed 147 places and 0 transitions.
Iterating global reduction 3 with 294 rules applied. Total rules applied 690 place count 258 transition count 248
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 3 with 66 rules applied. Total rules applied 756 place count 258 transition count 248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 757 place count 257 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 758 place count 256 transition count 247
Applied a total of 758 rules in 160 ms. Remains 256 /603 variables (removed 347) and now considering 247/593 (removed 346) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/603 places, 247/593 transitions.
[2021-05-15 08:16:48] [INFO ] Flatten gal took : 73 ms
[2021-05-15 08:16:48] [INFO ] Flatten gal took : 25 ms
[2021-05-15 08:16:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3070505675046604300.gal : 14 ms
[2021-05-15 08:16:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15551294184492966933.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/ReachabilityCardinality3070505675046604300.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15551294184492966933.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/ReachabilityCardinality3070505675046604300.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15551294184492966933.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15551294184492966933.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 128
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :128 after 148
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :148 after 308
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :308 after 2118
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2118 after 3142
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :3142 after 13305
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :13305 after 207557
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :207557 after 7.35854e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :7.35854e+06 after 2.49022e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.49022e+08 after 2.69835e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.69835e+10 after 4.50901e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.50901e+10 after 9.02455e+11
Detected timeout of ITS tools.
[2021-05-15 08:17:03] [INFO ] Flatten gal took : 32 ms
[2021-05-15 08:17:03] [INFO ] Applying decomposition
[2021-05-15 08:17:04] [INFO ] Flatten gal took : 21 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/graph9405690050340114187.txt, -o, /tmp/graph9405690050340114187.bin, -w, /tmp/graph9405690050340114187.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/graph9405690050340114187.bin, -l, -1, -v, -w, /tmp/graph9405690050340114187.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-15 08:17:04] [INFO ] Decomposing Gal with order
[2021-05-15 08:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-15 08:17:04] [INFO ] Removed a total of 194 redundant transitions.
[2021-05-15 08:17:04] [INFO ] Flatten gal took : 76 ms
[2021-05-15 08:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 275 labels/synchronizations in 18 ms.
[2021-05-15 08:17:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality556043523660504447.gal : 8 ms
[2021-05-15 08:17:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3108516501493834324.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/ReachabilityCardinality556043523660504447.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3108516501493834324.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/ReachabilityCardinality556043523660504447.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3108516501493834324.prop --nowitness
Loading property file /tmp/ReachabilityCardinality3108516501493834324.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 9
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :738 after 8028
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8028 after 4.63819e+10
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4.63819e+10 after 5.79416e+11
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15145031705903081630
[2021-05-15 08:17:19] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15145031705903081630
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15145031705903081630]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15145031705903081630] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15145031705903081630] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 4 resets, run finished after 3709 ms. (steps per millisecond=269 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1923 ms. (steps per millisecond=520 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 10016299 steps, run timeout after 30001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 10016299 steps, saw 1778540 distinct states, run finished after 30004 ms. (steps per millisecond=333 ) properties seen :{}
Running SMT prover for 1 properties.
// Phase 1: matrix 247 rows 256 cols
[2021-05-15 08:17:56] [INFO ] Computed 90 place invariants in 9 ms
[2021-05-15 08:17:56] [INFO ] [Real]Absence check using 89 positive place invariants in 13 ms returned sat
[2021-05-15 08:17:56] [INFO ] [Real]Absence check using 89 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-15 08:17:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 08:17:56] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2021-05-15 08:17:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 08:17:56] [INFO ] [Nat]Absence check using 89 positive place invariants in 12 ms returned sat
[2021-05-15 08:17:56] [INFO ] [Nat]Absence check using 89 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-15 08:17:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 08:17:56] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-15 08:17:56] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 20 ms to minimize.
[2021-05-15 08:17:56] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2021-05-15 08:17:56] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2021-05-15 08:17:56] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2021-05-15 08:17:56] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2021-05-15 08:17:56] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 3 ms to minimize.
[2021-05-15 08:17:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2021-05-15 08:17:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 418 ms
[2021-05-15 08:17:56] [INFO ] Computed and/alt/rep : 244/853/244 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-15 08:17:58] [INFO ] Added : 216 causal constraints over 45 iterations in 1449 ms. Result :unsat
FORMULA ShieldIIPs-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 1 Parikh solutions to 0 different solutions.
All properties solved without resorting to model-checking.

BK_STOP 1621066679158

--------------------
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="ShieldIIPs-PT-010B"
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 ShieldIIPs-PT-010B, 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 r216-tall-162098204800255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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