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-174853743000067.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-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r013-tall-174853743000067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K 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.7K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K 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 134K 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-06b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748540906240

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-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 17:48:27] [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:48:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 17:48:27] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2025-05-29 17:48:27] [INFO ] Transformed 574 places.
[2025-05-29 17:48:27] [INFO ] Transformed 572 transitions.
[2025-05-29 17:48:27] [INFO ] Found NUPN structural information;
[2025-05-29 17:48:27] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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 572 rows 574 cols
[2025-05-29 17:48:27] [INFO ] Computed 40 invariants in 31 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 (35 resets) in 45 ms. (217 steps per ms)
FORMULA AutoFlight-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (18 resets) in 55 ms. (1071 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2025-05-29 17:48:27] [INFO ] Invariant cache hit.
[2025-05-29 17:48:28] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2025-05-29 17:48:28] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 10 ms returned sat
[2025-05-29 17:48:28] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2025-05-29 17:48:28] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 24 ms to minimize.
[2025-05-29 17:48:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 18 ms returned sat
[2025-05-29 17:48:28] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:29] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2025-05-29 17:48:29] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2025-05-29 17:48:29] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2025-05-29 17:48:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2025-05-29 17:48:29] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 34 ms.
[2025-05-29 17:48:33] [INFO ] Added : 552 causal constraints over 111 iterations in 4443 ms. Result :sat
Minimization took 6 ms.
[2025-05-29 17:48:33] [INFO ] [Real]Absence check using 39 positive place invariants in 18 ms returned sat
[2025-05-29 17:48:33] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:34] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-05-29 17:48:34] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2025-05-29 17:48:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:34] [INFO ] [Nat]Absence check using 39 positive place invariants in 23 ms returned sat
[2025-05-29 17:48:34] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:34] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2025-05-29 17:48:34] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2025-05-29 17:48:34] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2025-05-29 17:48:34] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
[2025-05-29 17:48:34] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2025-05-29 17:48:34] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 1 ms to minimize.
[2025-05-29 17:48:35] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2025-05-29 17:48:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 609 ms
[2025-05-29 17:48:35] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 32 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-29 17:48:39] [INFO ] [Real]Absence check using 39 positive place invariants in 18 ms returned sat
[2025-05-29 17:48:39] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 4 ms returned sat
[2025-05-29 17:48:39] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2025-05-29 17:48:39] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2025-05-29 17:48:39] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2025-05-29 17:48:39] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:39] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-05-29 17:48:40] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2025-05-29 17:48:40] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 3 ms to minimize.
[2025-05-29 17:48:40] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2025-05-29 17:48:40] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 6 ms to minimize.
[2025-05-29 17:48:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 514 ms
[2025-05-29 17:48:40] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 29 ms.
[2025-05-29 17:48:44] [INFO ] Added : 532 causal constraints over 107 iterations in 4148 ms. Result :sat
Minimization took 97 ms.
[2025-05-29 17:48:44] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2025-05-29 17:48:44] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:44] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-29 17:48:45] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 3 ms to minimize.
[2025-05-29 17:48:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:45] [INFO ] [Nat]Absence check using 39 positive place invariants in 20 ms returned sat
[2025-05-29 17:48:45] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:45] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2025-05-29 17:48:45] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 3 ms to minimize.
[2025-05-29 17:48:45] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2025-05-29 17:48:45] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2025-05-29 17:48:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 393 ms
[2025-05-29 17:48:45] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 29 ms.
[2025-05-29 17:48:50] [INFO ] Added : 554 causal constraints over 112 iterations in 4294 ms. Result :sat
Minimization took 44 ms.
[2025-05-29 17:48:50] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2025-05-29 17:48:50] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 17:48:50] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2025-05-29 17:48:50] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2025-05-29 17:48:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2025-05-29 17:48:50] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:50] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-29 17:48:50] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 3 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 3 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 109 places in 113 ms of which 3 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 2 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 3 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 104 places in 97 ms of which 3 ms to minimize.
[2025-05-29 17:48:51] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 3 ms to minimize.
[2025-05-29 17:48:52] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2025-05-29 17:48:52] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1272 ms
[2025-05-29 17:48:52] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 29 ms.
[2025-05-29 17:48:55] [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 4
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.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
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)
[2025-05-29 17:48:55] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2025-05-29 17:48:55] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:55] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-05-29 17:48:56] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2025-05-29 17:48:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 17:48:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 17 ms returned sat
[2025-05-29 17:48:56] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 17:48:56] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2025-05-29 17:48:56] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2025-05-29 17:48:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-05-29 17:48:56] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 25 ms.
[2025-05-29 17:49:00] [INFO ] Added : 550 causal constraints over 111 iterations in 4260 ms. Result :sat
Minimization took 335 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 220 place count 574 transition count 352
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 261 rules applied. Total rules applied 481 place count 354 transition count 311
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 494 place count 342 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 495 place count 341 transition count 310
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 495 place count 341 transition count 234
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 647 place count 265 transition count 234
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 700 place count 212 transition count 181
Iterating global reduction 4 with 53 rules applied. Total rules applied 753 place count 212 transition count 181
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 753 place count 212 transition count 163
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 789 place count 194 transition count 163
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 883 place count 147 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 884 place count 147 transition count 115
Free-agglomeration rule applied 24 times.
Iterating global reduction 4 with 24 rules applied. Total rules applied 908 place count 147 transition count 91
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 4 with 24 rules applied. Total rules applied 932 place count 123 transition count 91
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 933 place count 122 transition count 90
Reduce places removed 21 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 5 with 40 rules applied. Total rules applied 973 place count 101 transition count 71
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 21 rules applied. Total rules applied 994 place count 82 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 996 place count 80 transition count 69
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 22 Pre rules applied. Total rules applied 996 place count 80 transition count 47
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 8 with 44 rules applied. Total rules applied 1040 place count 58 transition count 47
Applied a total of 1040 rules in 116 ms. Remains 58 /574 variables (removed 516) and now considering 47/572 (removed 525) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 58/574 places, 47/572 transitions.
// Phase 1: matrix 47 rows 58 cols
[2025-05-29 17:49:01] [INFO ] Computed 19 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1063 ms. (939 steps per ms)
FORMULA AutoFlight-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutoFlight-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 470 ms. (2123 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:49:02] [INFO ] Flatten gal took : 25 ms
[2025-05-29 17:49:02] [INFO ] Flatten gal took : 8 ms
[2025-05-29 17:49:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10400240991457926006.gal : 5 ms
[2025-05-29 17:49:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality269596729382000896.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/ReachabilityCardinality10400240991457926006.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality269596729382000896.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
Loading property file /tmp/ReachabilityCardinality269596729382000896.prop.
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 35551 ms.

BK_STOP 1748540943025

--------------------
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="AutoFlight-PT-06b"
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-06b, 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-174853743000067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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