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.r391-oct2-167903715600669.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 lolaxred
Input is ShieldPPPt-PT-040B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715600669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.1K Feb 25 20:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 20:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 20:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 25 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:01 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 762K 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-040B-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-040B-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679280064851

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 02:41:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-20 02:41:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 02:41:06] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-20 02:41:07] [INFO ] Transformed 3123 places.
[2023-03-20 02:41:07] [INFO ] Transformed 2843 transitions.
[2023-03-20 02:41:07] [INFO ] Found NUPN structural information;
[2023-03-20 02:41:07] [INFO ] Parsed PT model containing 3123 places and 2843 transitions and 7126 arcs in 401 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 2843 rows 3123 cols
[2023-03-20 02:41:07] [INFO ] Computed 441 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :12
FORMULA ShieldPPPt-PT-040B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 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 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 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
[2023-03-20 02:41:07] [INFO ] Invariant cache hit.
[2023-03-20 02:41:08] [INFO ] [Real]Absence check using 441 positive place invariants in 296 ms returned sat
[2023-03-20 02:41:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:10] [INFO ] [Real]Absence check using state equation in 1893 ms returned sat
[2023-03-20 02:41:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:41:11] [INFO ] [Nat]Absence check using 441 positive place invariants in 252 ms returned sat
[2023-03-20 02:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:12] [INFO ] [Nat]Absence check using state equation in 1638 ms returned sat
[2023-03-20 02:41:14] [INFO ] Deduced a trap composed of 16 places in 1087 ms of which 23 ms to minimize.
[2023-03-20 02:41:15] [INFO ] Deduced a trap composed of 22 places in 1322 ms of which 3 ms to minimize.
[2023-03-20 02:41:15] [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-20 02:41:16] [INFO ] [Real]Absence check using 441 positive place invariants in 261 ms returned sat
[2023-03-20 02:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:18] [INFO ] [Real]Absence check using state equation in 1441 ms returned sat
[2023-03-20 02:41:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:41:18] [INFO ] [Nat]Absence check using 441 positive place invariants in 214 ms returned sat
[2023-03-20 02:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:20] [INFO ] [Nat]Absence check using state equation in 1419 ms returned sat
[2023-03-20 02:41:21] [INFO ] Deduced a trap composed of 24 places in 1033 ms of which 2 ms to minimize.
[2023-03-20 02:41:22] [INFO ] Deduced a trap composed of 31 places in 1139 ms of which 16 ms to minimize.
[2023-03-20 02:41:23] [INFO ] Deduced a trap composed of 20 places in 1050 ms of which 9 ms to minimize.
[2023-03-20 02:41:23] [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-20 02:41:24] [INFO ] [Real]Absence check using 441 positive place invariants in 179 ms returned sat
[2023-03-20 02:41:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:26] [INFO ] [Real]Absence check using state equation in 1843 ms returned sat
[2023-03-20 02:41:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:41:27] [INFO ] [Nat]Absence check using 441 positive place invariants in 168 ms returned sat
[2023-03-20 02:41:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:28] [INFO ] [Nat]Absence check using state equation in 1370 ms returned sat
[2023-03-20 02:41:29] [INFO ] Deduced a trap composed of 23 places in 1001 ms of which 2 ms to minimize.
[2023-03-20 02:41:30] [INFO ] Deduced a trap composed of 20 places in 989 ms of which 2 ms to minimize.
[2023-03-20 02:41:32] [INFO ] Deduced a trap composed of 24 places in 1167 ms of which 2 ms to minimize.
[2023-03-20 02:41: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 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-20 02:41:32] [INFO ] [Real]Absence check using 441 positive place invariants in 238 ms returned sat
[2023-03-20 02:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:34] [INFO ] [Real]Absence check using state equation in 1369 ms returned sat
[2023-03-20 02:41:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:41:34] [INFO ] [Nat]Absence check using 441 positive place invariants in 190 ms returned sat
[2023-03-20 02:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:36] [INFO ] [Nat]Absence check using state equation in 1491 ms returned sat
[2023-03-20 02:41:37] [INFO ] Deduced a trap composed of 32 places in 1040 ms of which 2 ms to minimize.
[2023-03-20 02:41:38] [INFO ] Deduced a trap composed of 34 places in 951 ms of which 1 ms to minimize.
[2023-03-20 02:41:39] [INFO ] Deduced a trap composed of 22 places in 996 ms of which 2 ms to minimize.
[2023-03-20 02:41:39] [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 3123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3123/3123 places, 2843/2843 transitions.
Drop transitions removed 760 transitions
Trivial Post-agglo rules discarded 760 transitions
Performed 760 trivial Post agglomeration. Transition count delta: 760
Iterating post reduction 0 with 760 rules applied. Total rules applied 760 place count 3123 transition count 2083
Reduce places removed 760 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 762 rules applied. Total rules applied 1522 place count 2363 transition count 2081
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 1526 place count 2362 transition count 2078
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1529 place count 2359 transition count 2078
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 159 Pre rules applied. Total rules applied 1529 place count 2359 transition count 1919
Deduced a syphon composed of 159 places in 5 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 4 with 318 rules applied. Total rules applied 1847 place count 2200 transition count 1919
Discarding 280 places :
Symmetric choice reduction at 4 with 280 rule applications. Total rules 2127 place count 1920 transition count 1639
Iterating global reduction 4 with 280 rules applied. Total rules applied 2407 place count 1920 transition count 1639
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 120 Pre rules applied. Total rules applied 2407 place count 1920 transition count 1519
Deduced a syphon composed of 120 places in 9 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 2647 place count 1800 transition count 1519
Performed 676 Post agglomeration using F-continuation condition.Transition count delta: 676
Deduced a syphon composed of 676 places in 3 ms
Reduce places removed 676 places and 0 transitions.
Iterating global reduction 4 with 1352 rules applied. Total rules applied 3999 place count 1124 transition count 843
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 4201 place count 1023 transition count 843
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 4237 place count 1005 transition count 843
Partial Free-agglomeration rule applied 118 times.
Drop transitions removed 118 transitions
Iterating global reduction 4 with 118 rules applied. Total rules applied 4355 place count 1005 transition count 843
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 4356 place count 1004 transition count 842
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 4357 place count 1003 transition count 842
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 4357 place count 1003 transition count 840
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 4361 place count 1001 transition count 840
Applied a total of 4361 rules in 1040 ms. Remains 1001 /3123 variables (removed 2122) and now considering 840/2843 (removed 2003) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1040 ms. Remains : 1001/3123 places, 840/2843 transitions.
// Phase 1: matrix 840 rows 1001 cols
[2023-03-20 02:41:40] [INFO ] Computed 440 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 7553 ms. (steps per millisecond=132 ) properties (out of 4) seen :2
FORMULA ShieldPPPt-PT-040B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 990595 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4961 ms. (steps per millisecond=201 ) properties (out of 2) seen :0
[2023-03-20 02:41:58] [INFO ] Invariant cache hit.
[2023-03-20 02:41:58] [INFO ] [Real]Absence check using 440 positive place invariants in 81 ms returned sat
[2023-03-20 02:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:59] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2023-03-20 02:41:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:41:59] [INFO ] [Nat]Absence check using 440 positive place invariants in 67 ms returned sat
[2023-03-20 02:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:41:59] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-20 02:41:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 02:41:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-20 02:41:59] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2023-03-20 02:41:59] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-03-20 02:41:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2023-03-20 02:42:00] [INFO ] Computed and/alt/rep : 836/1971/836 causal constraints (skipped 0 transitions) in 75 ms.
[2023-03-20 02:42:16] [INFO ] Added : 810 causal constraints over 163 iterations in 16773 ms. Result :sat
Minimization took 1041 ms.
[2023-03-20 02:42:18] [INFO ] [Real]Absence check using 440 positive place invariants in 62 ms returned sat
[2023-03-20 02:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 02:42:18] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2023-03-20 02:42:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 02:42:18] [INFO ] [Nat]Absence check using 440 positive place invariants in 117 ms returned sat
[2023-03-20 02:42:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 02:42:18] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2023-03-20 02:42:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-20 02:42:18] [INFO ] Computed and/alt/rep : 836/1971/836 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-20 02:42:35] [INFO ] Added : 809 causal constraints over 163 iterations in 16192 ms. Result :sat
Minimization took 644 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA ShieldPPPt-PT-040B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-040B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 89967 ms.
ITS solved all properties within timeout

BK_STOP 1679280156861

--------------------
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-040B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is ShieldPPPt-PT-040B, 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 r391-oct2-167903715600669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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