fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r143-tall-165271830200074
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for JoinFreeModules-PT-0200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
710.691 127439.00 141691.00 2013.70 FFFTTTFTFTFTTFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.7K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 30 02:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 30 02:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 30 02:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 02:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 613K May 10 09:34 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 JoinFreeModules-PT-0200-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655068725060

Running Version 0
[2022-06-12 21:18:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:18:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:18:46] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2022-06-12 21:18:46] [INFO ] Transformed 1001 places.
[2022-06-12 21:18:46] [INFO ] Transformed 1601 transitions.
[2022-06-12 21:18:46] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 271 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2022-06-12 21:18:46] [INFO ] Initial state test concluded for 9 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10081 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=73 ) properties (out of 7) seen :1
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 6) seen :1
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1601 rows 1000 cols
[2022-06-12 21:18:47] [INFO ] Computed 200 place invariants in 26 ms
[2022-06-12 21:18:48] [INFO ] [Real]Absence check using 200 positive place invariants in 59 ms returned sat
[2022-06-12 21:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:48] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2022-06-12 21:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:48] [INFO ] [Nat]Absence check using 200 positive place invariants in 42 ms returned sat
[2022-06-12 21:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:50] [INFO ] [Nat]Absence check using state equation in 1607 ms returned sat
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 4 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:18:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-06-12 21:18:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1317 ms
[2022-06-12 21:18:52] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 135 ms.
[2022-06-12 21:18:53] [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
[2022-06-12 21:18:53] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2022-06-12 21:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:54] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2022-06-12 21:18:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:54] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2022-06-12 21:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:56] [INFO ] [Nat]Absence check using state equation in 1524 ms returned sat
[2022-06-12 21:18:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-06-12 21:18:56] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-06-12 21:18:56] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-06-12 21:18:56] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-06-12 21:18:56] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:18:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 492 ms
[2022-06-12 21:18:56] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 67 ms.
[2022-06-12 21:18:59] [INFO ] Added : 145 causal constraints over 29 iterations in 2872 ms. Result :unknown
[2022-06-12 21:18:59] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2022-06-12 21:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:59] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2022-06-12 21:19:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:00] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-06-12 21:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:02] [INFO ] [Nat]Absence check using state equation in 2592 ms returned sat
[2022-06-12 21:19:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-06-12 21:19:02] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-06-12 21:19:02] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-06-12 21:19:03] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2022-06-12 21:19:04] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1398 ms
[2022-06-12 21:19:04] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 68 ms.
[2022-06-12 21:19:05] [INFO ] Deduced a trap composed of 3 places in 388 ms of which 1 ms to minimize.
[2022-06-12 21:19:05] [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
[2022-06-12 21:19:05] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2022-06-12 21:19:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:05] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2022-06-12 21:19:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:06] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2022-06-12 21:19:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:07] [INFO ] [Nat]Absence check using state equation in 1286 ms returned sat
[2022-06-12 21:19:07] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:19:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2022-06-12 21:19:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-06-12 21:19:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:19:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-06-12 21:19:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-06-12 21:19:08] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1138 ms
[2022-06-12 21:19:08] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 67 ms.
[2022-06-12 21:19:11] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 1 ms to minimize.
[2022-06-12 21:19:11] [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
[2022-06-12 21:19:11] [INFO ] [Real]Absence check using 200 positive place invariants in 39 ms returned sat
[2022-06-12 21:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:12] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2022-06-12 21:19:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:12] [INFO ] [Nat]Absence check using 200 positive place invariants in 41 ms returned sat
[2022-06-12 21:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:14] [INFO ] [Nat]Absence check using state equation in 2228 ms returned sat
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:19:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-06-12 21:19:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1018 ms
[2022-06-12 21:19:15] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 93 ms.
[2022-06-12 21:19:17] [INFO ] Added : 90 causal constraints over 18 iterations in 1622 ms. Result :unknown
Fused 5 Parikh solutions to 3 different solutions.
Interrupted Parikh walk after 1610990 steps, including 81 resets, run timeout after 30001 ms. (steps per millisecond=53 ) properties (out of 5) seen :3
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Interrupted Parikh walk after 1632751 steps, including 81 resets, run timeout after 30001 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Support contains 23 out of 1000 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 100 are kept as prefixes of interest. Removing 900 places using SCC suffix rule.13 ms
Discarding 900 places :
Also discarding 1440 output transitions
Drop transitions removed 1440 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 160
Applied a total of 2 rules in 46 ms. Remains 100 /1000 variables (removed 900) and now considering 160/1601 (removed 1441) transitions.
// Phase 1: matrix 160 rows 100 cols
[2022-06-12 21:20:17] [INFO ] Computed 20 place invariants in 1 ms
[2022-06-12 21:20:17] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 100/1000 places, 160/1601 transitions.
[2022-06-12 21:20:17] [INFO ] Flatten gal took : 37 ms
[2022-06-12 21:20:17] [INFO ] Flatten gal took : 17 ms
[2022-06-12 21:20:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3580836883988293156.gal : 9 ms
[2022-06-12 21:20:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15228306063794446850.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/ReachabilityCardinality3580836883988293156.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15228306063794446850.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/ReachabilityCardinality3580836883988293156.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15228306063794446850.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15228306063794446850.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10755 after 19900
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
Detected timeout of ITS tools.
[2022-06-12 21:20:32] [INFO ] Flatten gal took : 15 ms
[2022-06-12 21:20:32] [INFO ] Applying decomposition
[2022-06-12 21:20:32] [INFO ] Flatten gal took : 9 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/graph13806256092860706616.txt, -o, /tmp/graph13806256092860706616.bin, -w, /tmp/graph13806256092860706616.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/graph13806256092860706616.bin, -l, -1, -v, -w, /tmp/graph13806256092860706616.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:20:32] [INFO ] Decomposing Gal with order
[2022-06-12 21:20:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:20:32] [INFO ] Flatten gal took : 30 ms
[2022-06-12 21:20:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-06-12 21:20:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15742287277564752785.gal : 4 ms
[2022-06-12 21:20:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3236922780510468288.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/ReachabilityCardinality15742287277564752785.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality3236922780510468288.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/ReachabilityCardinality15742287277564752785.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality3236922780510468288.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality3236922780510468288.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :851 after 3104
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :3104 after 10755
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :10755 after 19900
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :19900 after 4.87563e+06
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.87563e+06 after 1.45683e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5743191366914632566
[2022-06-12 21:20:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5743191366914632566
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/ltsmin5743191366914632566]
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/ltsmin5743191366914632566] 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/ltsmin5743191366914632566] 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)
Finished random walk after 6756 steps, including 0 resets, run visited all 2 properties in 21 ms. (steps per millisecond=321 )
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655068852499

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0200"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is JoinFreeModules-PT-0200, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-tall-165271830200074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0200.tgz
mv JoinFreeModules-PT-0200 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;