About the Execution of Marcie+red for CloudDeployment-PT-6b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5452.676 | 123950.00 | 160725.00 | 763.20 | 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/mcc2023-input.r074-smll-167814400300437.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is CloudDeployment-PT-6b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400300437
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 8.0K Feb 25 14:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 25 14:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 14:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 4.8M Mar 5 18:22 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 CloudDeployment-PT-6b-UpperBounds-00
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-01
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-02
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-03
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-04
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-05
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-06
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-07
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-08
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-09
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-10
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-11
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-12
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-13
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-14
FORMULA_NAME CloudDeployment-PT-6b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678507189407
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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-6b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 03:59:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-11 03:59:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:59:53] [INFO ] Load time of PNML (sax parser for PT used): 836 ms
[2023-03-11 03:59:53] [INFO ] Transformed 1888 places.
[2023-03-11 03:59:53] [INFO ] Transformed 6804 transitions.
[2023-03-11 03:59:53] [INFO ] Found NUPN structural information;
[2023-03-11 03:59:53] [INFO ] Parsed PT model containing 1888 places and 6804 transitions and 91831 arcs in 1036 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
// Phase 1: matrix 6804 rows 1888 cols
[2023-03-11 03:59:53] [INFO ] Computed 25 place invariants in 259 ms
Incomplete random walk after 10000 steps, including 48 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 16) seen :8
FORMULA CloudDeployment-PT-6b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
[2023-03-11 03:59:54] [INFO ] Invariant cache hit.
[2023-03-11 03:59:55] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 72 ms returned sat
[2023-03-11 03:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:59:59] [INFO ] [Real]Absence check using state equation in 3964 ms returned sat
[2023-03-11 03:59:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
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-11 04:00:00] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 76 ms returned sat
[2023-03-11 04:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:03] [INFO ] [Real]Absence check using state equation in 3700 ms returned sat
[2023-03-11 04:00:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:00:04] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-11 04:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:08] [INFO ] [Nat]Absence check using state equation in 3530 ms returned sat
[2023-03-11 04:00:11] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 3111 ms.
[2023-03-11 04:00:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3114 ms. Result :unknown
[2023-03-11 04:00:12] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-11 04:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:15] [INFO ] [Real]Absence check using state equation in 3554 ms returned sat
[2023-03-11 04:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:00:16] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-11 04:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:19] [INFO ] [Nat]Absence check using state equation in 2628 ms returned sat
[2023-03-11 04:00:22] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 3232 ms.
[2023-03-11 04:00:22] [INFO ] Added : 0 causal constraints over 0 iterations in 3238 ms. Result :unknown
[2023-03-11 04:00:22] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-11 04:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:25] [INFO ] [Real]Absence check using state equation in 2820 ms returned sat
[2023-03-11 04:00:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:00:26] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-11 04:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:29] [INFO ] [Nat]Absence check using state equation in 2759 ms returned sat
[2023-03-11 04:00:32] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2540 ms.
[2023-03-11 04:00:32] [INFO ] Added : 0 causal constraints over 0 iterations in 2551 ms. Result :unknown
[2023-03-11 04:00:32] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 64 ms returned sat
[2023-03-11 04:00:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:36] [INFO ] [Real]Absence check using state equation in 3403 ms returned sat
[2023-03-11 04:00:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:00:37] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 73 ms returned sat
[2023-03-11 04:00:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:40] [INFO ] [Nat]Absence check using state equation in 3028 ms returned sat
[2023-03-11 04:00:43] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2984 ms.
[2023-03-11 04:00:43] [INFO ] Added : 0 causal constraints over 0 iterations in 2986 ms. Result :unknown
[2023-03-11 04:00:43] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 94 ms returned sat
[2023-03-11 04:00:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:48] [INFO ] [Real]Absence check using state equation in 4366 ms returned unknown
[2023-03-11 04:00:48] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 65 ms returned sat
[2023-03-11 04:00:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:51] [INFO ] [Real]Absence check using state equation in 3254 ms returned sat
[2023-03-11 04:00:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:00:52] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 100 ms returned sat
[2023-03-11 04:00:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:00:56] [INFO ] [Nat]Absence check using state equation in 3252 ms returned sat
[2023-03-11 04:00:59] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 3067 ms.
[2023-03-11 04:00:59] [INFO ] Added : 0 causal constraints over 0 iterations in 3069 ms. Result :unknown
[2023-03-11 04:00:59] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 61 ms returned sat
[2023-03-11 04:01:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:03] [INFO ] [Real]Absence check using state equation in 3551 ms returned sat
[2023-03-11 04:01:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:04] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 63 ms returned sat
[2023-03-11 04:01:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:07] [INFO ] [Nat]Absence check using state equation in 3039 ms returned sat
[2023-03-11 04:01:10] [INFO ] Computed and/alt/rep : 2212/3880/2212 causal constraints (skipped 4591 transitions) in 2972 ms.
[2023-03-11 04:01:10] [INFO ] Added : 0 causal constraints over 0 iterations in 2974 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA CloudDeployment-PT-6b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 1888 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1888/1888 places, 6804/6804 transitions.
Graph (trivial) has 1898 edges and 1888 vertex of which 499 / 1888 are part of one of the 48 SCC in 13 ms
Free SCC test removed 451 places
Drop transitions removed 2600 transitions
Reduce isomorphic transitions removed 2600 transitions.
Graph (complete) has 4308 edges and 1437 vertex of which 1424 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.23 ms
Discarding 13 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Ensure Unique test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 672 transitions
Trivial Post-agglo rules discarded 672 transitions
Performed 672 trivial Post agglomeration. Transition count delta: 672
Iterating post reduction 0 with 681 rules applied. Total rules applied 683 place count 1422 transition count 3519
Reduce places removed 672 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 674 rules applied. Total rules applied 1357 place count 750 transition count 3517
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1359 place count 748 transition count 3517
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1359 place count 748 transition count 3494
Deduced a syphon composed of 23 places in 7 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1405 place count 725 transition count 3494
Discarding 325 places :
Symmetric choice reduction at 3 with 325 rule applications. Total rules 1730 place count 400 transition count 1133
Iterating global reduction 3 with 325 rules applied. Total rules applied 2055 place count 400 transition count 1133
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 2085 place count 400 transition count 1103
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 2085 place count 400 transition count 1080
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 2131 place count 377 transition count 1080
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 2135 place count 373 transition count 1076
Iterating global reduction 4 with 4 rules applied. Total rules applied 2139 place count 373 transition count 1076
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 2142 place count 370 transition count 1073
Iterating global reduction 4 with 3 rules applied. Total rules applied 2145 place count 370 transition count 1073
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 2147 place count 368 transition count 1071
Iterating global reduction 4 with 2 rules applied. Total rules applied 2149 place count 368 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 2150 place count 367 transition count 1070
Iterating global reduction 4 with 1 rules applied. Total rules applied 2151 place count 367 transition count 1070
Performed 92 Post agglomeration using F-continuation condition.Transition count delta: 92
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 4 with 184 rules applied. Total rules applied 2335 place count 275 transition count 978
Performed 38 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 2411 place count 237 transition count 1148
Drop transitions removed 13 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2431 place count 237 transition count 1128
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -60
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 2443 place count 231 transition count 1188
Drop transitions removed 168 transitions
Redundant transition composition rules discarded 168 transitions
Iterating global reduction 5 with 168 rules applied. Total rules applied 2611 place count 231 transition count 1020
Free-agglomeration rule applied 65 times with reduction of 30 identical transitions.
Iterating global reduction 5 with 65 rules applied. Total rules applied 2676 place count 231 transition count 925
Reduce places removed 65 places and 0 transitions.
Drop transitions removed 143 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 215 transitions.
Iterating post reduction 5 with 280 rules applied. Total rules applied 2956 place count 166 transition count 710
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2961 place count 161 transition count 675
Iterating global reduction 6 with 5 rules applied. Total rules applied 2966 place count 161 transition count 675
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 6 with 108 rules applied. Total rules applied 3074 place count 161 transition count 567
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 3079 place count 161 transition count 588
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 3084 place count 156 transition count 588
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 3086 place count 156 transition count 588
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 3087 place count 155 transition count 587
Applied a total of 3087 rules in 1075 ms. Remains 155 /1888 variables (removed 1733) and now considering 587/6804 (removed 6217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1076 ms. Remains : 155/1888 places, 587/6804 transitions.
Normalized transition count is 305 out of 587 initially.
// Phase 1: matrix 305 rows 155 cols
[2023-03-11 04:01:12] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 34322 resets, run finished after 2679 ms. (steps per millisecond=373 ) properties (out of 6) seen :3
FORMULA CloudDeployment-PT-6b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2779 resets, run finished after 657 ms. (steps per millisecond=1522 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2807 resets, run finished after 652 ms. (steps per millisecond=1533 ) properties (out of 3) seen :1
FORMULA CloudDeployment-PT-6b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-11 04:01:16] [INFO ] Flow matrix only has 305 transitions (discarded 282 similar events)
// Phase 1: matrix 305 rows 155 cols
[2023-03-11 04:01:16] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-11 04:01:16] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-11 04:01:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:16] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-11 04:01:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:16] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-11 04:01:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:16] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-03-11 04:01:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:16] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-11 04:01:16] [INFO ] Computed and/alt/rep : 190/626/190 causal constraints (skipped 68 transitions) in 26 ms.
[2023-03-11 04:01:17] [INFO ] Added : 39 causal constraints over 8 iterations in 234 ms. Result :sat
Minimization took 54 ms.
[2023-03-11 04:01:17] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-11 04:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:17] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2023-03-11 04:01:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:17] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-11 04:01:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:17] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-11 04:01:17] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2023-03-11 04:01:17] [INFO ] Computed and/alt/rep : 190/626/190 causal constraints (skipped 68 transitions) in 30 ms.
[2023-03-11 04:01:17] [INFO ] Added : 38 causal constraints over 8 iterations in 223 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 587/587 transitions.
Graph (trivial) has 68 edges and 155 vertex of which 2 / 155 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 154 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 152 transition count 583
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 152 transition count 581
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 150 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 149 transition count 574
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 149 transition count 574
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 2 with 4 rules applied. Total rules applied 15 place count 147 transition count 572
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 146 transition count 586
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 2 with 18 rules applied. Total rules applied 35 place count 146 transition count 568
Applied a total of 35 rules in 59 ms. Remains 146 /155 variables (removed 9) and now considering 568/587 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 146/155 places, 568/587 transitions.
Normalized transition count is 286 out of 568 initially.
// Phase 1: matrix 286 rows 146 cols
[2023-03-11 04:01:17] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 34327 resets, run finished after 2480 ms. (steps per millisecond=403 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2789 resets, run finished after 652 ms. (steps per millisecond=1533 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2792 resets, run finished after 652 ms. (steps per millisecond=1533 ) properties (out of 2) seen :0
[2023-03-11 04:01:21] [INFO ] Flow matrix only has 286 transitions (discarded 282 similar events)
// Phase 1: matrix 286 rows 146 cols
[2023-03-11 04:01:21] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-11 04:01:21] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-11 04:01:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:21] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-11 04:01:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:21] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-11 04:01:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:21] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-11 04:01:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:21] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-11 04:01:22] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 24 ms.
[2023-03-11 04:01:22] [INFO ] Added : 48 causal constraints over 10 iterations in 222 ms. Result :sat
Minimization took 51 ms.
[2023-03-11 04:01:22] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-11 04:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:22] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-11 04:01:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:22] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-11 04:01:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:22] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-03-11 04:01:22] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-11 04:01:22] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 23 ms.
[2023-03-11 04:01:22] [INFO ] Added : 48 causal constraints over 10 iterations in 219 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 146 /146 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 146/146 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 146 /146 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-11 04:01:22] [INFO ] Flow matrix only has 286 transitions (discarded 282 similar events)
[2023-03-11 04:01:22] [INFO ] Invariant cache hit.
[2023-03-11 04:01:23] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-11 04:01:23] [INFO ] Flow matrix only has 286 transitions (discarded 282 similar events)
[2023-03-11 04:01:23] [INFO ] Invariant cache hit.
[2023-03-11 04:01:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:23] [INFO ] Implicit Places using invariants and state equation in 862 ms returned [1, 3, 18, 20, 36, 38, 53, 55, 72, 86, 89]
Discarding 11 places :
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT with State Equation took 1092 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/146 places, 557/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 135 /135 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1119 ms. Remains : 135/146 places, 557/568 transitions.
Normalized transition count is 275 out of 557 initially.
// Phase 1: matrix 275 rows 135 cols
[2023-03-11 04:01:24] [INFO ] Computed 24 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 12806 resets, run finished after 3202 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1692 resets, run finished after 691 ms. (steps per millisecond=1447 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1706 resets, run finished after 698 ms. (steps per millisecond=1432 ) properties (out of 2) seen :0
[2023-03-11 04:01:28] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
// Phase 1: matrix 275 rows 135 cols
[2023-03-11 04:01:28] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-11 04:01:28] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-11 04:01:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:28] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-11 04:01:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:28] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-11 04:01:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:28] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-11 04:01:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:28] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-11 04:01:28] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 50 ms.
[2023-03-11 04:01:29] [INFO ] Added : 46 causal constraints over 10 iterations in 356 ms. Result :sat
Minimization took 84 ms.
[2023-03-11 04:01:29] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-11 04:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:29] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-11 04:01:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:29] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-11 04:01:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:29] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-11 04:01:29] [INFO ] [Nat]Added 8 Read/Feed constraints in 12 ms returned sat
[2023-03-11 04:01:29] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 37 ms.
[2023-03-11 04:01:30] [INFO ] Added : 46 causal constraints over 10 iterations in 332 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 557/557 transitions.
Applied a total of 0 rules in 19 ms. Remains 135 /135 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 135/135 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 557/557 transitions.
Applied a total of 0 rules in 17 ms. Remains 135 /135 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2023-03-11 04:01:30] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
[2023-03-11 04:01:30] [INFO ] Invariant cache hit.
[2023-03-11 04:01:30] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-11 04:01:30] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
[2023-03-11 04:01:30] [INFO ] Invariant cache hit.
[2023-03-11 04:01:30] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:31] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2023-03-11 04:01:31] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-11 04:01:31] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
[2023-03-11 04:01:31] [INFO ] Invariant cache hit.
[2023-03-11 04:01:31] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1284 ms. Remains : 135/135 places, 557/557 transitions.
Starting property specific reduction for CloudDeployment-PT-6b-UpperBounds-08
Normalized transition count is 275 out of 557 initially.
// Phase 1: matrix 275 rows 135 cols
[2023-03-11 04:01:31] [INFO ] Computed 24 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 127 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-11 04:01:31] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
// Phase 1: matrix 275 rows 135 cols
[2023-03-11 04:01:31] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-11 04:01:31] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-11 04:01:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:31] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-11 04:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:31] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-11 04:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:32] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2023-03-11 04:01:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:32] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-11 04:01:32] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 33 ms.
[2023-03-11 04:01:32] [INFO ] Added : 46 causal constraints over 10 iterations in 310 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 557/557 transitions.
Graph (complete) has 1063 edges and 135 vertex of which 133 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 133 transition count 523
Applied a total of 35 rules in 13 ms. Remains 133 /135 variables (removed 2) and now considering 523/557 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 133/135 places, 523/557 transitions.
Normalized transition count is 241 out of 523 initially.
// Phase 1: matrix 241 rows 133 cols
[2023-03-11 04:01:32] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 12186 resets, run finished after 2719 ms. (steps per millisecond=367 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1615 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 1) seen :0
[2023-03-11 04:01:35] [INFO ] Flow matrix only has 241 transitions (discarded 282 similar events)
// Phase 1: matrix 241 rows 133 cols
[2023-03-11 04:01:35] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-11 04:01:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-11 04:01:35] [INFO ] [Real]Absence check using 5 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-11 04:01:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:36] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-11 04:01:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-11 04:01:36] [INFO ] [Nat]Absence check using 5 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-11 04:01:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:36] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-11 04:01:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:36] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-11 04:01:36] [INFO ] Computed and/alt/rep : 174/604/174 causal constraints (skipped 31 transitions) in 22 ms.
[2023-03-11 04:01:36] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 8 ms to minimize.
[2023-03-11 04:01:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2023-03-11 04:01:36] [INFO ] Added : 47 causal constraints over 11 iterations in 402 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 523/523 transitions.
Applied a total of 0 rules in 17 ms. Remains 133 /133 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 133/133 places, 523/523 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 523/523 transitions.
Applied a total of 0 rules in 16 ms. Remains 133 /133 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2023-03-11 04:01:36] [INFO ] Flow matrix only has 241 transitions (discarded 282 similar events)
[2023-03-11 04:01:36] [INFO ] Invariant cache hit.
[2023-03-11 04:01:36] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-11 04:01:36] [INFO ] Flow matrix only has 241 transitions (discarded 282 similar events)
[2023-03-11 04:01:36] [INFO ] Invariant cache hit.
[2023-03-11 04:01:37] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:37] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-11 04:01:37] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-11 04:01:37] [INFO ] Flow matrix only has 241 transitions (discarded 282 similar events)
[2023-03-11 04:01:37] [INFO ] Invariant cache hit.
[2023-03-11 04:01:38] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1279 ms. Remains : 133/133 places, 523/523 transitions.
Ending property specific reduction for CloudDeployment-PT-6b-UpperBounds-08 in 6345 ms.
Starting property specific reduction for CloudDeployment-PT-6b-UpperBounds-12
Normalized transition count is 275 out of 557 initially.
// Phase 1: matrix 275 rows 135 cols
[2023-03-11 04:01:38] [INFO ] Computed 24 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 128 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-11 04:01:38] [INFO ] Flow matrix only has 275 transitions (discarded 282 similar events)
// Phase 1: matrix 275 rows 135 cols
[2023-03-11 04:01:38] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-11 04:01:38] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-11 04:01:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:38] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-11 04:01:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:38] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-11 04:01:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:38] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-11 04:01:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:38] [INFO ] [Nat]Added 8 Read/Feed constraints in 7 ms returned sat
[2023-03-11 04:01:38] [INFO ] Computed and/alt/rep : 175/605/175 causal constraints (skipped 64 transitions) in 23 ms.
[2023-03-11 04:01:38] [INFO ] Added : 46 causal constraints over 10 iterations in 223 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 557/557 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 0 with 1 rules applied. Total rules applied 1 place count 135 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 134 transition count 556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 133 transition count 555
Applied a total of 4 rules in 18 ms. Remains 133 /135 variables (removed 2) and now considering 555/557 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 133/135 places, 555/557 transitions.
Normalized transition count is 273 out of 555 initially.
// Phase 1: matrix 273 rows 133 cols
[2023-03-11 04:01:38] [INFO ] Computed 24 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 12783 resets, run finished after 2640 ms. (steps per millisecond=378 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1684 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 1) seen :0
[2023-03-11 04:01:42] [INFO ] Flow matrix only has 273 transitions (discarded 282 similar events)
// Phase 1: matrix 273 rows 133 cols
[2023-03-11 04:01:42] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-11 04:01:42] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-11 04:01:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:42] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-11 04:01:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 04:01:42] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-11 04:01:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 04:01:42] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-11 04:01:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-11 04:01:42] [INFO ] Computed and/alt/rep : 177/638/177 causal constraints (skipped 60 transitions) in 22 ms.
[2023-03-11 04:01:42] [INFO ] Added : 54 causal constraints over 11 iterations in 229 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 555/555 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 133/133 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 555/555 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-11 04:01:42] [INFO ] Flow matrix only has 273 transitions (discarded 282 similar events)
[2023-03-11 04:01:42] [INFO ] Invariant cache hit.
[2023-03-11 04:01:42] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-11 04:01:42] [INFO ] Flow matrix only has 273 transitions (discarded 282 similar events)
[2023-03-11 04:01:42] [INFO ] Invariant cache hit.
[2023-03-11 04:01:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-11 04:01:43] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 657 ms to find 0 implicit places.
[2023-03-11 04:01:43] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-11 04:01:43] [INFO ] Flow matrix only has 273 transitions (discarded 282 similar events)
[2023-03-11 04:01:43] [INFO ] Invariant cache hit.
[2023-03-11 04:01:43] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1195 ms. Remains : 133/133 places, 555/555 transitions.
Ending property specific reduction for CloudDeployment-PT-6b-UpperBounds-12 in 5862 ms.
[2023-03-11 04:01:44] [INFO ] Flatten gal took : 205 ms
[2023-03-11 04:01:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-11 04:01:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 557 transitions and 4513 arcs took 11 ms.
Total runtime 112395 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: CloudDeployment_PT_6b
(NrP: 135 NrTr: 557 NrArc: 4513)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.018sec
net check time: 0m 0.001sec
init dd package: 0m 3.267sec
RS generation: 0m 2.814sec
-> reachability set: #nodes 10778 (1.1e+04) #states 168,824,812 (8)
starting MCC model checker
--------------------------
checking: place_bound(p79)
normalized: place_bound(p79)
-> the formula is 1
FORMULA CloudDeployment-PT-6b-UpperBounds-08 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(p62)
normalized: place_bound(p62)
-> the formula is 1
FORMULA CloudDeployment-PT-6b-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 152462 (1.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1933354 8133435 10066789
used/not used/entry size/cache size: 7605974 59502890 16 1024MB
basic ops cache: hits/miss/sum: 572 9922 10494
used/not used/entry size/cache size: 28752 16748464 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 3150 10778 13928
used/not used/entry size/cache size: 10777 8377831 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66961490
1 142481
2 4698
3 195
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 7.873sec
BK_STOP 1678507313357
--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.001sec
iterations count:36924 (66), effective:800 (1)
initing FirstDep: 0m 0.001sec
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="CloudDeployment-PT-6b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is CloudDeployment-PT-6b, 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 r074-smll-167814400300437"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-6b.tgz
mv CloudDeployment-PT-6b 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 ;