Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r013-tall-174853743000075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is AutoFlight-PT-96b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.9M May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748541098246

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-96b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:51:39] [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]
[2025-05-29 17:51:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:51:39] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2025-05-29 17:51:39] [INFO ] Transformed 7894 places.
[2025-05-29 17:51:40] [INFO ] Transformed 7868 transitions.
[2025-05-29 17:51:40] [INFO ] Found NUPN structural information;
[2025-05-29 17:51:40] [INFO ] Parsed PT model containing 7894 places and 7868 transitions and 18200 arcs in 705 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 7868 rows 7894 cols
[2025-05-29 17:51:40] [INFO ] Computed 514 invariants in 151 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 114 ms. (86 steps per ms)
FORMULA AutoFlight-PT-96b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120011 steps (24 resets) in 156 ms. (764 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-29 17:51:41] [INFO ] Invariant cache hit.
[2025-05-29 17:51:43] [INFO ] [Real]Absence check using 513 positive place invariants in 846 ms returned sat
[2025-05-29 17:51:43] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 15 ms returned sat
[2025-05-29 17:51:46] [INFO ] [Real]Absence check using state equation in 2848 ms returned unknown
[2025-05-29 17:51:48] [INFO ] [Real]Absence check using 513 positive place invariants in 811 ms returned sat
[2025-05-29 17:51:48] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 12 ms returned sat
[2025-05-29 17:51:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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.DeadlockTester.verifyPossible(DeadlockTester.java:851)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
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)
[2025-05-29 17:51:53] [INFO ] [Real]Absence check using 513 positive place invariants in 774 ms returned sat
[2025-05-29 17:51:53] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 19 ms returned sat
[2025-05-29 17:51:56] [INFO ] [Real]Absence check using state equation in 3087 ms returned unknown
[2025-05-29 17:51:58] [INFO ] [Real]Absence check using 513 positive place invariants in 792 ms returned sat
[2025-05-29 17:51:58] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 24 ms returned sat
[2025-05-29 17:52:01] [INFO ] [Real]Absence check using state equation in 2928 ms returned unknown
[2025-05-29 17:52:03] [INFO ] [Real]Absence check using 513 positive place invariants in 761 ms returned sat
[2025-05-29 17:52:03] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 26 ms returned sat
[2025-05-29 17:52:06] [INFO ] [Real]Absence check using state equation in 2915 ms returned unknown
[2025-05-29 17:52:08] [INFO ] [Real]Absence check using 513 positive place invariants in 802 ms returned sat
[2025-05-29 17:52:08] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 20 ms returned sat
[2025-05-29 17:52:11] [INFO ] [Real]Absence check using state equation in 2968 ms returned unknown
[2025-05-29 17:52:13] [INFO ] [Real]Absence check using 513 positive place invariants in 778 ms returned sat
[2025-05-29 17:52:13] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 25 ms returned sat
[2025-05-29 17:52:16] [INFO ] [Real]Absence check using state equation in 2960 ms returned unknown
[2025-05-29 17:52:18] [INFO ] [Real]Absence check using 513 positive place invariants in 760 ms returned sat
[2025-05-29 17:52:18] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 22 ms returned sat
[2025-05-29 17:52:21] [INFO ] [Real]Absence check using state equation in 2953 ms returned unknown
[2025-05-29 17:52:23] [INFO ] [Real]Absence check using 513 positive place invariants in 760 ms returned sat
[2025-05-29 17:52:23] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 19 ms returned sat
[2025-05-29 17:52:26] [INFO ] [Real]Absence check using state equation in 2974 ms returned unknown
[2025-05-29 17:52:28] [INFO ] [Real]Absence check using 513 positive place invariants in 775 ms returned sat
[2025-05-29 17:52:28] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 18 ms returned sat
[2025-05-29 17:52:31] [INFO ] [Real]Absence check using state equation in 2963 ms returned unknown
[2025-05-29 17:52:33] [INFO ] [Real]Absence check using 513 positive place invariants in 782 ms returned sat
[2025-05-29 17:52:33] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 13 ms returned sat
[2025-05-29 17:52:36] [INFO ] [Real]Absence check using state equation in 2952 ms returned unknown
[2025-05-29 17:52:38] [INFO ] [Real]Absence check using 513 positive place invariants in 781 ms returned sat
[2025-05-29 17:52:38] [INFO ] [Real]Absence check using 513 positive and 1 generalized place invariants in 12 ms returned sat
[2025-05-29 17:52:41] [INFO ] [Real]Absence check using state equation in 2948 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 12 out of 7894 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7894/7894 places, 7868/7868 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3402 transitions
Trivial Post-agglo rules discarded 3402 transitions
Performed 3402 trivial Post agglomeration. Transition count delta: 3402
Iterating post reduction 0 with 3402 rules applied. Total rules applied 3402 place count 7894 transition count 4466
Reduce places removed 3402 places and 0 transitions.
Ensure Unique test removed 382 transitions
Reduce isomorphic transitions removed 382 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 1 with 3976 rules applied. Total rules applied 7378 place count 4492 transition count 3892
Reduce places removed 192 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 195 rules applied. Total rules applied 7573 place count 4300 transition count 3889
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 7576 place count 4297 transition count 3889
Performed 1007 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1007 Pre rules applied. Total rules applied 7576 place count 4297 transition count 2882
Deduced a syphon composed of 1007 places in 82 ms
Reduce places removed 1007 places and 0 transitions.
Iterating global reduction 4 with 2014 rules applied. Total rules applied 9590 place count 3290 transition count 2882
Discarding 675 places :
Symmetric choice reduction at 4 with 675 rule applications. Total rules 10265 place count 2615 transition count 2207
Iterating global reduction 4 with 675 rules applied. Total rules applied 10940 place count 2615 transition count 2207
Performed 214 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 214 Pre rules applied. Total rules applied 10940 place count 2615 transition count 1993
Deduced a syphon composed of 214 places in 19 ms
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 4 with 428 rules applied. Total rules applied 11368 place count 2401 transition count 1993
Performed 613 Post agglomeration using F-continuation condition.Transition count delta: 613
Deduced a syphon composed of 613 places in 2 ms
Reduce places removed 613 places and 0 transitions.
Iterating global reduction 4 with 1226 rules applied. Total rules applied 12594 place count 1788 transition count 1380
Renaming transitions due to excessive name length > 1024 char.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 12596 place count 1788 transition count 1378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 12598 place count 1787 transition count 1377
Free-agglomeration rule applied 288 times.
Iterating global reduction 4 with 288 rules applied. Total rules applied 12886 place count 1787 transition count 1089
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 4 with 288 rules applied. Total rules applied 13174 place count 1499 transition count 1089
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 13175 place count 1498 transition count 1088
Reduce places removed 296 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 5 with 729 rules applied. Total rules applied 13904 place count 1202 transition count 655
Reduce places removed 433 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 437 rules applied. Total rules applied 14341 place count 769 transition count 651
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 14345 place count 765 transition count 651
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 185 Pre rules applied. Total rules applied 14345 place count 765 transition count 466
Deduced a syphon composed of 185 places in 0 ms
Reduce places removed 185 places and 0 transitions.
Iterating global reduction 8 with 370 rules applied. Total rules applied 14715 place count 580 transition count 466
Applied a total of 14715 rules in 1951 ms. Remains 580 /7894 variables (removed 7314) and now considering 466/7868 (removed 7402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1966 ms. Remains : 580/7894 places, 466/7868 transitions.
// Phase 1: matrix 466 rows 580 cols
[2025-05-29 17:52:43] [INFO ] Computed 218 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 13927 ms. (71 steps per ms)
FORMULA AutoFlight-PT-96b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-96b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 3281 ms. (304 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 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 )
[2025-05-29 17:53:00] [INFO ] Flatten gal took : 94 ms
[2025-05-29 17:53:00] [INFO ] Flatten gal took : 36 ms
[2025-05-29 17:53:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8053253528566701900.gal : 21 ms
[2025-05-29 17:53:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2641212362287998473.prop : 3 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/ReachabilityCardinality8053253528566701900.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2641212362287998473.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 81441 ms.

BK_STOP 1748541180947

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="AutoFlight-PT-96b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is AutoFlight-PT-96b, 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 r013-tall-174853743000075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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