About the Execution of 2021-gold for DLCshifumi-PT-2b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
430.680 | 20012.00 | 34734.00 | 441.70 | 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/mcc2022-input.r071-tall-165254780400112.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DLCshifumi-PT-2b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-tall-165254780400112
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 9.2K Apr 29 14:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 29 14:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 14:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 14:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 729K May 10 09:33 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 DLCshifumi-PT-2b-UpperBounds-00
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-01
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-02
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-03
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-04
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-05
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-06
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-07
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-08
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-09
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-10
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-11
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-12
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-13
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-14
FORMULA_NAME DLCshifumi-PT-2b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652590901845
Running Version 0
[2022-05-15 05:01:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 05:01:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 05:01:43] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2022-05-15 05:01:43] [INFO ] Transformed 2483 places.
[2022-05-15 05:01:43] [INFO ] Transformed 3183 transitions.
[2022-05-15 05:01:43] [INFO ] Found NUPN structural information;
[2022-05-15 05:01:43] [INFO ] Parsed PT model containing 2483 places and 3183 transitions in 308 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 3183 rows 2483 cols
[2022-05-15 05:01:43] [INFO ] Computed 79 place invariants in 39 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :14
FORMULA DLCshifumi-PT-2b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
// Phase 1: matrix 3183 rows 2483 cols
[2022-05-15 05:01:44] [INFO ] Computed 79 place invariants in 15 ms
[2022-05-15 05:01:44] [INFO ] [Real]Absence check using 79 positive place invariants in 84 ms returned sat
[2022-05-15 05:01:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:01:45] [INFO ] [Real]Absence check using state equation in 1057 ms returned sat
[2022-05-15 05:01:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:01:46] [INFO ] [Nat]Absence check using 79 positive place invariants in 79 ms returned sat
[2022-05-15 05:01:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:01:47] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2022-05-15 05:01:48] [INFO ] Deduced a trap composed of 75 places in 861 ms of which 8 ms to minimize.
[2022-05-15 05:01:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1140 ms
[2022-05-15 05:01:48] [INFO ] Computed and/alt/rep : 3030/4725/3030 causal constraints (skipped 152 transitions) in 197 ms.
[2022-05-15 05:01:52] [INFO ] Deduced a trap composed of 16 places in 1696 ms of which 6 ms to minimize.
[2022-05-15 05:01:52] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-15 05:01:52] [INFO ] [Real]Absence check using 79 positive place invariants in 79 ms returned sat
[2022-05-15 05:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 05:01:54] [INFO ] [Real]Absence check using state equation in 1109 ms returned sat
[2022-05-15 05:01:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 05:01:54] [INFO ] [Nat]Absence check using 79 positive place invariants in 74 ms returned sat
[2022-05-15 05:01:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 05:01:55] [INFO ] [Nat]Absence check using state equation in 1059 ms returned sat
[2022-05-15 05:01:55] [INFO ] Computed and/alt/rep : 3030/4725/3030 causal constraints (skipped 152 transitions) in 176 ms.
[2022-05-15 05:01:59] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:858)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 2483 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2483/2483 places, 3183/3183 transitions.
Graph (trivial) has 2446 edges and 2483 vertex of which 352 / 2483 are part of one of the 23 SCC in 12 ms
Free SCC test removed 329 places
Drop transitions removed 371 transitions
Reduce isomorphic transitions removed 371 transitions.
Drop transitions removed 1257 transitions
Trivial Post-agglo rules discarded 1257 transitions
Performed 1257 trivial Post agglomeration. Transition count delta: 1257
Iterating post reduction 0 with 1257 rules applied. Total rules applied 1258 place count 2154 transition count 1555
Reduce places removed 1257 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 1 with 1355 rules applied. Total rules applied 2613 place count 897 transition count 1457
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 2 with 76 rules applied. Total rules applied 2689 place count 849 transition count 1429
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 2703 place count 835 transition count 1429
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 2703 place count 835 transition count 1413
Deduced a syphon composed of 16 places in 5 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2735 place count 819 transition count 1413
Discarding 233 places :
Symmetric choice reduction at 4 with 233 rule applications. Total rules 2968 place count 586 transition count 1180
Iterating global reduction 4 with 233 rules applied. Total rules applied 3201 place count 586 transition count 1180
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 3201 place count 586 transition count 1098
Deduced a syphon composed of 82 places in 6 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 3365 place count 504 transition count 1098
Discarding 43 places :
Symmetric choice reduction at 4 with 43 rule applications. Total rules 3408 place count 461 transition count 816
Iterating global reduction 4 with 43 rules applied. Total rules applied 3451 place count 461 transition count 816
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 3484 place count 461 transition count 783
Performed 117 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 117 places in 0 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 5 with 234 rules applied. Total rules applied 3718 place count 344 transition count 664
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3721 place count 344 transition count 661
Performed 50 Post agglomeration using F-continuation condition with reduction of 30 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 3821 place count 294 transition count 729
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 3831 place count 294 transition count 719
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 3846 place count 279 transition count 656
Iterating global reduction 7 with 15 rules applied. Total rules applied 3861 place count 279 transition count 656
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 3892 place count 279 transition count 625
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 8 with 26 rules applied. Total rules applied 3918 place count 279 transition count 599
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3922 place count 275 transition count 595
Iterating global reduction 8 with 4 rules applied. Total rules applied 3926 place count 275 transition count 595
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3930 place count 271 transition count 529
Iterating global reduction 8 with 4 rules applied. Total rules applied 3934 place count 271 transition count 529
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 3938 place count 271 transition count 525
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3942 place count 269 transition count 523
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3944 place count 267 transition count 490
Iterating global reduction 9 with 2 rules applied. Total rules applied 3946 place count 267 transition count 490
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3948 place count 267 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 3956 place count 263 transition count 515
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 3961 place count 263 transition count 510
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 11 with 22 rules applied. Total rules applied 3983 place count 263 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 3991 place count 259 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3997 place count 259 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 4018 place count 259 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 4026 place count 255 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 4032 place count 255 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 4053 place count 255 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 4061 place count 251 transition count 515
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 4067 place count 251 transition count 509
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 14 with 21 rules applied. Total rules applied 4088 place count 251 transition count 488
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 14 with 8 rules applied. Total rules applied 4096 place count 247 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 4102 place count 247 transition count 510
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 15 with 21 rules applied. Total rules applied 4123 place count 247 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 15 with 8 rules applied. Total rules applied 4131 place count 243 transition count 516
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 4137 place count 243 transition count 510
Renaming transitions due to excessive name length > 1024 char.
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 16 with 21 rules applied. Total rules applied 4158 place count 243 transition count 489
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 4166 place count 239 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 4172 place count 239 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 17 with 21 rules applied. Total rules applied 4193 place count 239 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 17 with 8 rules applied. Total rules applied 4201 place count 235 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 4207 place count 235 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 18 with 21 rules applied. Total rules applied 4228 place count 235 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 18 with 8 rules applied. Total rules applied 4236 place count 231 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 18 with 6 rules applied. Total rules applied 4242 place count 231 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 19 with 21 rules applied. Total rules applied 4263 place count 231 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 19 with 8 rules applied. Total rules applied 4271 place count 227 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 4277 place count 227 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 20 with 21 rules applied. Total rules applied 4298 place count 227 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 20 with 8 rules applied. Total rules applied 4306 place count 223 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 20 with 6 rules applied. Total rules applied 4312 place count 223 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 21 with 21 rules applied. Total rules applied 4333 place count 223 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 8 rules applied. Total rules applied 4341 place count 219 transition count 517
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 21 with 6 rules applied. Total rules applied 4347 place count 219 transition count 511
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 22 with 21 rules applied. Total rules applied 4368 place count 219 transition count 490
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 22 with 8 rules applied. Total rules applied 4376 place count 215 transition count 518
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 22 with 6 rules applied. Total rules applied 4382 place count 215 transition count 512
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 23 with 21 rules applied. Total rules applied 4403 place count 215 transition count 491
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 23 with 8 rules applied. Total rules applied 4411 place count 211 transition count 518
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 23 with 6 rules applied. Total rules applied 4417 place count 211 transition count 512
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 24 with 21 rules applied. Total rules applied 4438 place count 211 transition count 491
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 24 with 4 rules applied. Total rules applied 4442 place count 209 transition count 496
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 4444 place count 209 transition count 494
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 25 with 5 rules applied. Total rules applied 4449 place count 209 transition count 489
Free-agglomeration rule applied 49 times.
Iterating global reduction 25 with 49 rules applied. Total rules applied 4498 place count 209 transition count 440
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Graph (complete) has 456 edges and 160 vertex of which 26 are kept as prefixes of interest. Removing 134 places using SCC suffix rule.2 ms
Discarding 134 places :
Also discarding 182 output transitions
Drop transitions removed 182 transitions
Iterating post reduction 25 with 204 rules applied. Total rules applied 4702 place count 26 transition count 104
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 26 with 56 rules applied. Total rules applied 4758 place count 26 transition count 48
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 27 with 6 rules applied. Total rules applied 4764 place count 26 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 27 with 1 rules applied. Total rules applied 4765 place count 25 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 4767 place count 23 transition count 41
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 28 with 12 rules applied. Total rules applied 4779 place count 15 transition count 37
Drop transitions removed 4 transitions
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 28 with 13 rules applied. Total rules applied 4792 place count 15 transition count 24
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 29 with 12 rules applied. Total rules applied 4804 place count 7 transition count 20
Drop transitions removed 8 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 5 edges and 7 vertex of which 4 / 7 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 29 with 12 rules applied. Total rules applied 4816 place count 5 transition count 9
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 4820 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 31 with 1 Pre rules applied. Total rules applied 4820 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 4822 place count 4 transition count 4
Applied a total of 4822 rules in 686 ms. Remains 4 /2483 variables (removed 2479) and now considering 4/3183 (removed 3179) transitions.
Finished structural reductions, in 1 iterations. Remains : 4/2483 places, 4/3183 transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-15 05:01:59] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 2) seen :2
FORMULA DLCshifumi-PT-2b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCshifumi-PT-2b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
BK_STOP 1652590921857
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="DLCshifumi-PT-2b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DLCshifumi-PT-2b, 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 r071-tall-165254780400112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-2b.tgz
mv DLCshifumi-PT-2b 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 ;