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.r043-smll-171620180000071.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 gold2023
Input is AutoFlight-PT-04b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-171620180000071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 12 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 22:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 22:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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 AutoFlight-PT-04b-UpperBounds-00
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-01
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-02
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-03
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-04
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-05
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-06
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-07
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-08
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-09
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-10
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-11
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-12
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-13
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-14
FORMULA_NAME AutoFlight-PT-04b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716275785892

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-04b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 07:16:28] [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-21 07:16:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:16:29] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2024-05-21 07:16:29] [INFO ] Transformed 390 places.
[2024-05-21 07:16:29] [INFO ] Transformed 388 transitions.
[2024-05-21 07:16:29] [INFO ] Found NUPN structural information;
[2024-05-21 07:16:29] [INFO ] Parsed PT model containing 390 places and 388 transitions and 906 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 388 rows 390 cols
[2024-05-21 07:16:29] [INFO ] Computed 28 invariants in 38 ms
Incomplete random walk after 10000 steps, including 50 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :12
FORMULA AutoFlight-PT-04b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
[2024-05-21 07:16:29] [INFO ] Invariant cache hit.
[2024-05-21 07:16:29] [INFO ] [Real]Absence check using 27 positive place invariants in 28 ms returned sat
[2024-05-21 07:16:29] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:16:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:16:30] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2024-05-21 07:16:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:16:30] [INFO ] [Nat]Absence check using 27 positive place invariants in 27 ms returned sat
[2024-05-21 07:16:30] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:16:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:16:30] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2024-05-21 07:16:31] [INFO ] Deduced a trap composed of 38 places in 359 ms of which 10 ms to minimize.
[2024-05-21 07:16:31] [INFO ] Deduced a trap composed of 57 places in 324 ms of which 3 ms to minimize.
[2024-05-21 07:16:31] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 1 ms to minimize.
[2024-05-21 07:16:32] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 3 ms to minimize.
[2024-05-21 07:16:32] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 1 ms to minimize.
[2024-05-21 07:16:32] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 1 ms to minimize.
[2024-05-21 07:16:32] [INFO ] Deduced a trap composed of 78 places in 115 ms of which 1 ms to minimize.
[2024-05-21 07:16:32] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 1 ms to minimize.
[2024-05-21 07:16:32] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 0 ms to minimize.
[2024-05-21 07:16:33] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 1 ms to minimize.
[2024-05-21 07:16:33] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 1 ms to minimize.
[2024-05-21 07:16:33] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 0 ms to minimize.
[2024-05-21 07:16:33] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 1 ms to minimize.
[2024-05-21 07:16:33] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2024-05-21 07:16:33] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2910 ms
[2024-05-21 07:16:33] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 31 ms.
[2024-05-21 07:16:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 07:16:35] [INFO ] [Real]Absence check using 27 positive place invariants in 21 ms returned sat
[2024-05-21 07:16:35] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:16:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:16:35] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2024-05-21 07:16:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:16:35] [INFO ] [Nat]Absence check using 27 positive place invariants in 17 ms returned sat
[2024-05-21 07:16:35] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:16:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:16:36] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2024-05-21 07:16:36] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2024-05-21 07:16:36] [INFO ] Deduced a trap composed of 58 places in 149 ms of which 1 ms to minimize.
[2024-05-21 07:16:36] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2024-05-21 07:16:36] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 1 ms to minimize.
[2024-05-21 07:16:36] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2024-05-21 07:16:37] [INFO ] Deduced a trap composed of 63 places in 148 ms of which 1 ms to minimize.
[2024-05-21 07:16:37] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 1 ms to minimize.
[2024-05-21 07:16:37] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 1 ms to minimize.
[2024-05-21 07:16:37] [INFO ] Deduced a trap composed of 48 places in 188 ms of which 1 ms to minimize.
[2024-05-21 07:16:37] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 0 ms to minimize.
[2024-05-21 07:16:38] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 1 ms to minimize.
[2024-05-21 07:16:38] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 1 ms to minimize.
[2024-05-21 07:16:38] [INFO ] Deduced a trap composed of 63 places in 211 ms of which 2 ms to minimize.
[2024-05-21 07:16:38] [INFO ] Deduced a trap composed of 64 places in 152 ms of which 1 ms to minimize.
[2024-05-21 07:16:38] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 1 ms to minimize.
[2024-05-21 07:16:39] [INFO ] Deduced a trap composed of 62 places in 174 ms of which 1 ms to minimize.
[2024-05-21 07:16:39] [INFO ] Deduced a trap composed of 24 places in 192 ms of which 1 ms to minimize.
[2024-05-21 07:16:39] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
[2024-05-21 07:16:39] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2024-05-21 07:16:39] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 1 ms to minimize.
[2024-05-21 07:16:39] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 1 ms to minimize.
[2024-05-21 07:16:40] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 1 ms to minimize.
[2024-05-21 07:16:40] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4048 ms
[2024-05-21 07:16:40] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 40 ms.
[2024-05-21 07:16:40] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 07:16:41] [INFO ] [Real]Absence check using 27 positive place invariants in 27 ms returned sat
[2024-05-21 07:16:41] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 07:16:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:16:41] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2024-05-21 07:16:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:16:41] [INFO ] [Nat]Absence check using 27 positive place invariants in 23 ms returned sat
[2024-05-21 07:16:41] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 07:16:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:16:41] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2024-05-21 07:16:41] [INFO ] Deduced a trap composed of 78 places in 232 ms of which 1 ms to minimize.
[2024-05-21 07:16:42] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 1 ms to minimize.
[2024-05-21 07:16:42] [INFO ] Deduced a trap composed of 64 places in 266 ms of which 1 ms to minimize.
[2024-05-21 07:16:42] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 1 ms to minimize.
[2024-05-21 07:16:42] [INFO ] Deduced a trap composed of 48 places in 200 ms of which 1 ms to minimize.
[2024-05-21 07:16:43] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 1 ms to minimize.
[2024-05-21 07:16:43] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 1 ms to minimize.
[2024-05-21 07:16:43] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 1 ms to minimize.
[2024-05-21 07:16:43] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 1 ms to minimize.
[2024-05-21 07:16:43] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 1 ms to minimize.
[2024-05-21 07:16:44] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 1 ms to minimize.
[2024-05-21 07:16:44] [INFO ] Deduced a trap composed of 72 places in 145 ms of which 1 ms to minimize.
[2024-05-21 07:16:44] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2024-05-21 07:16:44] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2024-05-21 07:16:44] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2860 ms
[2024-05-21 07:16:44] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 34 ms.
[2024-05-21 07:16:46] [INFO ] Deduced a trap composed of 12 places in 295 ms of which 2 ms to minimize.
[2024-05-21 07:16:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-21 07:16:46] [INFO ] [Real]Absence check using 27 positive place invariants in 26 ms returned sat
[2024-05-21 07:16:46] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 07:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 07:16:47] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-05-21 07:16:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 07:16:47] [INFO ] [Nat]Absence check using 27 positive place invariants in 18 ms returned sat
[2024-05-21 07:16:47] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 07:16:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 07:16:47] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2024-05-21 07:16:47] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 1 ms to minimize.
[2024-05-21 07:16:47] [INFO ] Deduced a trap composed of 46 places in 190 ms of which 1 ms to minimize.
[2024-05-21 07:16:47] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 1 ms to minimize.
[2024-05-21 07:16:48] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 1 ms to minimize.
[2024-05-21 07:16:48] [INFO ] Deduced a trap composed of 54 places in 194 ms of which 1 ms to minimize.
[2024-05-21 07:16:48] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 4 ms to minimize.
[2024-05-21 07:16:48] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 1 ms to minimize.
[2024-05-21 07:16:48] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 1 ms to minimize.
[2024-05-21 07:16:49] [INFO ] Deduced a trap composed of 59 places in 217 ms of which 1 ms to minimize.
[2024-05-21 07:16:49] [INFO ] Deduced a trap composed of 63 places in 195 ms of which 1 ms to minimize.
[2024-05-21 07:16:49] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 1 ms to minimize.
[2024-05-21 07:16:49] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 0 ms to minimize.
[2024-05-21 07:16:50] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 1 ms to minimize.
[2024-05-21 07:16:50] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 1 ms to minimize.
[2024-05-21 07:16:50] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 4 ms to minimize.
[2024-05-21 07:16:50] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3081 ms
[2024-05-21 07:16:50] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 33 ms.
[2024-05-21 07:16:52] [INFO ] Added : 250 causal constraints over 50 iterations in 1652 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 390 transition count 240
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 176 rules applied. Total rules applied 324 place count 242 transition count 212
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 334 place count 234 transition count 210
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 336 place count 232 transition count 210
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 336 place count 232 transition count 157
Deduced a syphon composed of 53 places in 2 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 442 place count 179 transition count 157
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 479 place count 142 transition count 120
Iterating global reduction 4 with 37 rules applied. Total rules applied 516 place count 142 transition count 120
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 516 place count 142 transition count 108
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 540 place count 130 transition count 108
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 602 place count 99 transition count 77
Free-agglomeration rule applied 16 times.
Iterating global reduction 4 with 16 rules applied. Total rules applied 618 place count 99 transition count 61
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 634 place count 83 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 635 place count 82 transition count 60
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 5 with 31 rules applied. Total rules applied 666 place count 67 transition count 44
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 682 place count 51 transition count 44
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 14 Pre rules applied. Total rules applied 682 place count 51 transition count 30
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 7 with 28 rules applied. Total rules applied 710 place count 37 transition count 30
Applied a total of 710 rules in 101 ms. Remains 37 /390 variables (removed 353) and now considering 30/388 (removed 358) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 37/390 places, 30/388 transitions.
// Phase 1: matrix 30 rows 37 cols
[2024-05-21 07:16:52] [INFO ] Computed 13 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1459 ms. (steps per millisecond=685 ) properties (out of 4) seen :4
FORMULA AutoFlight-PT-04b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 24910 ms.

BK_STOP 1716275814930

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-04b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is AutoFlight-PT-04b, 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 r043-smll-171620180000071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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