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-167873951900549.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-S04J04T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951900549
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 15K Feb 26 14:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 14:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 76K Feb 26 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 344K Feb 26 14:25 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:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 26 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 178K Feb 26 14:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 793K Feb 26 14:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:35 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 3.3M 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-S04J04T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J04T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679584223998

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-S04J04T08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 15:10:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 15:10:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 15:10:25] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2023-03-23 15:10:25] [INFO ] Transformed 712 places.
[2023-03-23 15:10:25] [INFO ] Transformed 4012 transitions.
[2023-03-23 15:10:25] [INFO ] Parsed PT model containing 712 places and 4012 transitions and 27744 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 2168 transitions
Reduce redundant transitions removed 2168 transitions.
Normalized transition count is 1812 out of 1844 initially.
// Phase 1: matrix 1812 rows 712 cols
[2023-03-23 15:10:25] [INFO ] Computed 54 place invariants in 118 ms
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 15) seen :22
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :17
[2023-03-23 15:10:26] [INFO ] Flow matrix only has 1812 transitions (discarded 32 similar events)
// Phase 1: matrix 1812 rows 712 cols
[2023-03-23 15:10:26] [INFO ] Computed 54 place invariants in 53 ms
[2023-03-23 15:10:26] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-23 15:10:26] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 40 ms returned unsat
[2023-03-23 15:10:26] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 15:10:26] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 33 ms returned unsat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 37 ms returned unsat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 30 ms returned unsat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 33 ms returned unsat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned unsat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 21 ms returned unsat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 26 ms returned unsat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-23 15:10:27] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 36 ms returned sat
[2023-03-23 15:10:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:10:31] [INFO ] [Real]Absence check using state equation in 4093 ms returned sat
[2023-03-23 15:10:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:10:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-23 15:10:32] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 33 ms returned sat
[2023-03-23 15:10:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:10:36] [INFO ] [Nat]Absence check using state equation in 4211 ms returned sat
[2023-03-23 15:10:36] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-23 15:10:36] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 15:10:36] [INFO ] [Nat]Added 160 Read/Feed constraints in 664 ms returned unknown
[2023-03-23 15:10:37] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-23 15:10:37] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 24 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 1, 2, 4, 1, 1, 1, 8, 1] Max seen :[4, 1, 1, 2, 4, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J04T08-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 1844/1844 transitions.
Ensure Unique test removed 4 places
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 708 transition count 1772
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 148 place count 636 transition count 1772
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 148 place count 636 transition count 1692
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 308 place count 556 transition count 1692
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 2 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 466 place count 477 transition count 1613
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 482 place count 477 transition count 1597
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 498 place count 461 transition count 1597
Applied a total of 498 rules in 292 ms. Remains 461 /712 variables (removed 251) and now considering 1597/1844 (removed 247) transitions.
[2023-03-23 15:10:37] [INFO ] Flow matrix only has 1565 transitions (discarded 32 similar events)
// Phase 1: matrix 1565 rows 461 cols
[2023-03-23 15:10:37] [INFO ] Computed 50 place invariants in 27 ms
[2023-03-23 15:10:38] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 432 transitions.
Found 432 dead transitions using SMT.
Drop transitions removed 432 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 432 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 461/712 places, 1165/1844 transitions.
Applied a total of 0 rules in 49 ms. Remains 461 /461 variables (removed 0) and now considering 1165/1165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1296 ms. Remains : 461/712 places, 1165/1844 transitions.
Normalized transition count is 1133 out of 1165 initially.
// Phase 1: matrix 1133 rows 461 cols
[2023-03-23 15:10:38] [INFO ] Computed 50 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 88 resets, run finished after 5298 ms. (steps per millisecond=188 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 41 resets, run finished after 1948 ms. (steps per millisecond=513 ) properties (out of 1) seen :1
[2023-03-23 15:10:45] [INFO ] Flow matrix only has 1133 transitions (discarded 32 similar events)
// Phase 1: matrix 1133 rows 461 cols
[2023-03-23 15:10:45] [INFO ] Computed 50 place invariants in 15 ms
[2023-03-23 15:10:45] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 15:10:45] [INFO ] [Real]Absence check using 15 positive and 35 generalized place invariants in 21 ms returned sat
[2023-03-23 15:10:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:10:46] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2023-03-23 15:10:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:10:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 15:10:46] [INFO ] [Nat]Absence check using 15 positive and 35 generalized place invariants in 26 ms returned sat
[2023-03-23 15:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:10:50] [INFO ] [Nat]Absence check using state equation in 4296 ms returned sat
[2023-03-23 15:10:50] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-23 15:10:52] [INFO ] [Nat]Added 160 Read/Feed constraints in 1405 ms returned sat
[2023-03-23 15:10:52] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 3 ms to minimize.
[2023-03-23 15:10:52] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2023-03-23 15:10:53] [INFO ] Deduced a trap composed of 207 places in 241 ms of which 16 ms to minimize.
[2023-03-23 15:10:53] [INFO ] Deduced a trap composed of 211 places in 233 ms of which 2 ms to minimize.
[2023-03-23 15:10:54] [INFO ] Deduced a trap composed of 199 places in 247 ms of which 1 ms to minimize.
[2023-03-23 15:10:54] [INFO ] Deduced a trap composed of 202 places in 203 ms of which 1 ms to minimize.
[2023-03-23 15:10:54] [INFO ] Deduced a trap composed of 184 places in 213 ms of which 0 ms to minimize.
[2023-03-23 15:10:55] [INFO ] Deduced a trap composed of 191 places in 230 ms of which 1 ms to minimize.
[2023-03-23 15:10:55] [INFO ] Deduced a trap composed of 211 places in 206 ms of which 1 ms to minimize.
[2023-03-23 15:10:55] [INFO ] Deduced a trap composed of 198 places in 208 ms of which 1 ms to minimize.
[2023-03-23 15:10:55] [INFO ] Deduced a trap composed of 219 places in 220 ms of which 1 ms to minimize.
[2023-03-23 15:10:56] [INFO ] Deduced a trap composed of 215 places in 205 ms of which 1 ms to minimize.
[2023-03-23 15:10:56] [INFO ] Deduced a trap composed of 191 places in 211 ms of which 0 ms to minimize.
[2023-03-23 15:10:56] [INFO ] Deduced a trap composed of 224 places in 198 ms of which 0 ms to minimize.
[2023-03-23 15:10:56] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 0 ms to minimize.
[2023-03-23 15:10:57] [INFO ] Deduced a trap composed of 191 places in 212 ms of which 0 ms to minimize.
[2023-03-23 15:10:57] [INFO ] Deduced a trap composed of 208 places in 230 ms of which 1 ms to minimize.
[2023-03-23 15:10:57] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5375 ms
[2023-03-23 15:10:57] [INFO ] Computed and/alt/rep : 577/2989/553 causal constraints (skipped 576 transitions) in 90 ms.
[2023-03-23 15:10:59] [INFO ] Deduced a trap composed of 192 places in 202 ms of which 1 ms to minimize.
[2023-03-23 15:10:59] [INFO ] Deduced a trap composed of 204 places in 217 ms of which 1 ms to minimize.
[2023-03-23 15:11:00] [INFO ] Deduced a trap composed of 203 places in 200 ms of which 0 ms to minimize.
[2023-03-23 15:11:00] [INFO ] Deduced a trap composed of 213 places in 218 ms of which 0 ms to minimize.
[2023-03-23 15:11:01] [INFO ] Deduced a trap composed of 219 places in 216 ms of which 1 ms to minimize.
[2023-03-23 15:11:01] [INFO ] Deduced a trap composed of 204 places in 205 ms of which 0 ms to minimize.
[2023-03-23 15:11:01] [INFO ] Deduced a trap composed of 194 places in 207 ms of which 0 ms to minimize.
[2023-03-23 15:11:01] [INFO ] Deduced a trap composed of 217 places in 206 ms of which 1 ms to minimize.
[2023-03-23 15:11:02] [INFO ] Deduced a trap composed of 224 places in 209 ms of which 0 ms to minimize.
[2023-03-23 15:11:02] [INFO ] Deduced a trap composed of 205 places in 199 ms of which 1 ms to minimize.
[2023-03-23 15:11:02] [INFO ] Deduced a trap composed of 224 places in 199 ms of which 1 ms to minimize.
[2023-03-23 15:11:05] [INFO ] Trap strengthening (SAT) tested/added 11/11 trap constraints in 6343 ms
[2023-03-23 15:11:31] [INFO ] Deduced a trap composed of 2 places in 260 ms of which 0 ms to minimize.
[2023-03-23 15:11:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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)
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 461 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1165/1165 transitions.
Applied a total of 0 rules in 27 ms. Remains 461 /461 variables (removed 0) and now considering 1165/1165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 461/461 places, 1165/1165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 461/461 places, 1165/1165 transitions.
Applied a total of 0 rules in 25 ms. Remains 461 /461 variables (removed 0) and now considering 1165/1165 (removed 0) transitions.
[2023-03-23 15:11:31] [INFO ] Flow matrix only has 1133 transitions (discarded 32 similar events)
[2023-03-23 15:11:31] [INFO ] Invariant cache hit.
[2023-03-23 15:11:32] [INFO ] Implicit Places using invariants in 545 ms returned [93, 145, 163, 227, 313, 352, 360, 448]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 550 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 453/461 places, 1165/1165 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 446 transition count 1158
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 446 transition count 1158
Applied a total of 14 rules in 35 ms. Remains 446 /453 variables (removed 7) and now considering 1158/1165 (removed 7) transitions.
[2023-03-23 15:11:32] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2023-03-23 15:11:32] [INFO ] Computed 42 place invariants in 19 ms
[2023-03-23 15:11:32] [INFO ] Implicit Places using invariants in 612 ms returned []
[2023-03-23 15:11:32] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-23 15:11:32] [INFO ] Invariant cache hit.
[2023-03-23 15:11:33] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-23 15:11:36] [INFO ] Implicit Places using invariants and state equation in 3500 ms returned []
Implicit Place search using SMT with State Equation took 4115 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 446/461 places, 1158/1165 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4726 ms. Remains : 446/461 places, 1158/1165 transitions.
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2023-03-23 15:11:36] [INFO ] Computed 42 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 105 resets, run finished after 4952 ms. (steps per millisecond=201 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 28 resets, run finished after 1873 ms. (steps per millisecond=533 ) properties (out of 1) seen :1
[2023-03-23 15:11:43] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2023-03-23 15:11:43] [INFO ] Computed 42 place invariants in 19 ms
[2023-03-23 15:11:43] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-23 15:11:43] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 13 ms returned sat
[2023-03-23 15:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:11:44] [INFO ] [Real]Absence check using state equation in 1377 ms returned sat
[2023-03-23 15:11:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:11:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-23 15:11:44] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-23 15:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:11:49] [INFO ] [Nat]Absence check using state equation in 4456 ms returned sat
[2023-03-23 15:11:49] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-23 15:11:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 15:11:55] [INFO ] [Nat]Added 160 Read/Feed constraints in 6017 ms returned unknown
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 33 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 446/446 places, 1158/1158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 21 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2023-03-23 15:11:55] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-23 15:11:55] [INFO ] Invariant cache hit.
[2023-03-23 15:11:56] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-03-23 15:11:56] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-23 15:11:56] [INFO ] Invariant cache hit.
[2023-03-23 15:11:56] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-23 15:11:59] [INFO ] Implicit Places using invariants and state equation in 3308 ms returned []
Implicit Place search using SMT with State Equation took 3902 ms to find 0 implicit places.
[2023-03-23 15:11:59] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-23 15:11:59] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-23 15:11:59] [INFO ] Invariant cache hit.
[2023-03-23 15:12:00] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4790 ms. Remains : 446/446 places, 1158/1158 transitions.
Starting property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-12
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2023-03-23 15:12:00] [INFO ] Computed 42 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
[2023-03-23 15:12:00] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2023-03-23 15:12:00] [INFO ] Computed 42 place invariants in 22 ms
[2023-03-23 15:12:00] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-23 15:12:00] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 12 ms returned sat
[2023-03-23 15:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:12:01] [INFO ] [Real]Absence check using state equation in 1413 ms returned sat
[2023-03-23 15:12:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:12:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-23 15:12:01] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 11 ms returned sat
[2023-03-23 15:12:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:12:06] [INFO ] [Nat]Absence check using state equation in 4390 ms returned sat
[2023-03-23 15:12:06] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-23 15:12:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 15:12:06] [INFO ] [Nat]Added 160 Read/Feed constraints in 534 ms returned unknown
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 24 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2023-03-23 15:12:06] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-23 15:12:06] [INFO ] Invariant cache hit.
[2023-03-23 15:12:07] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 889 ms. Remains : 446/446 places, 1158/1158 transitions.
Normalized transition count is 1126 out of 1158 initially.
// Phase 1: matrix 1126 rows 446 cols
[2023-03-23 15:12:07] [INFO ] Computed 42 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 102 resets, run finished after 5040 ms. (steps per millisecond=198 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 31 resets, run finished after 1873 ms. (steps per millisecond=533 ) properties (out of 1) seen :1
[2023-03-23 15:12:14] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
// Phase 1: matrix 1126 rows 446 cols
[2023-03-23 15:12:14] [INFO ] Computed 42 place invariants in 24 ms
[2023-03-23 15:12:14] [INFO ] [Real]Absence check using 15 positive place invariants in 5 ms returned sat
[2023-03-23 15:12:14] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 18 ms returned sat
[2023-03-23 15:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 15:12:16] [INFO ] [Real]Absence check using state equation in 1454 ms returned sat
[2023-03-23 15:12:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 15:12:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 15:12:16] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 21 ms returned sat
[2023-03-23 15:12:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 15:12:22] [INFO ] [Nat]Absence check using state equation in 6406 ms returned sat
[2023-03-23 15:12:22] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-23 15:12:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 15:12:26] [INFO ] [Nat]Added 160 Read/Feed constraints in 3969 ms returned sat
[2023-03-23 15:12:26] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2023-03-23 15:12:27] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2023-03-23 15:12:28] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 1 ms to minimize.
[2023-03-23 15:12:28] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2023-03-23 15:12:29] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 0 ms to minimize.
[2023-03-23 15:12:29] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2023-03-23 15:12:31] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 1 ms to minimize.
[2023-03-23 15:12:32] [INFO ] Deduced a trap composed of 191 places in 206 ms of which 0 ms to minimize.
[2023-03-23 15:12:33] [INFO ] Deduced a trap composed of 200 places in 206 ms of which 0 ms to minimize.
[2023-03-23 15:12:33] [INFO ] Deduced a trap composed of 242 places in 202 ms of which 0 ms to minimize.
[2023-03-23 15:12:34] [INFO ] Deduced a trap composed of 232 places in 202 ms of which 1 ms to minimize.
[2023-03-23 15:12:34] [INFO ] Deduced a trap composed of 223 places in 202 ms of which 1 ms to minimize.
[2023-03-23 15:12:34] [INFO ] Deduced a trap composed of 219 places in 199 ms of which 1 ms to minimize.
[2023-03-23 15:12:34] [INFO ] Deduced a trap composed of 229 places in 202 ms of which 1 ms to minimize.
[2023-03-23 15:12:35] [INFO ] Deduced a trap composed of 231 places in 204 ms of which 0 ms to minimize.
[2023-03-23 15:12:35] [INFO ] Deduced a trap composed of 207 places in 205 ms of which 0 ms to minimize.
[2023-03-23 15:12:35] [INFO ] Deduced a trap composed of 238 places in 200 ms of which 1 ms to minimize.
[2023-03-23 15:12:36] [INFO ] Deduced a trap composed of 232 places in 202 ms of which 2 ms to minimize.
[2023-03-23 15:12:36] [INFO ] Deduced a trap composed of 221 places in 198 ms of which 1 ms to minimize.
[2023-03-23 15:12:36] [INFO ] Deduced a trap composed of 221 places in 212 ms of which 4 ms to minimize.
[2023-03-23 15:12:37] [INFO ] Deduced a trap composed of 201 places in 211 ms of which 1 ms to minimize.
[2023-03-23 15:12:37] [INFO ] Deduced a trap composed of 201 places in 206 ms of which 0 ms to minimize.
[2023-03-23 15:12:37] [INFO ] Deduced a trap composed of 220 places in 199 ms of which 1 ms to minimize.
[2023-03-23 15:12:38] [INFO ] Deduced a trap composed of 227 places in 201 ms of which 1 ms to minimize.
[2023-03-23 15:12:38] [INFO ] Deduced a trap composed of 236 places in 201 ms of which 0 ms to minimize.
[2023-03-23 15:12:39] [INFO ] Deduced a trap composed of 244 places in 198 ms of which 0 ms to minimize.
[2023-03-23 15:12:39] [INFO ] Deduced a trap composed of 250 places in 199 ms of which 3 ms to minimize.
[2023-03-23 15:12:39] [INFO ] Deduced a trap composed of 251 places in 231 ms of which 1 ms to minimize.
[2023-03-23 15:12:40] [INFO ] Deduced a trap composed of 217 places in 208 ms of which 1 ms to minimize.
[2023-03-23 15:12:40] [INFO ] Deduced a trap composed of 241 places in 207 ms of which 1 ms to minimize.
[2023-03-23 15:12:40] [INFO ] Deduced a trap composed of 226 places in 202 ms of which 1 ms to minimize.
[2023-03-23 15:12:40] [INFO ] Deduced a trap composed of 219 places in 201 ms of which 0 ms to minimize.
[2023-03-23 15:12:41] [INFO ] Deduced a trap composed of 209 places in 203 ms of which 0 ms to minimize.
[2023-03-23 15:12:41] [INFO ] Deduced a trap composed of 211 places in 206 ms of which 0 ms to minimize.
[2023-03-23 15:12:42] [INFO ] Deduced a trap composed of 231 places in 199 ms of which 1 ms to minimize.
[2023-03-23 15:12:43] [INFO ] Deduced a trap composed of 207 places in 206 ms of which 0 ms to minimize.
[2023-03-23 15:12:43] [INFO ] Deduced a trap composed of 238 places in 195 ms of which 0 ms to minimize.
[2023-03-23 15:12:44] [INFO ] Deduced a trap composed of 223 places in 195 ms of which 0 ms to minimize.
[2023-03-23 15:12:44] [INFO ] Deduced a trap composed of 214 places in 230 ms of which 0 ms to minimize.
[2023-03-23 15:12:44] [INFO ] Deduced a trap composed of 251 places in 223 ms of which 1 ms to minimize.
[2023-03-23 15:12:45] [INFO ] Deduced a trap composed of 217 places in 205 ms of which 0 ms to minimize.
[2023-03-23 15:12:45] [INFO ] Deduced a trap composed of 230 places in 210 ms of which 0 ms to minimize.
[2023-03-23 15:12:46] [INFO ] Deduced a trap composed of 208 places in 204 ms of which 0 ms to minimize.
[2023-03-23 15:12:46] [INFO ] Deduced a trap composed of 224 places in 222 ms of which 3 ms to minimize.
[2023-03-23 15:12:46] [INFO ] Deduced a trap composed of 241 places in 225 ms of which 0 ms to minimize.
[2023-03-23 15:12:47] [INFO ] Deduced a trap composed of 224 places in 225 ms of which 1 ms to minimize.
[2023-03-23 15:12:47] [INFO ] Deduced a trap composed of 240 places in 220 ms of which 0 ms to minimize.
[2023-03-23 15:12:47] [INFO ] Deduced a trap composed of 252 places in 227 ms of which 1 ms to minimize.
[2023-03-23 15:12:48] [INFO ] Deduced a trap composed of 230 places in 203 ms of which 1 ms to minimize.
[2023-03-23 15:12:48] [INFO ] Deduced a trap composed of 232 places in 205 ms of which 0 ms to minimize.
[2023-03-23 15:12:48] [INFO ] Deduced a trap composed of 224 places in 207 ms of which 0 ms to minimize.
[2023-03-23 15:12:50] [INFO ] Deduced a trap composed of 232 places in 225 ms of which 0 ms to minimize.
[2023-03-23 15:12:50] [INFO ] Deduced a trap composed of 253 places in 233 ms of which 1 ms to minimize.
[2023-03-23 15:12:51] [INFO ] Deduced a trap composed of 213 places in 225 ms of which 1 ms to minimize.
[2023-03-23 15:12:51] [INFO ] Deduced a trap composed of 220 places in 231 ms of which 1 ms to minimize.
[2023-03-23 15:12:52] [INFO ] Deduced a trap composed of 230 places in 230 ms of which 1 ms to minimize.
[2023-03-23 15:12:52] [INFO ] Deduced a trap composed of 232 places in 222 ms of which 1 ms to minimize.
[2023-03-23 15:12:53] [INFO ] Deduced a trap composed of 213 places in 230 ms of which 1 ms to minimize.
[2023-03-23 15:12:53] [INFO ] Deduced a trap composed of 209 places in 224 ms of which 1 ms to minimize.
[2023-03-23 15:12:53] [INFO ] Deduced a trap composed of 232 places in 219 ms of which 1 ms to minimize.
[2023-03-23 15:12:54] [INFO ] Deduced a trap composed of 230 places in 221 ms of which 1 ms to minimize.
[2023-03-23 15:12:54] [INFO ] Deduced a trap composed of 249 places in 228 ms of which 1 ms to minimize.
[2023-03-23 15:12:55] [INFO ] Deduced a trap composed of 213 places in 233 ms of which 0 ms to minimize.
[2023-03-23 15:12:55] [INFO ] Deduced a trap composed of 225 places in 226 ms of which 1 ms to minimize.
[2023-03-23 15:12:55] [INFO ] Deduced a trap composed of 234 places in 217 ms of which 0 ms to minimize.
[2023-03-23 15:12:56] [INFO ] Deduced a trap composed of 233 places in 227 ms of which 0 ms to minimize.
[2023-03-23 15:12:56] [INFO ] Deduced a trap composed of 222 places in 218 ms of which 0 ms to minimize.
[2023-03-23 15:12:57] [INFO ] Deduced a trap composed of 222 places in 219 ms of which 0 ms to minimize.
[2023-03-23 15:12:57] [INFO ] Deduced a trap composed of 231 places in 209 ms of which 1 ms to minimize.
[2023-03-23 15:12:58] [INFO ] Deduced a trap composed of 233 places in 203 ms of which 0 ms to minimize.
[2023-03-23 15:12:58] [INFO ] Deduced a trap composed of 223 places in 196 ms of which 1 ms to minimize.
[2023-03-23 15:12:59] [INFO ] Deduced a trap composed of 257 places in 192 ms of which 0 ms to minimize.
[2023-03-23 15:12:59] [INFO ] Deduced a trap composed of 222 places in 202 ms of which 1 ms to minimize.
[2023-03-23 15:13:00] [INFO ] Trap strengthening (SAT) tested/added 74/73 trap constraints in 33564 ms
[2023-03-23 15:13:00] [INFO ] Computed and/alt/rep : 563/2918/539 causal constraints (skipped 583 transitions) in 59 ms.
[2023-03-23 15:13:01] [INFO ] Added : 5 causal constraints over 1 iterations in 995 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 1 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 20 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 446/446 places, 1158/1158 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 1158/1158 transitions.
Applied a total of 0 rules in 20 ms. Remains 446 /446 variables (removed 0) and now considering 1158/1158 (removed 0) transitions.
[2023-03-23 15:13:01] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-23 15:13:01] [INFO ] Invariant cache hit.
[2023-03-23 15:13:01] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-23 15:13:01] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-23 15:13:01] [INFO ] Invariant cache hit.
[2023-03-23 15:13:02] [INFO ] State equation strengthened by 160 read => feed constraints.
[2023-03-23 15:13:05] [INFO ] Implicit Places using invariants and state equation in 3484 ms returned []
Implicit Place search using SMT with State Equation took 3958 ms to find 0 implicit places.
[2023-03-23 15:13:05] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-23 15:13:05] [INFO ] Flow matrix only has 1126 transitions (discarded 32 similar events)
[2023-03-23 15:13:05] [INFO ] Invariant cache hit.
[2023-03-23 15:13:06] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4757 ms. Remains : 446/446 places, 1158/1158 transitions.
Ending property specific reduction for PolyORBLF-PT-S04J04T08-UpperBounds-12 in 65964 ms.
[2023-03-23 15:13:06] [INFO ] Flatten gal took : 149 ms
[2023-03-23 15:13:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-23 15:13:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 446 places, 1158 transitions and 6153 arcs took 7 ms.
Total runtime 161161 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_S04J04T08
(NrP: 446 NrTr: 1158 NrArc: 6153)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.050sec

net check time: 0m 0.000sec

init dd package: 0m 2.719sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8681904 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16093072 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.012sec

48854 66410 298867 458801 388916 491951 614190 721331 826974 904101 982158 1045317 1142492 1176186 1196079 1215463 1214970 1235032 1261375 1285593 1296843 1292741

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-S04J04T08"
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-S04J04T08, 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-167873951900549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S04J04T08.tgz
mv PolyORBLF-PT-S04J04T08 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;