Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716800285.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-020B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 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 ShieldIIPt-PT-020B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-020B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679436497082

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:08:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-21 22:08:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:08:19] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-03-21 22:08:19] [INFO ] Transformed 1403 places.
[2023-03-21 22:08:19] [INFO ] Transformed 1303 transitions.
[2023-03-21 22:08:19] [INFO ] Found NUPN structural information;
[2023-03-21 22:08:19] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1303 rows 1403 cols
[2023-03-21 22:08:19] [INFO ] Computed 181 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :12
FORMULA ShieldIIPt-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
[2023-03-21 22:08:19] [INFO ] Invariant cache hit.
[2023-03-21 22:08:20] [INFO ] [Real]Absence check using 181 positive place invariants in 87 ms returned sat
[2023-03-21 22:08:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:20] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2023-03-21 22:08:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:21] [INFO ] [Nat]Absence check using 181 positive place invariants in 97 ms returned sat
[2023-03-21 22:08:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:21] [INFO ] [Nat]Absence check using state equation in 658 ms returned sat
[2023-03-21 22:08:22] [INFO ] Deduced a trap composed of 22 places in 426 ms of which 7 ms to minimize.
[2023-03-21 22:08:22] [INFO ] Deduced a trap composed of 24 places in 320 ms of which 1 ms to minimize.
[2023-03-21 22:08:23] [INFO ] Deduced a trap composed of 21 places in 420 ms of which 3 ms to minimize.
[2023-03-21 22:08:23] [INFO ] Deduced a trap composed of 30 places in 342 ms of which 2 ms to minimize.
[2023-03-21 22:08:24] [INFO ] Deduced a trap composed of 20 places in 305 ms of which 1 ms to minimize.
[2023-03-21 22:08:24] [INFO ] Deduced a trap composed of 26 places in 403 ms of which 1 ms to minimize.
[2023-03-21 22:08:24] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 1 ms to minimize.
[2023-03-21 22:08:25] [INFO ] Deduced a trap composed of 25 places in 406 ms of which 1 ms to minimize.
[2023-03-21 22:08:25] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 4 ms to minimize.
[2023-03-21 22:08:26] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 1 ms to minimize.
[2023-03-21 22:08:26] [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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:08:26] [INFO ] [Real]Absence check using 181 positive place invariants in 85 ms returned sat
[2023-03-21 22:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:27] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2023-03-21 22:08:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:27] [INFO ] [Nat]Absence check using 181 positive place invariants in 75 ms returned sat
[2023-03-21 22:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:28] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2023-03-21 22:08:28] [INFO ] Deduced a trap composed of 40 places in 476 ms of which 1 ms to minimize.
[2023-03-21 22:08:29] [INFO ] Deduced a trap composed of 20 places in 334 ms of which 1 ms to minimize.
[2023-03-21 22:08:29] [INFO ] Deduced a trap composed of 12 places in 357 ms of which 1 ms to minimize.
[2023-03-21 22:08:30] [INFO ] Deduced a trap composed of 24 places in 309 ms of which 0 ms to minimize.
[2023-03-21 22:08:30] [INFO ] Deduced a trap composed of 22 places in 334 ms of which 1 ms to minimize.
[2023-03-21 22:08:30] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 1 ms to minimize.
[2023-03-21 22:08:31] [INFO ] Deduced a trap composed of 19 places in 398 ms of which 0 ms to minimize.
[2023-03-21 22:08:31] [INFO ] Deduced a trap composed of 21 places in 315 ms of which 1 ms to minimize.
[2023-03-21 22:08:31] [INFO ] Deduced a trap composed of 21 places in 357 ms of which 1 ms to minimize.
[2023-03-21 22:08:32] [INFO ] Deduced a trap composed of 19 places in 410 ms of which 1 ms to minimize.
[2023-03-21 22:08:32] [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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:08:32] [INFO ] [Real]Absence check using 181 positive place invariants in 157 ms returned sat
[2023-03-21 22:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:33] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2023-03-21 22:08:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:33] [INFO ] [Nat]Absence check using 181 positive place invariants in 66 ms returned sat
[2023-03-21 22:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:34] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2023-03-21 22:08:34] [INFO ] Deduced a trap composed of 20 places in 413 ms of which 1 ms to minimize.
[2023-03-21 22:08:35] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 1 ms to minimize.
[2023-03-21 22:08:35] [INFO ] Deduced a trap composed of 24 places in 355 ms of which 1 ms to minimize.
[2023-03-21 22:08:36] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 1 ms to minimize.
[2023-03-21 22:08:36] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 1 ms to minimize.
[2023-03-21 22:08:36] [INFO ] Deduced a trap composed of 25 places in 403 ms of which 0 ms to minimize.
[2023-03-21 22:08:37] [INFO ] Deduced a trap composed of 19 places in 376 ms of which 0 ms to minimize.
[2023-03-21 22:08:37] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 1 ms to minimize.
[2023-03-21 22:08:37] [INFO ] Deduced a trap composed of 20 places in 273 ms of which 1 ms to minimize.
[2023-03-21 22:08:38] [INFO ] Deduced a trap composed of 21 places in 397 ms of which 1 ms to minimize.
[2023-03-21 22:08:38] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 26 ms to minimize.
[2023-03-21 22:08:38] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:08:39] [INFO ] [Real]Absence check using 181 positive place invariants in 113 ms returned sat
[2023-03-21 22:08:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:39] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2023-03-21 22:08:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:08:40] [INFO ] [Nat]Absence check using 181 positive place invariants in 96 ms returned sat
[2023-03-21 22:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:08:40] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2023-03-21 22:08:41] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 2 ms to minimize.
[2023-03-21 22:08:41] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 2 ms to minimize.
[2023-03-21 22:08:41] [INFO ] Deduced a trap composed of 34 places in 458 ms of which 14 ms to minimize.
[2023-03-21 22:08:42] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 1 ms to minimize.
[2023-03-21 22:08:42] [INFO ] Deduced a trap composed of 32 places in 339 ms of which 0 ms to minimize.
[2023-03-21 22:08:43] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 1 ms to minimize.
[2023-03-21 22:08:43] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 1 ms to minimize.
[2023-03-21 22:08:43] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 0 ms to minimize.
[2023-03-21 22:08:44] [INFO ] Deduced a trap composed of 26 places in 318 ms of which 1 ms to minimize.
[2023-03-21 22:08:44] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 1 ms to minimize.
[2023-03-21 22:08:44] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 1 ms to minimize.
[2023-03-21 22:08:44] [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 3
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 1403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Drop transitions removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 1403 transition count 964
Reduce places removed 339 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 341 rules applied. Total rules applied 680 place count 1064 transition count 962
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 683 place count 1063 transition count 960
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 685 place count 1061 transition count 960
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 81 Pre rules applied. Total rules applied 685 place count 1061 transition count 879
Deduced a syphon composed of 81 places in 3 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 4 with 162 rules applied. Total rules applied 847 place count 980 transition count 879
Discarding 140 places :
Symmetric choice reduction at 4 with 140 rule applications. Total rules 987 place count 840 transition count 739
Iterating global reduction 4 with 140 rules applied. Total rules applied 1127 place count 840 transition count 739
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 1127 place count 840 transition count 680
Deduced a syphon composed of 59 places in 4 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 1245 place count 781 transition count 680
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 0 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 1921 place count 443 transition count 342
Renaming transitions due to excessive name length > 1024 char.
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 2037 place count 385 transition count 380
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2038 place count 385 transition count 379
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 2058 place count 385 transition count 379
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2059 place count 384 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2061 place count 382 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2061 place count 382 transition count 377
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2063 place count 381 transition count 377
Applied a total of 2063 rules in 352 ms. Remains 381 /1403 variables (removed 1022) and now considering 377/1303 (removed 926) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 352 ms. Remains : 381/1403 places, 377/1303 transitions.
// Phase 1: matrix 377 rows 381 cols
[2023-03-21 22:08:45] [INFO ] Computed 179 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4393 ms. (steps per millisecond=227 ) properties (out of 4) seen :4
FORMULA ShieldIIPt-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 30570 ms.
ITS solved all properties within timeout

BK_STOP 1679436529939

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-020B, 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 r393-oct2-167903716800285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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