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-167903717300637.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 ShieldPPPt-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-167903717300637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 21:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 21:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 21:08 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 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 21:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 21:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 376K 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 ShieldPPPt-PT-020B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-020B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679464496015

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=ShieldPPPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 05:54:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 05:54:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:54:58] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2023-03-22 05:54:58] [INFO ] Transformed 1563 places.
[2023-03-22 05:54:58] [INFO ] Transformed 1423 transitions.
[2023-03-22 05:54:58] [INFO ] Found NUPN structural information;
[2023-03-22 05:54:58] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 279 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1423 rows 1563 cols
[2023-03-22 05:54:59] [INFO ] Computed 221 place invariants in 21 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 16) seen :10
FORMULA ShieldPPPt-PT-020B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
[2023-03-22 05:54:59] [INFO ] Invariant cache hit.
[2023-03-22 05:55:00] [INFO ] [Real]Absence check using 221 positive place invariants in 117 ms returned sat
[2023-03-22 05:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:00] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2023-03-22 05:55:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:55:01] [INFO ] [Nat]Absence check using 221 positive place invariants in 69 ms returned sat
[2023-03-22 05:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:02] [INFO ] [Nat]Absence check using state equation in 785 ms returned sat
[2023-03-22 05:55:02] [INFO ] Deduced a trap composed of 26 places in 550 ms of which 17 ms to minimize.
[2023-03-22 05:55:03] [INFO ] Deduced a trap composed of 18 places in 389 ms of which 2 ms to minimize.
[2023-03-22 05:55:03] [INFO ] Deduced a trap composed of 23 places in 443 ms of which 2 ms to minimize.
[2023-03-22 05:55:04] [INFO ] Deduced a trap composed of 23 places in 390 ms of which 2 ms to minimize.
[2023-03-22 05:55:04] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 1 ms to minimize.
[2023-03-22 05:55:05] [INFO ] Deduced a trap composed of 18 places in 660 ms of which 2 ms to minimize.
[2023-03-22 05:55:05] [INFO ] Deduced a trap composed of 20 places in 444 ms of which 1 ms to minimize.
[2023-03-22 05:55:06] [INFO ] Deduced a trap composed of 29 places in 333 ms of which 1 ms to minimize.
[2023-03-22 05:55:06] [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-22 05:55:06] [INFO ] [Real]Absence check using 221 positive place invariants in 106 ms returned sat
[2023-03-22 05:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:07] [INFO ] [Real]Absence check using state equation in 724 ms returned sat
[2023-03-22 05:55:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:55:07] [INFO ] [Nat]Absence check using 221 positive place invariants in 149 ms returned sat
[2023-03-22 05:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:08] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2023-03-22 05:55:09] [INFO ] Deduced a trap composed of 29 places in 696 ms of which 0 ms to minimize.
[2023-03-22 05:55:09] [INFO ] Deduced a trap composed of 25 places in 378 ms of which 1 ms to minimize.
[2023-03-22 05:55:10] [INFO ] Deduced a trap composed of 25 places in 395 ms of which 1 ms to minimize.
[2023-03-22 05:55:10] [INFO ] Deduced a trap composed of 22 places in 384 ms of which 1 ms to minimize.
[2023-03-22 05:55:11] [INFO ] Deduced a trap composed of 28 places in 1395 ms of which 1 ms to minimize.
[2023-03-22 05:55:12] [INFO ] Deduced a trap composed of 22 places in 383 ms of which 1 ms to minimize.
[2023-03-22 05:55:12] [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-22 05:55:12] [INFO ] [Real]Absence check using 221 positive place invariants in 193 ms returned sat
[2023-03-22 05:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:13] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2023-03-22 05:55:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:55:14] [INFO ] [Nat]Absence check using 221 positive place invariants in 112 ms returned sat
[2023-03-22 05:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:14] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2023-03-22 05:55:15] [INFO ] Deduced a trap composed of 26 places in 425 ms of which 2 ms to minimize.
[2023-03-22 05:55:15] [INFO ] Deduced a trap composed of 35 places in 352 ms of which 0 ms to minimize.
[2023-03-22 05:55:15] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 1 ms to minimize.
[2023-03-22 05:55:16] [INFO ] Deduced a trap composed of 23 places in 341 ms of which 1 ms to minimize.
[2023-03-22 05:55:16] [INFO ] Deduced a trap composed of 24 places in 368 ms of which 1 ms to minimize.
[2023-03-22 05:55:17] [INFO ] Deduced a trap composed of 31 places in 476 ms of which 1 ms to minimize.
[2023-03-22 05:55:17] [INFO ] Deduced a trap composed of 23 places in 314 ms of which 0 ms to minimize.
[2023-03-22 05:55:18] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 3 ms to minimize.
[2023-03-22 05:55:18] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 1 ms to minimize.
[2023-03-22 05:55:18] [INFO ] Deduced a trap composed of 18 places in 464 ms of which 2 ms to minimize.
[2023-03-22 05:55:18] [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-22 05:55:19] [INFO ] [Real]Absence check using 221 positive place invariants in 114 ms returned sat
[2023-03-22 05:55:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:20] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2023-03-22 05:55:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:55:20] [INFO ] [Nat]Absence check using 221 positive place invariants in 193 ms returned sat
[2023-03-22 05:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:21] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2023-03-22 05:55:21] [INFO ] Deduced a trap composed of 29 places in 353 ms of which 1 ms to minimize.
[2023-03-22 05:55:22] [INFO ] Deduced a trap composed of 26 places in 400 ms of which 1 ms to minimize.
[2023-03-22 05:55:22] [INFO ] Deduced a trap composed of 28 places in 345 ms of which 1 ms to minimize.
[2023-03-22 05:55:22] [INFO ] Deduced a trap composed of 17 places in 298 ms of which 1 ms to minimize.
[2023-03-22 05:55:23] [INFO ] Deduced a trap composed of 23 places in 307 ms of which 1 ms to minimize.
[2023-03-22 05:55:23] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 1 ms to minimize.
[2023-03-22 05:55:24] [INFO ] Deduced a trap composed of 26 places in 358 ms of which 1 ms to minimize.
[2023-03-22 05:55:24] [INFO ] Deduced a trap composed of 29 places in 365 ms of which 1 ms to minimize.
[2023-03-22 05:55:24] [INFO ] Deduced a trap composed of 21 places in 339 ms of which 1 ms to minimize.
[2023-03-22 05:55:25] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 1 ms to minimize.
[2023-03-22 05:55:25] [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)
[2023-03-22 05:55:25] [INFO ] [Real]Absence check using 221 positive place invariants in 88 ms returned sat
[2023-03-22 05:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:26] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2023-03-22 05:55:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:55:26] [INFO ] [Nat]Absence check using 221 positive place invariants in 138 ms returned sat
[2023-03-22 05:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:27] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2023-03-22 05:55:28] [INFO ] Deduced a trap composed of 25 places in 435 ms of which 2 ms to minimize.
[2023-03-22 05:55:28] [INFO ] Deduced a trap composed of 18 places in 364 ms of which 1 ms to minimize.
[2023-03-22 05:55:29] [INFO ] Deduced a trap composed of 25 places in 387 ms of which 1 ms to minimize.
[2023-03-22 05:55:29] [INFO ] Deduced a trap composed of 22 places in 346 ms of which 1 ms to minimize.
[2023-03-22 05:55:29] [INFO ] Deduced a trap composed of 20 places in 347 ms of which 1 ms to minimize.
[2023-03-22 05:55:30] [INFO ] Deduced a trap composed of 20 places in 362 ms of which 2 ms to minimize.
[2023-03-22 05:55:30] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 1 ms to minimize.
[2023-03-22 05:55:31] [INFO ] Deduced a trap composed of 24 places in 358 ms of which 1 ms to minimize.
[2023-03-22 05:55:31] [INFO ] Deduced a trap composed of 27 places in 424 ms of which 14 ms to minimize.
[2023-03-22 05:55:31] [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: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-22 05:55:32] [INFO ] [Real]Absence check using 221 positive place invariants in 71 ms returned sat
[2023-03-22 05:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:32] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2023-03-22 05:55:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 05:55:33] [INFO ] [Nat]Absence check using 221 positive place invariants in 76 ms returned sat
[2023-03-22 05:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 05:55:33] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2023-03-22 05:55:34] [INFO ] Deduced a trap composed of 25 places in 421 ms of which 1 ms to minimize.
[2023-03-22 05:55:34] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 1 ms to minimize.
[2023-03-22 05:55:35] [INFO ] Deduced a trap composed of 18 places in 412 ms of which 7 ms to minimize.
[2023-03-22 05:55:35] [INFO ] Deduced a trap composed of 29 places in 368 ms of which 1 ms to minimize.
[2023-03-22 05:55:35] [INFO ] Deduced a trap composed of 20 places in 314 ms of which 1 ms to minimize.
[2023-03-22 05:55:36] [INFO ] Deduced a trap composed of 22 places in 307 ms of which 1 ms to minimize.
[2023-03-22 05:55:36] [INFO ] Deduced a trap composed of 30 places in 344 ms of which 1 ms to minimize.
[2023-03-22 05:55:37] [INFO ] Deduced a trap composed of 20 places in 315 ms of which 13 ms to minimize.
[2023-03-22 05:55:37] [INFO ] Deduced a trap composed of 18 places in 325 ms of which 1 ms to minimize.
[2023-03-22 05:55:37] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 1 ms to minimize.
[2023-03-22 05:55:37] [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 5
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, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1563 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Drop transitions removed 379 transitions
Trivial Post-agglo rules discarded 379 transitions
Performed 379 trivial Post agglomeration. Transition count delta: 379
Iterating post reduction 0 with 379 rules applied. Total rules applied 379 place count 1563 transition count 1044
Reduce places removed 379 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 381 rules applied. Total rules applied 760 place count 1184 transition count 1042
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 764 place count 1183 transition count 1039
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 767 place count 1180 transition count 1039
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 79 Pre rules applied. Total rules applied 767 place count 1180 transition count 960
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 925 place count 1101 transition count 960
Discarding 140 places :
Symmetric choice reduction at 4 with 140 rule applications. Total rules 1065 place count 961 transition count 820
Iterating global reduction 4 with 140 rules applied. Total rules applied 1205 place count 961 transition count 820
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 1205 place count 961 transition count 762
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1321 place count 903 transition count 762
Performed 338 Post agglomeration using F-continuation condition.Transition count delta: 338
Deduced a syphon composed of 338 places in 1 ms
Reduce places removed 338 places and 0 transitions.
Iterating global reduction 4 with 676 rules applied. Total rules applied 1997 place count 565 transition count 424
Renaming transitions due to excessive name length > 1024 char.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 2109 place count 509 transition count 424
Partial Free-agglomeration rule applied 58 times.
Drop transitions removed 58 transitions
Iterating global reduction 4 with 58 rules applied. Total rules applied 2167 place count 509 transition count 424
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2168 place count 508 transition count 423
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2169 place count 507 transition count 423
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2169 place count 507 transition count 421
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2173 place count 505 transition count 421
Applied a total of 2173 rules in 411 ms. Remains 505 /1563 variables (removed 1058) and now considering 421/1423 (removed 1002) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 505/1563 places, 421/1423 transitions.
// Phase 1: matrix 421 rows 505 cols
[2023-03-22 05:55:38] [INFO ] Computed 220 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5123 ms. (steps per millisecond=195 ) properties (out of 6) seen :6
FORMULA ShieldPPPt-PT-020B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-020B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 44751 ms.
ITS solved all properties within timeout

BK_STOP 1679464543676

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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="ShieldPPPt-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 ShieldPPPt-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-167903717300637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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