About the Execution of 2023-gold for ShieldIIPt-PT-050B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
762.300 | 131803.00 | 150197.00 | 774.50 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788800206.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPt-PT-050B, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788800206
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 20:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 20:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 20:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 20:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 860K May 18 16:43 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-050B-UpperBounds-00
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-01
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-02
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-03
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-04
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-05
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-06
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-07
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-08
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-09
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-10
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-11
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-12
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-13
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-14
FORMULA_NAME ShieldIIPt-PT-050B-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716956958336
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-050B
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-29 04:29:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 04:29:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 04:29:20] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-05-29 04:29:20] [INFO ] Transformed 3503 places.
[2024-05-29 04:29:20] [INFO ] Transformed 3253 transitions.
[2024-05-29 04:29:20] [INFO ] Found NUPN structural information;
[2024-05-29 04:29:20] [INFO ] Parsed PT model containing 3503 places and 3253 transitions and 8106 arcs in 392 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 3253 rows 3503 cols
[2024-05-29 04:29:20] [INFO ] Computed 451 invariants in 49 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 16) seen :13
FORMULA ShieldIIPt-PT-050B-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) 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 3) 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 3) seen :0
[2024-05-29 04:29:21] [INFO ] Invariant cache hit.
[2024-05-29 04:29:21] [INFO ] [Real]Absence check using 451 positive place invariants in 228 ms returned sat
[2024-05-29 04:29:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:29:23] [INFO ] [Real]Absence check using state equation in 1841 ms returned sat
[2024-05-29 04:29:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:29:24] [INFO ] [Nat]Absence check using 451 positive place invariants in 209 ms returned sat
[2024-05-29 04:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 04:29:26] [INFO ] [Nat]Absence check using state equation in 1715 ms returned sat
[2024-05-29 04:29:27] [INFO ] Deduced a trap composed of 23 places in 1081 ms of which 7 ms to minimize.
[2024-05-29 04:29:28] [INFO ] Deduced a trap composed of 19 places in 1127 ms of which 2 ms to minimize.
[2024-05-29 04:29:30] [INFO ] Deduced a trap composed of 16 places in 1051 ms of which 2 ms to minimize.
[2024-05-29 04:29:30] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:29:30] [INFO ] [Real]Absence check using 451 positive place invariants in 224 ms returned sat
[2024-05-29 04:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:29:32] [INFO ] [Real]Absence check using state equation in 1736 ms returned sat
[2024-05-29 04:29:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:29:33] [INFO ] [Nat]Absence check using 451 positive place invariants in 184 ms returned sat
[2024-05-29 04:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 04:29:35] [INFO ] [Nat]Absence check using state equation in 1797 ms returned sat
[2024-05-29 04:29:36] [INFO ] Deduced a trap composed of 21 places in 1155 ms of which 3 ms to minimize.
[2024-05-29 04:29:37] [INFO ] Deduced a trap composed of 25 places in 1151 ms of which 3 ms to minimize.
[2024-05-29 04:29: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 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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-29 04:29:38] [INFO ] [Real]Absence check using 451 positive place invariants in 213 ms returned sat
[2024-05-29 04:29:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:29:40] [INFO ] [Real]Absence check using state equation in 1744 ms returned sat
[2024-05-29 04:29:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:29:41] [INFO ] [Nat]Absence check using 451 positive place invariants in 214 ms returned sat
[2024-05-29 04:29:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 04:29:42] [INFO ] [Nat]Absence check using state equation in 1781 ms returned sat
[2024-05-29 04:29:44] [INFO ] Deduced a trap composed of 28 places in 1178 ms of which 2 ms to minimize.
[2024-05-29 04:29:45] [INFO ] Deduced a trap composed of 19 places in 1139 ms of which 2 ms to minimize.
[2024-05-29 04:29:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 3503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3503/3503 places, 3253/3253 transitions.
Drop transitions removed 851 transitions
Trivial Post-agglo rules discarded 851 transitions
Performed 851 trivial Post agglomeration. Transition count delta: 851
Iterating post reduction 0 with 851 rules applied. Total rules applied 851 place count 3503 transition count 2402
Reduce places removed 851 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 853 rules applied. Total rules applied 1704 place count 2652 transition count 2400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1705 place count 2651 transition count 2400
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 199 Pre rules applied. Total rules applied 1705 place count 2651 transition count 2201
Deduced a syphon composed of 199 places in 9 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 3 with 398 rules applied. Total rules applied 2103 place count 2452 transition count 2201
Discarding 350 places :
Symmetric choice reduction at 3 with 350 rule applications. Total rules 2453 place count 2102 transition count 1851
Iterating global reduction 3 with 350 rules applied. Total rules applied 2803 place count 2102 transition count 1851
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 149 Pre rules applied. Total rules applied 2803 place count 2102 transition count 1702
Deduced a syphon composed of 149 places in 12 ms
Reduce places removed 149 places and 0 transitions.
Iterating global reduction 3 with 298 rules applied. Total rules applied 3101 place count 1953 transition count 1702
Performed 850 Post agglomeration using F-continuation condition.Transition count delta: 850
Deduced a syphon composed of 850 places in 2 ms
Reduce places removed 850 places and 0 transitions.
Iterating global reduction 3 with 1700 rules applied. Total rules applied 4801 place count 1103 transition count 852
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 3 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 5003 place count 1002 transition count 917
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 5095 place count 956 transition count 948
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 5096 place count 956 transition count 947
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5097 place count 956 transition count 946
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 5098 place count 955 transition count 946
Partial Free-agglomeration rule applied 50 times.
Drop transitions removed 50 transitions
Iterating global reduction 5 with 50 rules applied. Total rules applied 5148 place count 955 transition count 946
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 5149 place count 954 transition count 945
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 5151 place count 952 transition count 945
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 5151 place count 952 transition count 944
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 5153 place count 951 transition count 944
Applied a total of 5153 rules in 1043 ms. Remains 951 /3503 variables (removed 2552) and now considering 944/3253 (removed 2309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1044 ms. Remains : 951/3503 places, 944/3253 transitions.
// Phase 1: matrix 944 rows 951 cols
[2024-05-29 04:29:46] [INFO ] Computed 449 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8637 ms. (steps per millisecond=115 ) properties (out of 3) seen :2
FORMULA ShieldIIPt-PT-050B-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-050B-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 939420 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=187 ) properties seen 0
[2024-05-29 04:30:00] [INFO ] Invariant cache hit.
[2024-05-29 04:30:00] [INFO ] [Real]Absence check using 449 positive place invariants in 75 ms returned sat
[2024-05-29 04:30:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:30:00] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2024-05-29 04:30:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:30:00] [INFO ] [Nat]Absence check using 449 positive place invariants in 60 ms returned sat
[2024-05-29 04:30:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 04:30:01] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2024-05-29 04:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:30:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-29 04:30:01] [INFO ] Computed and/alt/rep : 941/1682/941 causal constraints (skipped 0 transitions) in 58 ms.
[2024-05-29 04:30:14] [INFO ] Added : 848 causal constraints over 170 iterations in 12976 ms. Result :sat
Minimization took 3003 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 944/944 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 951 transition count 943
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 950 transition count 943
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 949 transition count 942
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 948 transition count 944
Applied a total of 6 rules in 86 ms. Remains 948 /951 variables (removed 3) and now considering 944/944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 948/951 places, 944/944 transitions.
// Phase 1: matrix 944 rows 948 cols
[2024-05-29 04:30:17] [INFO ] Computed 449 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8587 ms. (steps per millisecond=116 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 945403 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen 0
[2024-05-29 04:30:30] [INFO ] Invariant cache hit.
[2024-05-29 04:30:31] [INFO ] [Real]Absence check using 449 positive place invariants in 74 ms returned sat
[2024-05-29 04:30:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:30:31] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2024-05-29 04:30:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:30:31] [INFO ] [Nat]Absence check using 449 positive place invariants in 68 ms returned sat
[2024-05-29 04:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 04:30:31] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2024-05-29 04:30:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 04:30:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-29 04:30:32] [INFO ] Computed and/alt/rep : 941/1684/941 causal constraints (skipped 0 transitions) in 57 ms.
[2024-05-29 04:30:46] [INFO ] Added : 865 causal constraints over 174 iterations in 14123 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 948 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 944/944 transitions.
Applied a total of 0 rules in 28 ms. Remains 948 /948 variables (removed 0) and now considering 944/944 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 948/948 places, 944/944 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 948/948 places, 944/944 transitions.
Applied a total of 0 rules in 18 ms. Remains 948 /948 variables (removed 0) and now considering 944/944 (removed 0) transitions.
[2024-05-29 04:30:49] [INFO ] Invariant cache hit.
[2024-05-29 04:30:49] [INFO ] Implicit Places using invariants in 557 ms returned [937]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 560 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 947/948 places, 944/944 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 946 transition count 943
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 946 transition count 943
Applied a total of 2 rules in 31 ms. Remains 946 /947 variables (removed 1) and now considering 943/944 (removed 1) transitions.
// Phase 1: matrix 943 rows 946 cols
[2024-05-29 04:30:49] [INFO ] Computed 448 invariants in 5 ms
[2024-05-29 04:30:50] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-29 04:30:50] [INFO ] Invariant cache hit.
[2024-05-29 04:30:51] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1631 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 946/948 places, 943/944 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2240 ms. Remains : 946/948 places, 943/944 transitions.
[2024-05-29 04:30:51] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8451 ms. (steps per millisecond=118 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 956616 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen 0
[2024-05-29 04:31:04] [INFO ] Invariant cache hit.
[2024-05-29 04:31:05] [INFO ] [Real]Absence check using 448 positive place invariants in 69 ms returned sat
[2024-05-29 04:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:31:05] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2024-05-29 04:31:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:31:05] [INFO ] [Nat]Absence check using 448 positive place invariants in 69 ms returned sat
[2024-05-29 04:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 04:31:05] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2024-05-29 04:31:05] [INFO ] Computed and/alt/rep : 940/1678/940 causal constraints (skipped 0 transitions) in 48 ms.
[2024-05-29 04:31:16] [INFO ] Added : 840 causal constraints over 169 iterations in 10916 ms. Result :sat
Minimization took 3011 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 943/943 transitions.
Applied a total of 0 rules in 25 ms. Remains 946 /946 variables (removed 0) and now considering 943/943 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 946/946 places, 943/943 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 943/943 transitions.
Applied a total of 0 rules in 16 ms. Remains 946 /946 variables (removed 0) and now considering 943/943 (removed 0) transitions.
[2024-05-29 04:31:19] [INFO ] Invariant cache hit.
[2024-05-29 04:31:20] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-05-29 04:31:20] [INFO ] Invariant cache hit.
[2024-05-29 04:31:21] [INFO ] Implicit Places using invariants and state equation in 1101 ms returned []
Implicit Place search using SMT with State Equation took 1647 ms to find 0 implicit places.
[2024-05-29 04:31:21] [INFO ] Redundant transitions in 49 ms returned []
[2024-05-29 04:31:21] [INFO ] Invariant cache hit.
[2024-05-29 04:31:22] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2209 ms. Remains : 946/946 places, 943/943 transitions.
Starting property specific reduction for ShieldIIPt-PT-050B-UpperBounds-01
[2024-05-29 04:31:22] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
[2024-05-29 04:31:22] [INFO ] Invariant cache hit.
[2024-05-29 04:31:22] [INFO ] [Real]Absence check using 448 positive place invariants in 69 ms returned sat
[2024-05-29 04:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 04:31:22] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2024-05-29 04:31:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 04:31:22] [INFO ] [Nat]Absence check using 448 positive place invariants in 75 ms returned sat
[2024-05-29 04:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 04:31:23] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2024-05-29 04:31:23] [INFO ] Computed and/alt/rep : 940/1678/940 causal constraints (skipped 0 transitions) in 48 ms.
[2024-05-29 04:31:27] [INFO ] Added : 430 causal constraints over 86 iterations in 4492 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA ShieldIIPt-PT-050B-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Ending property specific reduction for ShieldIIPt-PT-050B-UpperBounds-01 in 6756 ms.
[2024-05-29 04:31:29] [INFO ] Flatten gal took : 126 ms
Total runtime 128925 ms.
BK_STOP 1716957090139
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-050B"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-050B, 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 r373-tall-171683788800206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-050B.tgz
mv ShieldIIPt-PT-050B 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 '
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 ;