About the Execution of Marcie+red for PolyORBLF-PT-S02J06T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8189.703 | 1209834.00 | 1236994.00 | 2884.30 | 2 1 2 1 10 1 1 1 1 1 2 1 2 1 2 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r298-tall-167873951800517.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 PolyORBLF-PT-S02J06T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951800517
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 19K Feb 26 14:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 14:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Feb 26 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 112K Feb 26 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 42K Feb 26 14:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 232K Feb 26 14:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 14:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Feb 26 14:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 601K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679573086970
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=PolyORBLF-PT-S02J06T06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 12:04:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 12:04:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:04:48] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-23 12:04:48] [INFO ] Transformed 536 places.
[2023-03-23 12:04:48] [INFO ] Transformed 1064 transitions.
[2023-03-23 12:04:48] [INFO ] Parsed PT model containing 536 places and 1064 transitions and 4866 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Normalized transition count is 956 out of 968 initially.
// Phase 1: matrix 956 rows 536 cols
[2023-03-23 12:04:48] [INFO ] Computed 50 place invariants in 74 ms
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 3 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 15) seen :29
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :15
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :14
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :16
[2023-03-23 12:04:49] [INFO ] Flow matrix only has 956 transitions (discarded 12 similar events)
// Phase 1: matrix 956 rows 536 cols
[2023-03-23 12:04:49] [INFO ] Computed 50 place invariants in 34 ms
[2023-03-23 12:04:49] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-03-23 12:04:49] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 26 ms returned sat
[2023-03-23 12:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:04:49] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2023-03-23 12:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:04:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:04:49] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned unsat
[2023-03-23 12:04:49] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-23 12:04:49] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned unsat
[2023-03-23 12:04:49] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-23 12:04:49] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned unsat
[2023-03-23 12:04:50] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned unsat
[2023-03-23 12:04:50] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 12:04:50] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned unsat
[2023-03-23 12:04:50] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-23 12:04:50] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 8 ms returned unsat
[2023-03-23 12:04:50] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:04:50] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned unsat
[2023-03-23 12:04:50] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:04:50] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 17 ms returned sat
[2023-03-23 12:04:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:04:51] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2023-03-23 12:04:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:04:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:04:51] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2023-03-23 12:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:04:52] [INFO ] [Nat]Absence check using state equation in 1446 ms returned sat
[2023-03-23 12:04:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 12:04:53] [INFO ] [Nat]Added 72 Read/Feed constraints in 919 ms returned sat
[2023-03-23 12:04:53] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 4 ms to minimize.
[2023-03-23 12:04:54] [INFO ] Deduced a trap composed of 250 places in 226 ms of which 1 ms to minimize.
[2023-03-23 12:04:54] [INFO ] Deduced a trap composed of 288 places in 225 ms of which 1 ms to minimize.
[2023-03-23 12:04:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1053 ms
[2023-03-23 12:04:54] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 62 ms.
[2023-03-23 12:04:56] [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 7
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 12:04:56] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:04:56] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 10 ms returned unsat
[2023-03-23 12:04:56] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:04:56] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2023-03-23 12:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:04:57] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2023-03-23 12:04:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:04:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:04:57] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 19 ms returned sat
[2023-03-23 12:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:04:58] [INFO ] [Nat]Absence check using state equation in 1342 ms returned sat
[2023-03-23 12:04:59] [INFO ] [Nat]Added 72 Read/Feed constraints in 893 ms returned sat
[2023-03-23 12:04:59] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 0 ms to minimize.
[2023-03-23 12:05:00] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2023-03-23 12:05:00] [INFO ] Deduced a trap composed of 237 places in 210 ms of which 0 ms to minimize.
[2023-03-23 12:05:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1087 ms
[2023-03-23 12:05:00] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 73 ms.
[2023-03-23 12:05:02] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 0 ms to minimize.
[2023-03-23 12:05:02] [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 9
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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 12:05:02] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 12:05:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 9 ms returned unsat
[2023-03-23 12:05:02] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-23 12:05:02] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 18 ms returned sat
[2023-03-23 12:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:05:03] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2023-03-23 12:05:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:05:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:05:03] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 20 ms returned sat
[2023-03-23 12:05:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:05:04] [INFO ] [Nat]Absence check using state equation in 1045 ms returned sat
[2023-03-23 12:05:05] [INFO ] [Nat]Added 72 Read/Feed constraints in 817 ms returned sat
[2023-03-23 12:05:05] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 45 ms.
[2023-03-23 12:05:08] [INFO ] Added : 75 causal constraints over 15 iterations in 3015 ms. Result :unknown
[2023-03-23 12:05:08] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:05:08] [INFO ] [Real]Absence check using 19 positive and 31 generalized place invariants in 16 ms returned sat
[2023-03-23 12:05:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:05:10] [INFO ] [Real]Absence check using state equation in 1814 ms returned sat
[2023-03-23 12:05:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:05:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-23 12:05:10] [INFO ] [Nat]Absence check using 19 positive and 31 generalized place invariants in 15 ms returned sat
[2023-03-23 12:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:05:12] [INFO ] [Nat]Absence check using state equation in 1876 ms returned sat
[2023-03-23 12:05:13] [INFO ] [Nat]Added 72 Read/Feed constraints in 1007 ms returned sat
[2023-03-23 12:05:13] [INFO ] Deduced a trap composed of 74 places in 40 ms of which 1 ms to minimize.
[2023-03-23 12:05:13] [INFO ] Deduced a trap composed of 73 places in 43 ms of which 0 ms to minimize.
[2023-03-23 12:05:14] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 0 ms to minimize.
[2023-03-23 12:05:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1615 ms
[2023-03-23 12:05:15] [INFO ] Computed and/alt/rep : 630/2206/624 causal constraints (skipped 330 transitions) in 65 ms.
[2023-03-23 12:05:15] [INFO ] Added : 15 causal constraints over 3 iterations in 417 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 2, 1, 1, 1, 1, 1, 133, 1, 133, 1, 133, 46] Max seen :[1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 536 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 536/536 places, 968/968 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 534 transition count 917
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 483 transition count 916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 482 transition count 916
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 106 place count 482 transition count 856
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 226 place count 422 transition count 856
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 316 place count 377 transition count 811
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 326 place count 377 transition count 801
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 336 place count 367 transition count 801
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 337 place count 367 transition count 801
Applied a total of 337 rules in 186 ms. Remains 367 /536 variables (removed 169) and now considering 801/968 (removed 167) transitions.
[2023-03-23 12:05:15] [INFO ] Flow matrix only has 789 transitions (discarded 12 similar events)
// Phase 1: matrix 789 rows 367 cols
[2023-03-23 12:05:16] [INFO ] Computed 48 place invariants in 20 ms
[2023-03-23 12:05:16] [INFO ] Dead Transitions using invariants and state equation in 550 ms found 66 transitions.
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 367/536 places, 735/968 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 723
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 353 transition count 711
Applied a total of 14 rules in 26 ms. Remains 353 /367 variables (removed 14) and now considering 711/735 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 770 ms. Remains : 353/536 places, 711/968 transitions.
Normalized transition count is 699 out of 711 initially.
// Phase 1: matrix 699 rows 353 cols
[2023-03-23 12:05:16] [INFO ] Computed 48 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 504 resets, run finished after 3383 ms. (steps per millisecond=295 ) properties (out of 4) seen :7
Incomplete Best-First random walk after 1000001 steps, including 241 resets, run finished after 1621 ms. (steps per millisecond=616 ) properties (out of 4) seen :6
Incomplete Best-First random walk after 1000001 steps, including 218 resets, run finished after 1609 ms. (steps per millisecond=621 ) properties (out of 4) seen :7
Incomplete Best-First random walk after 1000000 steps, including 211 resets, run finished after 1593 ms. (steps per millisecond=627 ) properties (out of 4) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties (out of 4) seen :7
[2023-03-23 12:05:25] [INFO ] Flow matrix only has 699 transitions (discarded 12 similar events)
// Phase 1: matrix 699 rows 353 cols
[2023-03-23 12:05:25] [INFO ] Computed 48 place invariants in 16 ms
[2023-03-23 12:05:25] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-23 12:05:25] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 8 ms returned unsat
[2023-03-23 12:05:26] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-23 12:05:26] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 15 ms returned unsat
[2023-03-23 12:05:26] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-23 12:05:26] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 7 ms returned unsat
[2023-03-23 12:05:26] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-23 12:05:26] [INFO ] [Real]Absence check using 14 positive and 34 generalized place invariants in 10 ms returned sat
[2023-03-23 12:05:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:05:26] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2023-03-23 12:05:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:05:26] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-23 12:05:26] [INFO ] [Nat]Absence check using 14 positive and 34 generalized place invariants in 10 ms returned sat
[2023-03-23 12:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:05:27] [INFO ] [Nat]Absence check using state equation in 507 ms returned sat
[2023-03-23 12:05:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 12:05:27] [INFO ] [Nat]Added 72 Read/Feed constraints in 344 ms returned sat
[2023-03-23 12:05:27] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 0 ms to minimize.
[2023-03-23 12:05:27] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 0 ms to minimize.
[2023-03-23 12:05:28] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 1 ms to minimize.
[2023-03-23 12:05:28] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 1 ms to minimize.
[2023-03-23 12:05:28] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 1 ms to minimize.
[2023-03-23 12:05:28] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 0 ms to minimize.
[2023-03-23 12:05:28] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 1 ms to minimize.
[2023-03-23 12:05:28] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2023-03-23 12:05:29] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 0 ms to minimize.
[2023-03-23 12:05:29] [INFO ] Deduced a trap composed of 65 places in 134 ms of which 0 ms to minimize.
[2023-03-23 12:05:29] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 0 ms to minimize.
[2023-03-23 12:05:29] [INFO ] Deduced a trap composed of 132 places in 130 ms of which 1 ms to minimize.
[2023-03-23 12:05:29] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 0 ms to minimize.
[2023-03-23 12:05:29] [INFO ] Deduced a trap composed of 155 places in 130 ms of which 0 ms to minimize.
[2023-03-23 12:05:30] [INFO ] Deduced a trap composed of 138 places in 125 ms of which 1 ms to minimize.
[2023-03-23 12:05:30] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 1 ms to minimize.
[2023-03-23 12:05:30] [INFO ] Deduced a trap composed of 130 places in 127 ms of which 1 ms to minimize.
[2023-03-23 12:05:30] [INFO ] Deduced a trap composed of 130 places in 126 ms of which 0 ms to minimize.
[2023-03-23 12:05:30] [INFO ] Deduced a trap composed of 165 places in 131 ms of which 0 ms to minimize.
[2023-03-23 12:05:30] [INFO ] Deduced a trap composed of 143 places in 131 ms of which 0 ms to minimize.
[2023-03-23 12:05:31] [INFO ] Deduced a trap composed of 156 places in 137 ms of which 1 ms to minimize.
[2023-03-23 12:05:31] [INFO ] Deduced a trap composed of 116 places in 127 ms of which 1 ms to minimize.
[2023-03-23 12:05:31] [INFO ] Deduced a trap composed of 147 places in 127 ms of which 0 ms to minimize.
[2023-03-23 12:05:31] [INFO ] Deduced a trap composed of 114 places in 144 ms of which 0 ms to minimize.
[2023-03-23 12:05:31] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 1 ms to minimize.
[2023-03-23 12:05:32] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 0 ms to minimize.
[2023-03-23 12:05:32] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 1 ms to minimize.
[2023-03-23 12:05:32] [INFO ] Deduced a trap composed of 77 places in 125 ms of which 0 ms to minimize.
[2023-03-23 12:05:32] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 0 ms to minimize.
[2023-03-23 12:05:32] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 0 ms to minimize.
[2023-03-23 12:05:32] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 0 ms to minimize.
[2023-03-23 12:05:33] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 0 ms to minimize.
[2023-03-23 12:05:33] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 0 ms to minimize.
[2023-03-23 12:05:33] [INFO ] Deduced a trap composed of 151 places in 125 ms of which 1 ms to minimize.
[2023-03-23 12:05:33] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 0 ms to minimize.
[2023-03-23 12:05:33] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 0 ms to minimize.
[2023-03-23 12:05:33] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 1 ms to minimize.
[2023-03-23 12:05:34] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 0 ms to minimize.
[2023-03-23 12:05:34] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 1 ms to minimize.
[2023-03-23 12:05:34] [INFO ] Deduced a trap composed of 169 places in 124 ms of which 0 ms to minimize.
[2023-03-23 12:05:34] [INFO ] Deduced a trap composed of 146 places in 135 ms of which 1 ms to minimize.
[2023-03-23 12:05:34] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2023-03-23 12:05:35] [INFO ] Deduced a trap composed of 79 places in 128 ms of which 1 ms to minimize.
[2023-03-23 12:05:35] [INFO ] Deduced a trap composed of 114 places in 127 ms of which 1 ms to minimize.
[2023-03-23 12:05:35] [INFO ] Deduced a trap composed of 153 places in 130 ms of which 1 ms to minimize.
[2023-03-23 12:05:35] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 0 ms to minimize.
[2023-03-23 12:05:35] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2023-03-23 12:05:35] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 0 ms to minimize.
[2023-03-23 12:05:36] [INFO ] Deduced a trap composed of 157 places in 129 ms of which 1 ms to minimize.
[2023-03-23 12:05:36] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 0 ms to minimize.
[2023-03-23 12:05:36] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 1 ms to minimize.
[2023-03-23 12:05:36] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 1 ms to minimize.
[2023-03-23 12:05:36] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 0 ms to minimize.
[2023-03-23 12:05:37] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 0 ms to minimize.
[2023-03-23 12:05:37] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 1 ms to minimize.
[2023-03-23 12:05:37] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 2 ms to minimize.
[2023-03-23 12:05:37] [INFO ] Deduced a trap composed of 136 places in 129 ms of which 0 ms to minimize.
[2023-03-23 12:05:38] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 0 ms to minimize.
[2023-03-23 12:05:38] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 11 ms to minimize.
[2023-03-23 12:05:38] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 0 ms to minimize.
[2023-03-23 12:05:38] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 0 ms to minimize.
[2023-03-23 12:05:38] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 1 ms to minimize.
[2023-03-23 12:05:39] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 1 ms to minimize.
[2023-03-23 12:05:39] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 0 ms to minimize.
[2023-03-23 12:05:39] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 0 ms to minimize.
[2023-03-23 12:05:39] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 0 ms to minimize.
[2023-03-23 12:05:39] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 1 ms to minimize.
[2023-03-23 12:05:40] [INFO ] Deduced a trap composed of 148 places in 138 ms of which 0 ms to minimize.
[2023-03-23 12:05:40] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 1 ms to minimize.
[2023-03-23 12:05:40] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 1 ms to minimize.
[2023-03-23 12:05:40] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 1 ms to minimize.
[2023-03-23 12:05:40] [INFO ] Deduced a trap composed of 76 places in 126 ms of which 0 ms to minimize.
[2023-03-23 12:05:41] [INFO ] Deduced a trap composed of 126 places in 131 ms of which 0 ms to minimize.
[2023-03-23 12:05:41] [INFO ] Deduced a trap composed of 124 places in 127 ms of which 1 ms to minimize.
[2023-03-23 12:05:41] [INFO ] Deduced a trap composed of 133 places in 127 ms of which 1 ms to minimize.
[2023-03-23 12:05:41] [INFO ] Deduced a trap composed of 138 places in 133 ms of which 0 ms to minimize.
[2023-03-23 12:05:42] [INFO ] Deduced a trap composed of 122 places in 121 ms of which 1 ms to minimize.
[2023-03-23 12:05:42] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 14554 ms
[2023-03-23 12:05:42] [INFO ] Computed and/alt/rep : 439/1959/433 causal constraints (skipped 264 transitions) in 39 ms.
[2023-03-23 12:05:44] [INFO ] Added : 172 causal constraints over 35 iterations in 2269 ms. Result :sat
Minimization took 3010 ms.
Current structural bounds on expressions (after SMT) : [2, 2, 2, 46] Max seen :[2, 2, 2, 1]
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 353 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 353/353 places, 711/711 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 353 transition count 710
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 352 transition count 710
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 350 transition count 708
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 350 transition count 706
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 348 transition count 706
Applied a total of 10 rules in 50 ms. Remains 348 /353 variables (removed 5) and now considering 706/711 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 348/353 places, 706/711 transitions.
Normalized transition count is 694 out of 706 initially.
// Phase 1: matrix 694 rows 348 cols
[2023-03-23 12:05:47] [INFO ] Computed 48 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 512 resets, run finished after 3359 ms. (steps per millisecond=297 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 1) seen :1
[2023-03-23 12:05:52] [INFO ] Flow matrix only has 694 transitions (discarded 12 similar events)
// Phase 1: matrix 694 rows 348 cols
[2023-03-23 12:05:52] [INFO ] Computed 48 place invariants in 18 ms
[2023-03-23 12:05:52] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-23 12:05:52] [INFO ] [Real]Absence check using 12 positive and 36 generalized place invariants in 10 ms returned sat
[2023-03-23 12:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:05:52] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2023-03-23 12:05:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:05:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-03-23 12:05:53] [INFO ] [Nat]Absence check using 12 positive and 36 generalized place invariants in 9 ms returned sat
[2023-03-23 12:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:05:54] [INFO ] [Nat]Absence check using state equation in 1322 ms returned sat
[2023-03-23 12:05:54] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 12:05:54] [INFO ] [Nat]Added 72 Read/Feed constraints in 620 ms returned sat
[2023-03-23 12:05:55] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 0 ms to minimize.
[2023-03-23 12:05:55] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 0 ms to minimize.
[2023-03-23 12:05:55] [INFO ] Deduced a trap composed of 63 places in 132 ms of which 0 ms to minimize.
[2023-03-23 12:05:55] [INFO ] Deduced a trap composed of 78 places in 142 ms of which 0 ms to minimize.
[2023-03-23 12:05:55] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 0 ms to minimize.
[2023-03-23 12:05:55] [INFO ] Deduced a trap composed of 67 places in 129 ms of which 0 ms to minimize.
[2023-03-23 12:05:56] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 0 ms to minimize.
[2023-03-23 12:05:56] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 1 ms to minimize.
[2023-03-23 12:05:56] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 1 ms to minimize.
[2023-03-23 12:05:56] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 0 ms to minimize.
[2023-03-23 12:05:57] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 0 ms to minimize.
[2023-03-23 12:05:57] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2086 ms
[2023-03-23 12:05:57] [INFO ] Computed and/alt/rep : 422/1902/416 causal constraints (skipped 276 transitions) in 35 ms.
[2023-03-23 12:05:58] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2023-03-23 12:05:58] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2023-03-23 12:05:58] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2023-03-23 12:05:59] [INFO ] Deduced a trap composed of 131 places in 119 ms of which 1 ms to minimize.
[2023-03-23 12:05:59] [INFO ] Deduced a trap composed of 148 places in 124 ms of which 0 ms to minimize.
[2023-03-23 12:05:59] [INFO ] Deduced a trap composed of 152 places in 129 ms of which 1 ms to minimize.
[2023-03-23 12:05:59] [INFO ] Deduced a trap composed of 132 places in 127 ms of which 0 ms to minimize.
[2023-03-23 12:05:59] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 1 ms to minimize.
[2023-03-23 12:06:00] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 0 ms to minimize.
[2023-03-23 12:06:00] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 0 ms to minimize.
[2023-03-23 12:06:00] [INFO ] Deduced a trap composed of 120 places in 120 ms of which 0 ms to minimize.
[2023-03-23 12:06:00] [INFO ] Deduced a trap composed of 129 places in 121 ms of which 1 ms to minimize.
[2023-03-23 12:06:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2479 ms
[2023-03-23 12:06:01] [INFO ] Added : 156 causal constraints over 32 iterations in 4158 ms. Result :sat
Minimization took 927 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 348 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 706/706 transitions.
Applied a total of 0 rules in 17 ms. Remains 348 /348 variables (removed 0) and now considering 706/706 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 348/348 places, 706/706 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 348/348 places, 706/706 transitions.
Applied a total of 0 rules in 15 ms. Remains 348 /348 variables (removed 0) and now considering 706/706 (removed 0) transitions.
[2023-03-23 12:06:02] [INFO ] Flow matrix only has 694 transitions (discarded 12 similar events)
[2023-03-23 12:06:02] [INFO ] Invariant cache hit.
[2023-03-23 12:06:03] [INFO ] Implicit Places using invariants in 336 ms returned [70, 77, 154, 164, 200, 327]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 340 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 342/348 places, 706/706 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 339 transition count 703
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 339 transition count 703
Applied a total of 6 rules in 21 ms. Remains 339 /342 variables (removed 3) and now considering 703/706 (removed 3) transitions.
[2023-03-23 12:06:03] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2023-03-23 12:06:03] [INFO ] Computed 42 place invariants in 8 ms
[2023-03-23 12:06:03] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-23 12:06:03] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2023-03-23 12:06:03] [INFO ] Invariant cache hit.
[2023-03-23 12:06:03] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 12:06:08] [INFO ] Implicit Places using invariants and state equation in 4974 ms returned []
Implicit Place search using SMT with State Equation took 5280 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 339/348 places, 703/706 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5657 ms. Remains : 339/348 places, 703/706 transitions.
Normalized transition count is 691 out of 703 initially.
// Phase 1: matrix 691 rows 339 cols
[2023-03-23 12:06:08] [INFO ] Computed 42 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 524 resets, run finished after 3108 ms. (steps per millisecond=321 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1054 ms. (steps per millisecond=948 ) properties (out of 1) seen :1
[2023-03-23 12:06:12] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2023-03-23 12:06:12] [INFO ] Computed 42 place invariants in 14 ms
[2023-03-23 12:06:12] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-23 12:06:12] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-23 12:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:06:12] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-23 12:06:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:06:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 12:06:13] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-23 12:06:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:06:13] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2023-03-23 12:06:13] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 12:06:14] [INFO ] [Nat]Added 72 Read/Feed constraints in 183 ms returned sat
[2023-03-23 12:06:14] [INFO ] Computed and/alt/rep : 419/1898/413 causal constraints (skipped 276 transitions) in 34 ms.
[2023-03-23 12:06:16] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 0 ms to minimize.
[2023-03-23 12:06:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 170 ms
[2023-03-23 12:06:17] [INFO ] Added : 269 causal constraints over 54 iterations in 3261 ms. Result :sat
Minimization took 959 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 13 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 339/339 places, 703/703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 12 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2023-03-23 12:06:18] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2023-03-23 12:06:18] [INFO ] Invariant cache hit.
[2023-03-23 12:06:19] [INFO ] Implicit Places using invariants in 320 ms returned []
[2023-03-23 12:06:19] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2023-03-23 12:06:19] [INFO ] Invariant cache hit.
[2023-03-23 12:06:19] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 12:06:22] [INFO ] Implicit Places using invariants and state equation in 3611 ms returned []
Implicit Place search using SMT with State Equation took 3931 ms to find 0 implicit places.
[2023-03-23 12:06:22] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-23 12:06:22] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2023-03-23 12:06:22] [INFO ] Invariant cache hit.
[2023-03-23 12:06:23] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4430 ms. Remains : 339/339 places, 703/703 transitions.
Starting property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-15
Normalized transition count is 691 out of 703 initially.
// Phase 1: matrix 691 rows 339 cols
[2023-03-23 12:06:23] [INFO ] Computed 42 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 8 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :1
[2023-03-23 12:06:23] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2023-03-23 12:06:23] [INFO ] Computed 42 place invariants in 15 ms
[2023-03-23 12:06:23] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-23 12:06:23] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-23 12:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:06:23] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2023-03-23 12:06:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:06:23] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-23 12:06:23] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-23 12:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:06:24] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2023-03-23 12:06:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 12:06:24] [INFO ] [Nat]Added 72 Read/Feed constraints in 168 ms returned sat
[2023-03-23 12:06:24] [INFO ] Computed and/alt/rep : 419/1898/413 causal constraints (skipped 276 transitions) in 32 ms.
[2023-03-23 12:06:27] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 0 ms to minimize.
[2023-03-23 12:06:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-23 12:06:27] [INFO ] Added : 269 causal constraints over 54 iterations in 3120 ms. Result :sat
Minimization took 874 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 20 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2023-03-23 12:06:28] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2023-03-23 12:06:28] [INFO ] Invariant cache hit.
[2023-03-23 12:06:29] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 465 ms. Remains : 339/339 places, 703/703 transitions.
Normalized transition count is 691 out of 703 initially.
// Phase 1: matrix 691 rows 339 cols
[2023-03-23 12:06:29] [INFO ] Computed 42 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 558 resets, run finished after 3098 ms. (steps per millisecond=322 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1065 ms. (steps per millisecond=938 ) properties (out of 1) seen :1
[2023-03-23 12:06:33] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
// Phase 1: matrix 691 rows 339 cols
[2023-03-23 12:06:33] [INFO ] Computed 42 place invariants in 19 ms
[2023-03-23 12:06:33] [INFO ] [Real]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-23 12:06:33] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 10 ms returned sat
[2023-03-23 12:06:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:06:33] [INFO ] [Real]Absence check using state equation in 325 ms returned sat
[2023-03-23 12:06:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:06:33] [INFO ] [Nat]Absence check using 15 positive place invariants in 4 ms returned sat
[2023-03-23 12:06:33] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 16 ms returned sat
[2023-03-23 12:06:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:06:34] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2023-03-23 12:06:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 12:06:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 172 ms returned sat
[2023-03-23 12:06:34] [INFO ] Computed and/alt/rep : 419/1898/413 causal constraints (skipped 276 transitions) in 33 ms.
[2023-03-23 12:06:37] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 0 ms to minimize.
[2023-03-23 12:06:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-23 12:06:38] [INFO ] Added : 269 causal constraints over 54 iterations in 3331 ms. Result :sat
Minimization took 990 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 11 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 339/339 places, 703/703 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 703/703 transitions.
Applied a total of 0 rules in 11 ms. Remains 339 /339 variables (removed 0) and now considering 703/703 (removed 0) transitions.
[2023-03-23 12:06:39] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2023-03-23 12:06:39] [INFO ] Invariant cache hit.
[2023-03-23 12:06:40] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-23 12:06:40] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2023-03-23 12:06:40] [INFO ] Invariant cache hit.
[2023-03-23 12:06:40] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-23 12:06:44] [INFO ] Implicit Places using invariants and state equation in 4101 ms returned []
Implicit Place search using SMT with State Equation took 4454 ms to find 0 implicit places.
[2023-03-23 12:06:44] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-23 12:06:44] [INFO ] Flow matrix only has 691 transitions (discarded 12 similar events)
[2023-03-23 12:06:44] [INFO ] Invariant cache hit.
[2023-03-23 12:06:44] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4932 ms. Remains : 339/339 places, 703/703 transitions.
Ending property specific reduction for PolyORBLF-PT-S02J06T06-UpperBounds-15 in 21464 ms.
[2023-03-23 12:06:44] [INFO ] Flatten gal took : 94 ms
[2023-03-23 12:06:44] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 12:06:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 339 places, 703 transitions and 3527 arcs took 5 ms.
Total runtime 116658 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: PolyORBLF_PT_S02J06T06
(NrP: 339 NrTr: 703 NrArc: 3527)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.022sec
net check time: 0m 0.000sec
init dd package: 0m 2.721sec
RS generation: 18m 2.899sec
-> reachability set: #nodes 435464 (4.4e+05) #states 16,201,764 (7)
starting MCC model checker
--------------------------
checking: place_bound(p276)
normalized: place_bound(p276)
-> the formula is 1
FORMULA PolyORBLF-PT-S02J06T06-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 39764691 (4.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 838064956 34801669 872866625
used/not used/entry size/cache size: 67108864 0 16 1024MB
basic ops cache: hits/miss/sum: 157350 741421 898771
used/not used/entry size/cache size: 1270399 15506817 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 32740 435693 468433
used/not used/entry size/cache size: 424703 7963905 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 39679144
1 18383032
2 6653621
3 1874670
4 415526
5 77131
6 13537
7 3193
8 1244
9 789
>= 10 6977
Total processing time: 18m10.831sec
BK_STOP 1679574296804
--------------------
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.004sec
38799 61957 86130 97228 134301 160742 170509 176855 210390 223202 208519 229655 218740 225297 245955 233485 225814 237757 229898 262347 288578 296159 292951 321754 339835 337399 316748 321000 335749 312260 324667 335302 341676 326951 320293 318254 328971 303638 305572 305883 315580 325467 313034 291011 278687 276125 267565 250213 286415 305169 318531 303011 334653 343361 340140 341047 355505 357167 343846 348650 355184 358132 370401 366193 343164 334725 323862 313018 303838 328780 345870 356991 357025 353257 347091 325392 385936 403025 411315 422933 437595 450697 434193 456395 474527 454271 466712 476884 487377 490595 499897 474624 459762 454525 442867 435274 439325 436024 441406 432112 417104 403672 385288 430463 439365 448205 463104 491364 492577 479204 484941 471354 469467 439994
iterations count:11402402 (16219), effective:128403 (182)
initing FirstDep: 0m 0.004sec
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="PolyORBLF-PT-S02J06T06"
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 PolyORBLF-PT-S02J06T06, 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 r298-tall-167873951800517"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 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 ;