About the Execution of Marcie+red for MultiCrashLeafsetExtension-PT-S16C08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5629.752 | 3600000.00 | 3660085.00 | 8903.40 | 1 1 1 1 1 1 1 1 1 1 1 1 1 ? 1 0 | 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.r234-tall-167856420800797.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 MultiCrashLeafsetExtension-PT-S16C08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420800797
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 15K Feb 26 03:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 03:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 26 03:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 03:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 26 03:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 26 03:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 6.3M 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 MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679600045906
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=MultiCrashLeafsetExtension-PT-S16C08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 19:34:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 19:34:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 19:34:07] [INFO ] Load time of PNML (sax parser for PT used): 302 ms
[2023-03-23 19:34:07] [INFO ] Transformed 6876 places.
[2023-03-23 19:34:07] [INFO ] Transformed 9571 transitions.
[2023-03-23 19:34:07] [INFO ] Parsed PT model containing 6876 places and 9571 transitions and 35518 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 9299 out of 9571 initially.
// Phase 1: matrix 9299 rows 6876 cols
[2023-03-23 19:34:08] [INFO ] Computed 649 place invariants in 562 ms
Incomplete random walk after 10000 steps, including 120 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 16) seen :9
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :3
[2023-03-23 19:34:09] [INFO ] Flow matrix only has 9299 transitions (discarded 272 similar events)
// Phase 1: matrix 9299 rows 6876 cols
[2023-03-23 19:34:09] [INFO ] Computed 649 place invariants in 313 ms
[2023-03-23 19:34:10] [INFO ] [Real]Absence check using 54 positive place invariants in 96 ms returned sat
[2023-03-23 19:34:10] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 242 ms returned unsat
[2023-03-23 19:34:11] [INFO ] [Real]Absence check using 54 positive place invariants in 81 ms returned sat
[2023-03-23 19:34:11] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 208 ms returned unsat
[2023-03-23 19:34:12] [INFO ] [Real]Absence check using 54 positive place invariants in 80 ms returned sat
[2023-03-23 19:34:12] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 214 ms returned unsat
[2023-03-23 19:34:13] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2023-03-23 19:34:13] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 218 ms returned unsat
[2023-03-23 19:34:14] [INFO ] [Real]Absence check using 54 positive place invariants in 82 ms returned sat
[2023-03-23 19:34:14] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 245 ms returned sat
[2023-03-23 19:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:34:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
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-23 19:34:19] [INFO ] [Real]Absence check using 54 positive place invariants in 76 ms returned sat
[2023-03-23 19:34:19] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 247 ms returned sat
[2023-03-23 19:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:34:23] [INFO ] [Real]Absence check using state equation in 3985 ms returned unknown
[2023-03-23 19:34:24] [INFO ] [Real]Absence check using 54 positive place invariants in 85 ms returned sat
[2023-03-23 19:34:24] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 225 ms returned unsat
[2023-03-23 19:34:24] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2023-03-23 19:34:25] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 216 ms returned unsat
[2023-03-23 19:34:25] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2023-03-23 19:34:26] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 211 ms returned unsat
[2023-03-23 19:34:26] [INFO ] [Real]Absence check using 54 positive place invariants in 74 ms returned sat
[2023-03-23 19:34:26] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 232 ms returned unsat
[2023-03-23 19:34:27] [INFO ] [Real]Absence check using 54 positive place invariants in 77 ms returned sat
[2023-03-23 19:34:27] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 243 ms returned sat
[2023-03-23 19:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:34:31] [INFO ] [Real]Absence check using state equation in 4102 ms returned unknown
[2023-03-23 19:34:32] [INFO ] [Real]Absence check using 54 positive place invariants in 80 ms returned sat
[2023-03-23 19:34:32] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 208 ms returned unsat
[2023-03-23 19:34:33] [INFO ] [Real]Absence check using 54 positive place invariants in 77 ms returned sat
[2023-03-23 19:34:33] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 233 ms returned sat
[2023-03-23 19:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:34:37] [INFO ] [Real]Absence check using state equation in 4154 ms returned unknown
[2023-03-23 19:34:38] [INFO ] [Real]Absence check using 54 positive place invariants in 75 ms returned sat
[2023-03-23 19:34:38] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 214 ms returned unsat
[2023-03-23 19:34:39] [INFO ] [Real]Absence check using 54 positive place invariants in 75 ms returned sat
[2023-03-23 19:34:39] [INFO ] [Real]Absence check using 54 positive and 595 generalized place invariants in 232 ms returned sat
[2023-03-23 19:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:34:43] [INFO ] [Real]Absence check using state equation in 4159 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 51, 1, 1, 1, 1, 17, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 6876 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6876/6876 places, 9571/9571 transitions.
Graph (complete) has 21033 edges and 6876 vertex of which 6840 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.23 ms
Discarding 36 places :
Also discarding 0 output transitions
Drop transitions removed 2174 transitions
Trivial Post-agglo rules discarded 2174 transitions
Performed 2174 trivial Post agglomeration. Transition count delta: 2174
Iterating post reduction 0 with 2174 rules applied. Total rules applied 2175 place count 6840 transition count 7397
Reduce places removed 2174 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2175 rules applied. Total rules applied 4350 place count 4666 transition count 7396
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4351 place count 4665 transition count 7396
Performed 272 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 272 Pre rules applied. Total rules applied 4351 place count 4665 transition count 7124
Deduced a syphon composed of 272 places in 14 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 3 with 544 rules applied. Total rules applied 4895 place count 4393 transition count 7124
Discarding 1902 places :
Symmetric choice reduction at 3 with 1902 rule applications. Total rules 6797 place count 2491 transition count 5222
Iterating global reduction 3 with 1902 rules applied. Total rules applied 8699 place count 2491 transition count 5222
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 8699 place count 2491 transition count 5208
Deduced a syphon composed of 14 places in 8 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 8727 place count 2477 transition count 5208
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 8963 place count 2241 transition count 3320
Iterating global reduction 3 with 236 rules applied. Total rules applied 9199 place count 2241 transition count 3320
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 6 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 9233 place count 2224 transition count 3303
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 9394 place count 2224 transition count 4794
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 9555 place count 2063 transition count 4794
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 9589 place count 2063 transition count 4794
Applied a total of 9589 rules in 1960 ms. Remains 2063 /6876 variables (removed 4813) and now considering 4794/9571 (removed 4777) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1961 ms. Remains : 2063/6876 places, 4794/9571 transitions.
Normalized transition count is 4397 out of 4794 initially.
// Phase 1: matrix 4397 rows 2063 cols
[2023-03-23 19:34:45] [INFO ] Computed 613 place invariants in 109 ms
Incomplete random walk after 1000000 steps, including 20076 resets, run finished after 20573 ms. (steps per millisecond=48 ) properties (out of 5) seen :3
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 3879 resets, run finished after 4580 ms. (steps per millisecond=218 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4574 ms. (steps per millisecond=218 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4526 ms. (steps per millisecond=220 ) properties (out of 3) seen :1
[2023-03-23 19:35:20] [INFO ] Flow matrix only has 4397 transitions (discarded 397 similar events)
// Phase 1: matrix 4397 rows 2063 cols
[2023-03-23 19:35:20] [INFO ] Computed 613 place invariants in 103 ms
[2023-03-23 19:35:20] [INFO ] [Real]Absence check using 33 positive place invariants in 41 ms returned sat
[2023-03-23 19:35:20] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 47 ms returned unsat
[2023-03-23 19:35:20] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-23 19:35:20] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 107 ms returned sat
[2023-03-23 19:35:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:35:22] [INFO ] [Real]Absence check using state equation in 1303 ms returned sat
[2023-03-23 19:35:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:35:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2023-03-23 19:35:22] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 106 ms returned sat
[2023-03-23 19:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:35:23] [INFO ] [Nat]Absence check using state equation in 1345 ms returned sat
[2023-03-23 19:35:23] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-23 19:35:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 19:35:29] [INFO ] [Nat]Added 2722 Read/Feed constraints in 5600 ms returned sat
[2023-03-23 19:35:31] [INFO ] Deduced a trap composed of 362 places in 1660 ms of which 7 ms to minimize.
[2023-03-23 19:35:33] [INFO ] Deduced a trap composed of 255 places in 1772 ms of which 4 ms to minimize.
[2023-03-23 19:35:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3837 ms
[2023-03-23 19:35:33] [INFO ] Computed and/alt/rep : 1681/4436/1681 causal constraints (skipped 2699 transitions) in 416 ms.
[2023-03-23 19:35:36] [INFO ] Deduced a trap composed of 297 places in 1797 ms of which 5 ms to minimize.
[2023-03-23 19:35:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2076 ms
[2023-03-23 19:35:37] [INFO ] Added : 25 causal constraints over 5 iterations in 3981 ms. Result :sat
[2023-03-23 19:35:37] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-23 19:35:37] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 102 ms returned sat
[2023-03-23 19:35:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:35:39] [INFO ] [Real]Absence check using state equation in 1464 ms returned sat
[2023-03-23 19:35:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:35:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2023-03-23 19:35:39] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 107 ms returned sat
[2023-03-23 19:35:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:35:41] [INFO ] [Nat]Absence check using state equation in 1380 ms returned sat
[2023-03-23 19:35:42] [INFO ] [Nat]Added 2722 Read/Feed constraints in 1275 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 0] Max seen :[1, 0, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 2063 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2063/2063 places, 4794/4794 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 2063 transition count 4793
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2062 transition count 4793
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2062 transition count 4791
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 2060 transition count 4791
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 8 place count 2058 transition count 4789
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 2058 transition count 4789
Applied a total of 10 rules in 404 ms. Remains 2058 /2063 variables (removed 5) and now considering 4789/4794 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 2058/2063 places, 4789/4794 transitions.
Normalized transition count is 4392 out of 4789 initially.
// Phase 1: matrix 4392 rows 2058 cols
[2023-03-23 19:35:43] [INFO ] Computed 613 place invariants in 67 ms
Incomplete random walk after 1000000 steps, including 20079 resets, run finished after 20075 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 4577 ms. (steps per millisecond=218 ) properties (out of 1) seen :0
[2023-03-23 19:36:07] [INFO ] Flow matrix only has 4392 transitions (discarded 397 similar events)
// Phase 1: matrix 4392 rows 2058 cols
[2023-03-23 19:36:07] [INFO ] Computed 613 place invariants in 68 ms
[2023-03-23 19:36:08] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2023-03-23 19:36:08] [INFO ] [Real]Absence check using 33 positive and 580 generalized place invariants in 107 ms returned sat
[2023-03-23 19:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:36:09] [INFO ] [Real]Absence check using state equation in 1354 ms returned sat
[2023-03-23 19:36:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:36:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 47 ms returned sat
[2023-03-23 19:36:09] [INFO ] [Nat]Absence check using 33 positive and 580 generalized place invariants in 100 ms returned sat
[2023-03-23 19:36:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:36:11] [INFO ] [Nat]Absence check using state equation in 1298 ms returned sat
[2023-03-23 19:36:11] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-23 19:36:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 19:36:16] [INFO ] [Nat]Added 2722 Read/Feed constraints in 4849 ms returned sat
[2023-03-23 19:36:17] [INFO ] Deduced a trap composed of 387 places in 1581 ms of which 3 ms to minimize.
[2023-03-23 19:36:20] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 4690 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 2058 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2058/2058 places, 4789/4789 transitions.
Applied a total of 0 rules in 154 ms. Remains 2058 /2058 variables (removed 0) and now considering 4789/4789 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 2058/2058 places, 4789/4789 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2058/2058 places, 4789/4789 transitions.
Applied a total of 0 rules in 157 ms. Remains 2058 /2058 variables (removed 0) and now considering 4789/4789 (removed 0) transitions.
[2023-03-23 19:36:21] [INFO ] Flow matrix only has 4392 transitions (discarded 397 similar events)
[2023-03-23 19:36:21] [INFO ] Invariant cache hit.
[2023-03-23 19:36:26] [INFO ] Implicit Places using invariants in 5047 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 27, 35, 45, 57, 71, 86, 100, 101, 102, 103, 104, 105, 106, 107, 108, 120, 130, 138, 144, 148, 150, 169, 175, 177, 178, 179, 180, 181, 182, 183, 184, 185, 187, 191, 197, 205, 215, 227, 240, 252, 253, 254, 255, 256, 257, 258, 259, 260, 270, 278, 284, 288, 290, 292, 311, 317, 319, 320, 321, 322, 323, 324, 325, 326, 327, 329, 331, 335, 341, 349, 359, 370, 380, 381, 382, 383, 384, 385, 386, 387, 388, 396, 402, 406, 408, 410, 412, 431, 437, 439, 440, 441, 442, 443, 444, 445, 446, 447, 449, 451, 453, 457, 463, 471, 480, 488, 489, 490, 491, 492, 493, 494, 495, 496, 502, 506, 508, 510, 512, 514, 533, 539, 541, 542, 543, 544, 545, 546, 547, 548, 549, 551, 553, 555, 557, 561, 567, 574, 580, 581, 582, 583, 584, 585, 586, 587, 588, 592, 594, 596, 598, 600, 602, 621, 627, 629, 630, 631, 632, 633, 634, 635, 636, 637, 639, 641, 643, 645, 647, 651, 656, 660, 661, 662, 663, 664, 665, 666, 667, 668, 670, 672, 674, 676, 678, 680, 699, 705, 707, 708, 709, 710, 711, 712, 713, 714, 715, 717, 719, 721, 723, 725, 727, 730, 732, 733, 734, 735, 736, 737, 738, 739, 740, 742, 744, 746, 748, 750, 752, 771, 777, 779, 780, 781, 782, 783, 784, 785, 786, 787, 789, 791, 793, 795, 797, 799, 801, 803, 804, 805, 806, 807, 808, 809, 810, 811, 813, 815, 817, 819, 821, 823, 842, 844, 847, 849, 850, 851, 852, 853, 854, 855, 856, 857, 859, 861, 863, 865, 867, 869, 871, 873, 874, 875, 876, 877, 878, 879, 880, 881, 883, 885, 887, 889, 891, 893, 912, 918, 920, 921, 922, 923, 924, 925, 926, 927, 928, 930, 932, 934, 936, 938, 940, 942, 944, 945, 946, 947, 948, 949, 950, 951, 952, 954, 956, 958, 960, 962, 964, 983, 989, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1001, 1003, 1005, 1007, 1009, 1011, 1013, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1026, 1028, 1030, 1032, 1034, 1036, 1055, 1061, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1073, 1075, 1077, 1079, 1081, 1083, 1087, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1104, 1106, 1108, 1110, 1112, 1114, 1133, 1139, 1141, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1151, 1153, 1155, 1157, 1159, 1163, 1169, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1190, 1194, 1196, 1198, 1200, 1202, 1221, 1227, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1239, 1241, 1243, 1245, 1249, 1255, 1263, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1288, 1294, 1298, 1301, 1303, 1305, 1324, 1330, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1342, 1344, 1346, 1350, 1356, 1364, 1374, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1403, 1411, 1417, 1421, 1423, 1425, 1444, 1450, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1462, 1464, 1468, 1474, 1482, 1492, 1504, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1537, 1547, 1555, 1561, 1565, 1567, 1586, 1588, 1591, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1603, 1607, 1613, 1621, 1631, 1643, 1657, 1672, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1694, 1706, 1716, 1724, 1730, 1734, 1753]
Discarding 564 places :
Implicit Place search using SMT only with invariants took 5068 ms to find 564 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1494/2058 places, 4789/4789 transitions.
Discarding 256 places :
Symmetric choice reduction at 0 with 256 rule applications. Total rules 256 place count 1238 transition count 4533
Iterating global reduction 0 with 256 rules applied. Total rules applied 512 place count 1238 transition count 4533
Discarding 256 places :
Symmetric choice reduction at 0 with 256 rule applications. Total rules 768 place count 982 transition count 4277
Iterating global reduction 0 with 256 rules applied. Total rules applied 1024 place count 982 transition count 4277
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 1027 place count 982 transition count 4274
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1030 place count 979 transition count 4274
Applied a total of 1030 rules in 303 ms. Remains 979 /1494 variables (removed 515) and now considering 4274/4789 (removed 515) transitions.
[2023-03-23 19:36:26] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-23 19:36:26] [INFO ] Computed 49 place invariants in 27 ms
[2023-03-23 19:36:27] [INFO ] Implicit Places using invariants in 1144 ms returned []
[2023-03-23 19:36:27] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-23 19:36:27] [INFO ] Invariant cache hit.
[2023-03-23 19:36:28] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-23 19:36:51] [INFO ] Implicit Places using invariants and state equation in 23854 ms returned []
Implicit Place search using SMT with State Equation took 24999 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 979/2058 places, 4274/4789 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30530 ms. Remains : 979/2058 places, 4274/4789 transitions.
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-23 19:36:51] [INFO ] Computed 49 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 21029 resets, run finished after 19435 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3013 resets, run finished after 3451 ms. (steps per millisecond=289 ) properties (out of 1) seen :0
[2023-03-23 19:37:14] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-23 19:37:14] [INFO ] Computed 49 place invariants in 30 ms
[2023-03-23 19:37:14] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 19:37:14] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-23 19:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:37:15] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2023-03-23 19:37:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:37:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 19:37:15] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-23 19:37:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:37:16] [INFO ] [Nat]Absence check using state equation in 818 ms returned sat
[2023-03-23 19:37:16] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-23 19:37:18] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2118 ms returned sat
[2023-03-23 19:37:19] [INFO ] Deduced a trap composed of 276 places in 461 ms of which 1 ms to minimize.
[2023-03-23 19:37:19] [INFO ] Deduced a trap composed of 82 places in 541 ms of which 1 ms to minimize.
[2023-03-23 19:37:20] [INFO ] Deduced a trap composed of 97 places in 542 ms of which 0 ms to minimize.
[2023-03-23 19:37:21] [INFO ] Deduced a trap composed of 91 places in 546 ms of which 0 ms to minimize.
[2023-03-23 19:37:22] [INFO ] Deduced a trap composed of 91 places in 551 ms of which 1 ms to minimize.
[2023-03-23 19:37:23] [INFO ] Deduced a trap composed of 121 places in 558 ms of which 1 ms to minimize.
[2023-03-23 19:37:24] [INFO ] Deduced a trap composed of 129 places in 530 ms of which 1 ms to minimize.
[2023-03-23 19:37:24] [INFO ] Deduced a trap composed of 121 places in 582 ms of which 3 ms to minimize.
[2023-03-23 19:37:25] [INFO ] Deduced a trap composed of 103 places in 575 ms of which 1 ms to minimize.
[2023-03-23 19:37:26] [INFO ] Deduced a trap composed of 92 places in 575 ms of which 1 ms to minimize.
[2023-03-23 19:37:27] [INFO ] Deduced a trap composed of 104 places in 601 ms of which 1 ms to minimize.
[2023-03-23 19:37:27] [INFO ] Deduced a trap composed of 97 places in 611 ms of which 1 ms to minimize.
[2023-03-23 19:37:28] [INFO ] Deduced a trap composed of 101 places in 598 ms of which 1 ms to minimize.
[2023-03-23 19:37:29] [INFO ] Deduced a trap composed of 112 places in 607 ms of which 1 ms to minimize.
[2023-03-23 19:37:30] [INFO ] Deduced a trap composed of 108 places in 591 ms of which 0 ms to minimize.
[2023-03-23 19:37:31] [INFO ] Deduced a trap composed of 276 places in 484 ms of which 1 ms to minimize.
[2023-03-23 19:37:31] [INFO ] Deduced a trap composed of 359 places in 572 ms of which 1 ms to minimize.
[2023-03-23 19:37:32] [INFO ] Deduced a trap composed of 82 places in 574 ms of which 3 ms to minimize.
[2023-03-23 19:37:33] [INFO ] Deduced a trap composed of 87 places in 578 ms of which 1 ms to minimize.
[2023-03-23 19:37:34] [INFO ] Deduced a trap composed of 222 places in 444 ms of which 1 ms to minimize.
[2023-03-23 19:37:34] [INFO ] Deduced a trap composed of 97 places in 548 ms of which 1 ms to minimize.
[2023-03-23 19:37:35] [INFO ] Deduced a trap composed of 96 places in 607 ms of which 1 ms to minimize.
[2023-03-23 19:37:36] [INFO ] Deduced a trap composed of 82 places in 608 ms of which 1 ms to minimize.
[2023-03-23 19:37:37] [INFO ] Deduced a trap composed of 97 places in 616 ms of which 1 ms to minimize.
[2023-03-23 19:37:38] [INFO ] Deduced a trap composed of 83 places in 615 ms of which 1 ms to minimize.
[2023-03-23 19:37:39] [INFO ] Deduced a trap composed of 87 places in 623 ms of which 1 ms to minimize.
[2023-03-23 19:37:40] [INFO ] Deduced a trap composed of 85 places in 605 ms of which 1 ms to minimize.
[2023-03-23 19:37:40] [INFO ] Deduced a trap composed of 199 places in 510 ms of which 1 ms to minimize.
[2023-03-23 19:37:41] [INFO ] Deduced a trap composed of 96 places in 553 ms of which 1 ms to minimize.
[2023-03-23 19:37:42] [INFO ] Deduced a trap composed of 94 places in 610 ms of which 1 ms to minimize.
[2023-03-23 19:37:43] [INFO ] Deduced a trap composed of 87 places in 616 ms of which 1 ms to minimize.
[2023-03-23 19:37:44] [INFO ] Deduced a trap composed of 84 places in 616 ms of which 1 ms to minimize.
[2023-03-23 19:37:44] [INFO ] Deduced a trap composed of 95 places in 560 ms of which 1 ms to minimize.
[2023-03-23 19:37:45] [INFO ] Deduced a trap composed of 82 places in 614 ms of which 1 ms to minimize.
[2023-03-23 19:37:46] [INFO ] Deduced a trap composed of 85 places in 582 ms of which 1 ms to minimize.
[2023-03-23 19:37:47] [INFO ] Deduced a trap composed of 108 places in 552 ms of which 1 ms to minimize.
[2023-03-23 19:37:49] [INFO ] Deduced a trap composed of 92 places in 565 ms of which 0 ms to minimize.
[2023-03-23 19:37:50] [INFO ] Deduced a trap composed of 101 places in 550 ms of which 1 ms to minimize.
[2023-03-23 19:37:50] [INFO ] Deduced a trap composed of 97 places in 554 ms of which 1 ms to minimize.
[2023-03-23 19:37:51] [INFO ] Deduced a trap composed of 88 places in 533 ms of which 1 ms to minimize.
[2023-03-23 19:37:52] [INFO ] Deduced a trap composed of 84 places in 530 ms of which 0 ms to minimize.
[2023-03-23 19:37:52] [INFO ] Deduced a trap composed of 95 places in 535 ms of which 1 ms to minimize.
[2023-03-23 19:37:53] [INFO ] Deduced a trap composed of 83 places in 546 ms of which 1 ms to minimize.
[2023-03-23 19:37:54] [INFO ] Deduced a trap composed of 286 places in 456 ms of which 1 ms to minimize.
[2023-03-23 19:37:54] [INFO ] Deduced a trap composed of 99 places in 547 ms of which 1 ms to minimize.
[2023-03-23 19:37:55] [INFO ] Deduced a trap composed of 88 places in 538 ms of which 1 ms to minimize.
[2023-03-23 19:37:56] [INFO ] Deduced a trap composed of 293 places in 516 ms of which 3 ms to minimize.
[2023-03-23 19:37:56] [INFO ] Deduced a trap composed of 103 places in 551 ms of which 1 ms to minimize.
[2023-03-23 19:37:57] [INFO ] Deduced a trap composed of 110 places in 543 ms of which 1 ms to minimize.
[2023-03-23 19:37:58] [INFO ] Deduced a trap composed of 95 places in 545 ms of which 1 ms to minimize.
[2023-03-23 19:37:58] [INFO ] Deduced a trap composed of 108 places in 542 ms of which 1 ms to minimize.
[2023-03-23 19:37:59] [INFO ] Deduced a trap composed of 91 places in 515 ms of which 1 ms to minimize.
[2023-03-23 19:38:00] [INFO ] Deduced a trap composed of 86 places in 543 ms of which 0 ms to minimize.
[2023-03-23 19:38:00] [INFO ] Deduced a trap composed of 70 places in 519 ms of which 1 ms to minimize.
[2023-03-23 19:38:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 120 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 109 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2023-03-23 19:38:00] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-23 19:38:00] [INFO ] Invariant cache hit.
[2023-03-23 19:38:02] [INFO ] Implicit Places using invariants in 1173 ms returned []
[2023-03-23 19:38:02] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-23 19:38:02] [INFO ] Invariant cache hit.
[2023-03-23 19:38:03] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-23 19:38:25] [INFO ] Implicit Places using invariants and state equation in 22965 ms returned []
Implicit Place search using SMT with State Equation took 24140 ms to find 0 implicit places.
[2023-03-23 19:38:25] [INFO ] Redundant transitions in 308 ms returned []
[2023-03-23 19:38:25] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-23 19:38:25] [INFO ] Invariant cache hit.
[2023-03-23 19:38:26] [INFO ] Dead Transitions using invariants and state equation in 1420 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25988 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-23 19:38:26] [INFO ] Computed 49 place invariants in 25 ms
Incomplete random walk after 10000 steps, including 210 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
[2023-03-23 19:38:27] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-23 19:38:27] [INFO ] Computed 49 place invariants in 25 ms
[2023-03-23 19:38:27] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 19:38:27] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 3 ms returned sat
[2023-03-23 19:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:38:28] [INFO ] [Real]Absence check using state equation in 870 ms returned sat
[2023-03-23 19:38:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:38:28] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2023-03-23 19:38:28] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-23 19:38:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:38:29] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2023-03-23 19:38:29] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-23 19:38:31] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2106 ms returned sat
[2023-03-23 19:38:31] [INFO ] Deduced a trap composed of 276 places in 431 ms of which 1 ms to minimize.
[2023-03-23 19:38:32] [INFO ] Deduced a trap composed of 82 places in 550 ms of which 1 ms to minimize.
[2023-03-23 19:38:33] [INFO ] Deduced a trap composed of 97 places in 543 ms of which 1 ms to minimize.
[2023-03-23 19:38:33] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 1925 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 110 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 979/979 places, 4274/4274 transitions.
Normalized transition count is 3877 out of 4274 initially.
// Phase 1: matrix 3877 rows 979 cols
[2023-03-23 19:38:33] [INFO ] Computed 49 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 21029 resets, run finished after 19429 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3012 resets, run finished after 3430 ms. (steps per millisecond=291 ) properties (out of 1) seen :0
[2023-03-23 19:38:56] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
// Phase 1: matrix 3877 rows 979 cols
[2023-03-23 19:38:56] [INFO ] Computed 49 place invariants in 26 ms
[2023-03-23 19:38:56] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 19:38:56] [INFO ] [Real]Absence check using 31 positive and 18 generalized place invariants in 4 ms returned sat
[2023-03-23 19:38:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 19:38:57] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2023-03-23 19:38:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 19:38:57] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2023-03-23 19:38:57] [INFO ] [Nat]Absence check using 31 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-23 19:38:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 19:38:58] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2023-03-23 19:38:58] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-23 19:39:00] [INFO ] [Nat]Added 2722 Read/Feed constraints in 2141 ms returned sat
[2023-03-23 19:39:01] [INFO ] Deduced a trap composed of 276 places in 466 ms of which 1 ms to minimize.
[2023-03-23 19:39:01] [INFO ] Deduced a trap composed of 82 places in 572 ms of which 1 ms to minimize.
[2023-03-23 19:39:02] [INFO ] Deduced a trap composed of 97 places in 525 ms of which 0 ms to minimize.
[2023-03-23 19:39:03] [INFO ] Deduced a trap composed of 91 places in 521 ms of which 1 ms to minimize.
[2023-03-23 19:39:04] [INFO ] Deduced a trap composed of 91 places in 519 ms of which 1 ms to minimize.
[2023-03-23 19:39:05] [INFO ] Deduced a trap composed of 121 places in 510 ms of which 2 ms to minimize.
[2023-03-23 19:39:05] [INFO ] Deduced a trap composed of 129 places in 556 ms of which 1 ms to minimize.
[2023-03-23 19:39:06] [INFO ] Deduced a trap composed of 121 places in 568 ms of which 1 ms to minimize.
[2023-03-23 19:39:07] [INFO ] Deduced a trap composed of 103 places in 537 ms of which 1 ms to minimize.
[2023-03-23 19:39:07] [INFO ] Deduced a trap composed of 92 places in 542 ms of which 1 ms to minimize.
[2023-03-23 19:39:08] [INFO ] Deduced a trap composed of 104 places in 510 ms of which 0 ms to minimize.
[2023-03-23 19:39:09] [INFO ] Deduced a trap composed of 97 places in 552 ms of which 1 ms to minimize.
[2023-03-23 19:39:09] [INFO ] Deduced a trap composed of 101 places in 521 ms of which 1 ms to minimize.
[2023-03-23 19:39:10] [INFO ] Deduced a trap composed of 112 places in 538 ms of which 1 ms to minimize.
[2023-03-23 19:39:11] [INFO ] Deduced a trap composed of 108 places in 551 ms of which 1 ms to minimize.
[2023-03-23 19:39:12] [INFO ] Deduced a trap composed of 276 places in 458 ms of which 0 ms to minimize.
[2023-03-23 19:39:13] [INFO ] Deduced a trap composed of 359 places in 546 ms of which 0 ms to minimize.
[2023-03-23 19:39:14] [INFO ] Deduced a trap composed of 82 places in 538 ms of which 1 ms to minimize.
[2023-03-23 19:39:14] [INFO ] Deduced a trap composed of 87 places in 548 ms of which 1 ms to minimize.
[2023-03-23 19:39:15] [INFO ] Deduced a trap composed of 222 places in 436 ms of which 1 ms to minimize.
[2023-03-23 19:39:15] [INFO ] Deduced a trap composed of 97 places in 546 ms of which 1 ms to minimize.
[2023-03-23 19:39:16] [INFO ] Deduced a trap composed of 96 places in 534 ms of which 1 ms to minimize.
[2023-03-23 19:39:17] [INFO ] Deduced a trap composed of 82 places in 549 ms of which 1 ms to minimize.
[2023-03-23 19:39:18] [INFO ] Deduced a trap composed of 97 places in 573 ms of which 0 ms to minimize.
[2023-03-23 19:39:19] [INFO ] Deduced a trap composed of 83 places in 541 ms of which 1 ms to minimize.
[2023-03-23 19:39:20] [INFO ] Deduced a trap composed of 87 places in 549 ms of which 1 ms to minimize.
[2023-03-23 19:39:20] [INFO ] Deduced a trap composed of 85 places in 512 ms of which 1 ms to minimize.
[2023-03-23 19:39:21] [INFO ] Deduced a trap composed of 199 places in 458 ms of which 0 ms to minimize.
[2023-03-23 19:39:22] [INFO ] Deduced a trap composed of 96 places in 550 ms of which 0 ms to minimize.
[2023-03-23 19:39:22] [INFO ] Deduced a trap composed of 94 places in 550 ms of which 0 ms to minimize.
[2023-03-23 19:39:24] [INFO ] Deduced a trap composed of 87 places in 559 ms of which 1 ms to minimize.
[2023-03-23 19:39:24] [INFO ] Deduced a trap composed of 84 places in 540 ms of which 1 ms to minimize.
[2023-03-23 19:39:25] [INFO ] Deduced a trap composed of 95 places in 522 ms of which 1 ms to minimize.
[2023-03-23 19:39:25] [INFO ] Deduced a trap composed of 82 places in 522 ms of which 0 ms to minimize.
[2023-03-23 19:39:26] [INFO ] Deduced a trap composed of 85 places in 550 ms of which 1 ms to minimize.
[2023-03-23 19:39:28] [INFO ] Deduced a trap composed of 108 places in 543 ms of which 1 ms to minimize.
[2023-03-23 19:39:29] [INFO ] Deduced a trap composed of 92 places in 552 ms of which 0 ms to minimize.
[2023-03-23 19:39:30] [INFO ] Deduced a trap composed of 101 places in 520 ms of which 0 ms to minimize.
[2023-03-23 19:39:31] [INFO ] Deduced a trap composed of 97 places in 531 ms of which 1 ms to minimize.
[2023-03-23 19:39:31] [INFO ] Deduced a trap composed of 88 places in 538 ms of which 1 ms to minimize.
[2023-03-23 19:39:32] [INFO ] Deduced a trap composed of 84 places in 555 ms of which 1 ms to minimize.
[2023-03-23 19:39:33] [INFO ] Deduced a trap composed of 95 places in 538 ms of which 1 ms to minimize.
[2023-03-23 19:39:33] [INFO ] Deduced a trap composed of 83 places in 545 ms of which 1 ms to minimize.
[2023-03-23 19:39:34] [INFO ] Deduced a trap composed of 286 places in 465 ms of which 0 ms to minimize.
[2023-03-23 19:39:35] [INFO ] Deduced a trap composed of 99 places in 531 ms of which 1 ms to minimize.
[2023-03-23 19:39:35] [INFO ] Deduced a trap composed of 88 places in 539 ms of which 1 ms to minimize.
[2023-03-23 19:39:36] [INFO ] Deduced a trap composed of 293 places in 507 ms of which 1 ms to minimize.
[2023-03-23 19:39:37] [INFO ] Deduced a trap composed of 103 places in 541 ms of which 1 ms to minimize.
[2023-03-23 19:39:37] [INFO ] Deduced a trap composed of 110 places in 536 ms of which 1 ms to minimize.
[2023-03-23 19:39:38] [INFO ] Deduced a trap composed of 95 places in 547 ms of which 1 ms to minimize.
[2023-03-23 19:39:39] [INFO ] Deduced a trap composed of 108 places in 547 ms of which 1 ms to minimize.
[2023-03-23 19:39:39] [INFO ] Deduced a trap composed of 91 places in 559 ms of which 1 ms to minimize.
[2023-03-23 19:39:40] [INFO ] Deduced a trap composed of 86 places in 542 ms of which 1 ms to minimize.
[2023-03-23 19:39:41] [INFO ] Deduced a trap composed of 70 places in 557 ms of which 1 ms to minimize.
[2023-03-23 19:39:41] [INFO ] Deduced a trap composed of 110 places in 537 ms of which 0 ms to minimize.
[2023-03-23 19:39:42] [INFO ] Trap strengthening (SAT) tested/added 55/55 trap constraints in 41890 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 979 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 118 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 979/979 places, 4274/4274 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 979/979 places, 4274/4274 transitions.
Applied a total of 0 rules in 109 ms. Remains 979 /979 variables (removed 0) and now considering 4274/4274 (removed 0) transitions.
[2023-03-23 19:39:42] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-23 19:39:42] [INFO ] Invariant cache hit.
[2023-03-23 19:39:43] [INFO ] Implicit Places using invariants in 1105 ms returned []
[2023-03-23 19:39:43] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-23 19:39:43] [INFO ] Invariant cache hit.
[2023-03-23 19:39:44] [INFO ] State equation strengthened by 2722 read => feed constraints.
[2023-03-23 19:40:06] [INFO ] Implicit Places using invariants and state equation in 22918 ms returned []
Implicit Place search using SMT with State Equation took 24025 ms to find 0 implicit places.
[2023-03-23 19:40:07] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-23 19:40:07] [INFO ] Flow matrix only has 3877 transitions (discarded 397 similar events)
[2023-03-23 19:40:07] [INFO ] Invariant cache hit.
[2023-03-23 19:40:08] [INFO ] Dead Transitions using invariants and state equation in 1420 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25725 ms. Remains : 979/979 places, 4274/4274 transitions.
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C08-UpperBounds-13 in 101613 ms.
[2023-03-23 19:40:09] [INFO ] Flatten gal took : 349 ms
[2023-03-23 19:40:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 19:40:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 979 places, 4274 transitions and 21307 arcs took 21 ms.
Total runtime 361790 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: gen
(NrP: 979 NrTr: 4274 NrArc: 21307)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.603sec
net check time: 0m 0.007sec
init dd package: 0m 2.713sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10507576 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16090168 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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.056sec
32039 63284 101145 128156 214922 300461 407331 466092 736628
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="MultiCrashLeafsetExtension-PT-S16C08"
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 MultiCrashLeafsetExtension-PT-S16C08, 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 r234-tall-167856420800797"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C08.tgz
mv MultiCrashLeafsetExtension-PT-S16C08 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 ;