fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r229-tall-167856412900223
Last Updated
May 14, 2023

About the Execution of ITS-Tools for JoinFreeModules-PT-2000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11681.535 81378.00 183277.00 461.00 TFTTFTTTFTFFTFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.2M Mar 5 18:22 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-2000-ReachabilityFireability-00
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-01
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-02
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-03
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-04
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-05
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-06
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-07
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-08
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-09
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-10
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-11
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-12
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-13
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-14
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679454903946

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202303021504
[2023-03-22 03:15:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 03:15:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 03:15:05] [INFO ] Load time of PNML (sax parser for PT used): 404 ms
[2023-03-22 03:15:05] [INFO ] Transformed 10001 places.
[2023-03-22 03:15:05] [INFO ] Transformed 16001 transitions.
[2023-03-22 03:15:05] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 569 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 10 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 03:15:07] [INFO ] Flatten gal took : 663 ms
Incomplete random walk after 11009 steps, including 2 resets, run finished after 1044 ms. (steps per millisecond=10 ) properties (out of 6) seen :0
[2023-03-22 03:15:07] [INFO ] Flatten gal took : 390 ms
[2023-03-22 03:15:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18104250252347496271.gal : 195 ms
[2023-03-22 03:15:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14002441919348765075.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18104250252347496271.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14002441919348765075.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1190 ms. (steps per millisecond=8 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1003 ms. (steps per millisecond=9 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 898 ms. (steps per millisecond=11 ) properties (out of 6) seen :0
Loading property file /tmp/ReachabilityCardinality14002441919348765075.prop.
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 899 ms. (steps per millisecond=11 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 955 ms. (steps per millisecond=10 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1004 ms. (steps per millisecond=9 ) properties (out of 6) seen :0
Probabilistic random walk after 123119 steps, saw 123064 distinct states, run finished after 18095 ms. (steps per millisecond=6 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-22 03:15:31] [INFO ] Computed 2000 place invariants in 117 ms
[2023-03-22 03:15:33] [INFO ] [Real]Absence check using 2000 positive place invariants in 681 ms returned sat
[2023-03-22 03:15:49] [INFO ] After 18219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-22 03:15:51] [INFO ] [Nat]Absence check using 2000 positive place invariants in 674 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-22 03:16:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 03:16:14] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 52 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 260 are kept as prefixes of interest. Removing 9740 places using SCC suffix rule.22 ms
Discarding 9740 places :
Also discarding 15584 output transitions
Drop transitions removed 15584 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 260 transition count 416
Applied a total of 2 rules in 98 ms. Remains 260 /10000 variables (removed 9740) and now considering 416/16001 (removed 15585) transitions.
// Phase 1: matrix 416 rows 260 cols
[2023-03-22 03:16:14] [INFO ] Computed 52 place invariants in 2 ms
[2023-03-22 03:16:14] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 271 ms. Remains : 260/10000 places, 416/16001 transitions.
Incomplete random walk after 11008 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=440 ) properties (out of 6) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :1
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 03:16:15] [INFO ] Invariant cache hit.
[2023-03-22 03:16:15] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-22 03:16:15] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 03:16:15] [INFO ] [Nat]Absence check using 52 positive place invariants in 6 ms returned sat
[2023-03-22 03:16:15] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 03:16:15] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-22 03:16:15] [INFO ] After 231ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 03:16:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 4 ms to minimize.
[2023-03-22 03:16:16] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 2 ms to minimize.
[2023-03-22 03:16:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-22 03:16:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 03:16:16] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-22 03:16:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 300 ms
[2023-03-22 03:16:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-22 03:16:16] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-22 03:16:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 3 ms to minimize.
[2023-03-22 03:16:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-22 03:16:17] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-22 03:16:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 306 ms
[2023-03-22 03:16:17] [INFO ] After 1322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 363 ms.
[2023-03-22 03:16:17] [INFO ] After 2145ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 3015 ms.
Support contains 22 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 416/416 transitions.
Graph (complete) has 624 edges and 260 vertex of which 110 are kept as prefixes of interest. Removing 150 places using SCC suffix rule.0 ms
Discarding 150 places :
Also discarding 240 output transitions
Drop transitions removed 240 transitions
Applied a total of 1 rules in 5 ms. Remains 110 /260 variables (removed 150) and now considering 176/416 (removed 240) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 110/260 places, 176/416 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1021553 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 1021553 steps, saw 975676 distinct states, run finished after 3002 ms. (steps per millisecond=340 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 110 cols
[2023-03-22 03:16:23] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-22 03:16:23] [INFO ] [Real]Absence check using 22 positive place invariants in 2 ms returned sat
[2023-03-22 03:16:23] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 03:16:23] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-22 03:16:23] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 03:16:23] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-22 03:16:23] [INFO ] After 100ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 03:16:23] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2023-03-22 03:16:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-22 03:16:24] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-22 03:16:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 86 ms
[2023-03-22 03:16:24] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-22 03:16:24] [INFO ] After 610ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 24050 steps, including 0 resets, run visited all 1 properties in 61 ms. (steps per millisecond=394 )
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 61 ms.
ITS runner failed with exception null
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1304)
at java.base/java.lang.Thread.join(Thread.java:1372)
at fr.lip6.move.gal.application.runner.AbstractRunner.join(AbstractRunner.java:27)
at fr.lip6.move.gal.application.runner.its.ITSRunner.join(ITSRunner.java:177)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:675)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.lambda$2(ReachabilitySolver.java:63)
at java.base/java.lang.Thread.run(Thread.java:833)
All properties solved without resorting to model-checking.
Total runtime 78835 ms.

BK_STOP 1679454985324

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-2000"
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-5348"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-2000, 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 r229-tall-167856412900223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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