Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r246-tall-171654350700005.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654350700005
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 12 07:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 07:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 07:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 07:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.0M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716564103279

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-24 15:21:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 15:21:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:21:44] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-24 15:21:44] [INFO ] Transformed 2952 places.
[2024-05-24 15:21:44] [INFO ] Transformed 4255 transitions.
[2024-05-24 15:21:44] [INFO ] Parsed PT model containing 2952 places and 4255 transitions and 17902 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-24 15:21:44] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
// Phase 1: matrix 3983 rows 2952 cols
[2024-05-24 15:21:45] [INFO ] Computed 421 invariants in 233 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[17, 51, 17, 17, 1, 17, 51, 51, 17, 51, 22, 17, 17, 17, 22, 1]
RANDOM walk for 10000 steps (468 resets) in 104 ms. (95 steps per ms)
BEST_FIRST walk for 160014 steps (1871 resets) in 454 ms. (351 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0] Max Struct:[17, 51, 17, 17, 1, 17, 51, 51, 17, 51, 22, 17, 17, 17, 22, 1]
[2024-05-24 15:21:45] [INFO ] Flow matrix only has 3983 transitions (discarded 272 similar events)
[2024-05-24 15:21:45] [INFO ] Invariant cache hit.
[2024-05-24 15:21:46] [INFO ] [Real]Absence check using 42 positive place invariants in 49 ms returned sat
[2024-05-24 15:21:46] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 96 ms returned unsat
[2024-05-24 15:21:46] [INFO ] [Real]Absence check using 42 positive place invariants in 47 ms returned sat
[2024-05-24 15:21:46] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 93 ms returned unsat
[2024-05-24 15:21:47] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned sat
[2024-05-24 15:21:47] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 92 ms returned unsat
[2024-05-24 15:21:47] [INFO ] [Real]Absence check using 42 positive place invariants in 38 ms returned sat
[2024-05-24 15:21:47] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 85 ms returned unsat
[2024-05-24 15:21:47] [INFO ] [Real]Absence check using 42 positive place invariants in 37 ms returned sat
[2024-05-24 15:21:47] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 105 ms returned sat
[2024-05-24 15:21:49] [INFO ] [Real]Absence check using state equation in 1539 ms returned sat
[2024-05-24 15:21:49] [INFO ] State equation strengthened by 1090 read => feed constraints.
[2024-05-24 15:21:50] [INFO ] [Real]Added 1090 Read/Feed constraints in 328 ms returned unsat
[2024-05-24 15:21:50] [INFO ] [Real]Absence check using 42 positive place invariants in 37 ms returned sat
[2024-05-24 15:21:50] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 88 ms returned unsat
[2024-05-24 15:21:50] [INFO ] [Real]Absence check using 42 positive place invariants in 35 ms returned sat
[2024-05-24 15:21:50] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 90 ms returned unsat
[2024-05-24 15:21:51] [INFO ] [Real]Absence check using 42 positive place invariants in 38 ms returned sat
[2024-05-24 15:21:51] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 94 ms returned unsat
[2024-05-24 15:21:51] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned sat
[2024-05-24 15:21:51] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 82 ms returned unsat
[2024-05-24 15:21:51] [INFO ] [Real]Absence check using 42 positive place invariants in 35 ms returned sat
[2024-05-24 15:21:52] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 80 ms returned unsat
[2024-05-24 15:21:52] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned sat
[2024-05-24 15:21:52] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 84 ms returned unsat
[2024-05-24 15:21:52] [INFO ] [Real]Absence check using 42 positive place invariants in 34 ms returned sat
[2024-05-24 15:21:52] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 89 ms returned unsat
[2024-05-24 15:21:53] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned sat
[2024-05-24 15:21:53] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 88 ms returned unsat
[2024-05-24 15:21:53] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned sat
[2024-05-24 15:21:53] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 118 ms returned sat
[2024-05-24 15:21:55] [INFO ] [Real]Absence check using state equation in 1569 ms returned sat
[2024-05-24 15:21:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 15:21:56] [INFO ] [Real]Added 1090 Read/Feed constraints in 873 ms returned sat
[2024-05-24 15:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:21:56] [INFO ] [Nat]Absence check using 42 positive place invariants in 40 ms returned sat
[2024-05-24 15:21:56] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 105 ms returned sat
[2024-05-24 15:21:58] [INFO ] [Nat]Absence check using state equation in 1555 ms returned sat
[2024-05-24 15:21:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-24 15:21:59] [INFO ] [Nat]Added 1090 Read/Feed constraints in 702 ms returned sat
[2024-05-24 15:22:01] [INFO ] Deduced a trap composed of 518 places in 2227 ms of which 147 ms to minimize.
[2024-05-24 15:22:01] [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 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-24 15:22:01] [INFO ] [Real]Absence check using 42 positive place invariants in 53 ms returned sat
[2024-05-24 15:22:01] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 94 ms returned unsat
[2024-05-24 15:22:02] [INFO ] [Real]Absence check using 42 positive place invariants in 36 ms returned sat
[2024-05-24 15:22:02] [INFO ] [Real]Absence check using 42 positive and 379 generalized place invariants in 106 ms returned sat
[2024-05-24 15:22:03] [INFO ] [Real]Absence check using state equation in 1534 ms returned sat
[2024-05-24 15:22:04] [INFO ] [Real]Added 1090 Read/Feed constraints in 206 ms returned sat
[2024-05-24 15:22:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 15:22:04] [INFO ] [Nat]Absence check using 42 positive place invariants in 36 ms returned sat
[2024-05-24 15:22:04] [INFO ] [Nat]Absence check using 42 positive and 379 generalized place invariants in 102 ms returned sat
[2024-05-24 15:22:06] [INFO ] [Nat]Absence check using state equation in 1443 ms returned sat
[2024-05-24 15:22:06] [INFO ] [Nat]Added 1090 Read/Feed constraints in 453 ms returned sat
[2024-05-24 15:22:08] [INFO ] Deduced a trap composed of 243 places in 2135 ms of which 19 ms to minimize.
[2024-05-24 15:22:09] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 2703 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0] Max Struct:[1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 17, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[17, 1]
Support contains 2 out of 2952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2952/2952 places, 4255/4255 transitions.
Graph (complete) has 10317 edges and 2952 vertex of which 2928 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.12 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 543 transitions
Trivial Post-agglo rules discarded 543 transitions
Performed 543 trivial Post agglomeration. Transition count delta: 543
Iterating post reduction 0 with 543 rules applied. Total rules applied 544 place count 2928 transition count 3712
Reduce places removed 543 places and 0 transitions.
Iterating post reduction 1 with 543 rules applied. Total rules applied 1087 place count 2385 transition count 3712
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 68 Pre rules applied. Total rules applied 1087 place count 2385 transition count 3644
Deduced a syphon composed of 68 places in 5 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 1223 place count 2317 transition count 3644
Discarding 475 places :
Symmetric choice reduction at 2 with 475 rule applications. Total rules 1698 place count 1842 transition count 3169
Iterating global reduction 2 with 475 rules applied. Total rules applied 2173 place count 1842 transition count 3169
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2173 place count 1842 transition count 3166
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2179 place count 1839 transition count 3166
Discarding 237 places :
Symmetric choice reduction at 2 with 237 rule applications. Total rules 2416 place count 1602 transition count 2692
Iterating global reduction 2 with 237 rules applied. Total rules applied 2653 place count 1602 transition count 2692
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 2687 place count 1585 transition count 2675
Free-agglomeration rule (complex) applied 160 times.
Iterating global reduction 2 with 160 rules applied. Total rules applied 2847 place count 1585 transition count 2752
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 2 with 160 rules applied. Total rules applied 3007 place count 1425 transition count 2752
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 3 with 17 rules applied. Total rules applied 3024 place count 1425 transition count 2752
Applied a total of 3024 rules in 1191 ms. Remains 1425 /2952 variables (removed 1527) and now considering 2752/4255 (removed 1503) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1204 ms. Remains : 1425/2952 places, 2752/4255 transitions.
[2024-05-24 15:22:10] [INFO ] Flow matrix only has 2355 transitions (discarded 397 similar events)
// Phase 1: matrix 2355 rows 1425 cols
[2024-05-24 15:22:10] [INFO ] Computed 397 invariants in 57 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (76162 resets) in 7688 ms. (130 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (12965 resets) in 1981 ms. (504 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 16 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-24 15:22:20] [INFO ] Flatten gal took : 247 ms
[2024-05-24 15:22:20] [INFO ] Flatten gal took : 140 ms
[2024-05-24 15:22:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5848109554701675115.gal : 52 ms
[2024-05-24 15:22:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8663963944730105300.prop : 0 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5848109554701675115.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8663963944730105300.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 36500 ms.

BK_STOP 1716564140953

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -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="MultiCrashLeafsetExtension-PT-S16C02"
export BK_EXAMINATION="UpperBounds"
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-5568"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C02, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654350700005"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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