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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 16K Feb 26 13:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 13:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 26 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 204K Feb 26 13:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 26 13:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Feb 26 13:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 59K Feb 26 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 299K Feb 26 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.1K 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 1.1M 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-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679579479003

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-S02J06T10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 13:51:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 13:51:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 13:51:20] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-23 13:51:20] [INFO ] Transformed 844 places.
[2023-03-23 13:51:20] [INFO ] Transformed 1812 transitions.
[2023-03-23 13:51:20] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Normalized transition count is 1632 out of 1652 initially.
// Phase 1: matrix 1632 rows 844 cols
[2023-03-23 13:51:20] [INFO ] Computed 58 place invariants in 120 ms
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 13) seen :21
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :19
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :19
[2023-03-23 13:51:21] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2023-03-23 13:51:21] [INFO ] Computed 58 place invariants in 61 ms
[2023-03-23 13:51:21] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-23 13:51:21] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 45 ms returned unsat
[2023-03-23 13:51:21] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-23 13:51:22] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 41 ms returned sat
[2023-03-23 13:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:23] [INFO ] [Real]Absence check using state equation in 1554 ms returned sat
[2023-03-23 13:51:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:51:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-23 13:51:23] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 41 ms returned sat
[2023-03-23 13:51:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:28] [INFO ] [Nat]Absence check using state equation in 4854 ms returned unknown
[2023-03-23 13:51:28] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-23 13:51:28] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned sat
[2023-03-23 13:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:30] [INFO ] [Real]Absence check using state equation in 2114 ms returned sat
[2023-03-23 13:51:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:51:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 13:51:31] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 23 ms returned unsat
[2023-03-23 13:51:31] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 13:51:31] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 35 ms returned sat
[2023-03-23 13:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:32] [INFO ] [Real]Absence check using state equation in 1089 ms returned sat
[2023-03-23 13:51:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:51:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-23 13:51:32] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 39 ms returned sat
[2023-03-23 13:51:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:34] [INFO ] [Nat]Absence check using state equation in 1626 ms returned sat
[2023-03-23 13:51:34] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 13:51:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 13:51:37] [INFO ] [Nat]Added 120 Read/Feed constraints in 3229 ms returned unknown
[2023-03-23 13:51:37] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-23 13:51:37] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 40 ms returned sat
[2023-03-23 13:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:39] [INFO ] [Real]Absence check using state equation in 1894 ms returned sat
[2023-03-23 13:51:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:51:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-23 13:51:39] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 62 ms returned sat
[2023-03-23 13:51:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:40] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2023-03-23 13:51:43] [INFO ] [Nat]Added 120 Read/Feed constraints in 2900 ms returned sat
[2023-03-23 13:51:43] [INFO ] Computed and/alt/rep : 780/1548/770 causal constraints (skipped 860 transitions) in 149 ms.
[2023-03-23 13:51:44] [INFO ] Added : 10 causal constraints over 2 iterations in 859 ms. Result :unknown
[2023-03-23 13:51:44] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-23 13:51:44] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned sat
[2023-03-23 13:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:46] [INFO ] [Real]Absence check using state equation in 1582 ms returned sat
[2023-03-23 13:51:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:51:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-23 13:51:46] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 39 ms returned sat
[2023-03-23 13:51:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:50] [INFO ] [Nat]Absence check using state equation in 3715 ms returned sat
[2023-03-23 13:51:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 13:51:51] [INFO ] [Nat]Added 120 Read/Feed constraints in 1162 ms returned unknown
[2023-03-23 13:51:51] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-23 13:51:51] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 59 ms returned unsat
[2023-03-23 13:51:51] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-23 13:51:51] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 39 ms returned unsat
[2023-03-23 13:51:51] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-23 13:51:51] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 39 ms returned unsat
[2023-03-23 13:51:52] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-23 13:51:52] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 45 ms returned sat
[2023-03-23 13:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:53] [INFO ] [Real]Absence check using state equation in 1448 ms returned sat
[2023-03-23 13:51:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:51:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-23 13:51:53] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned sat
[2023-03-23 13:51:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:51:56] [INFO ] [Nat]Absence check using state equation in 2364 ms returned sat
[2023-03-23 13:51:58] [INFO ] [Nat]Added 120 Read/Feed constraints in 2467 ms returned sat
[2023-03-23 13:51:58] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 3 ms to minimize.
[2023-03-23 13:51:58] [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.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 13:51:58] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-23 13:51:58] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 35 ms returned unsat
[2023-03-23 13:51:58] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-23 13:51:58] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 40 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, -1, 1, -1, -1, 100, 1, 1, 1, -1, 1, 1] Max seen :[1, 1, 1, 0, 2, 9, 1, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 51 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 842 transition count 1563
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 180 place count 753 transition count 1563
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 180 place count 753 transition count 1463
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 380 place count 653 transition count 1463
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 498 place count 594 transition count 1404
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 518 place count 594 transition count 1384
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 538 place count 574 transition count 1384
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 539 place count 574 transition count 1384
Applied a total of 539 rules in 299 ms. Remains 574 /844 variables (removed 270) and now considering 1384/1652 (removed 268) transitions.
[2023-03-23 13:51:59] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
// Phase 1: matrix 1364 rows 574 cols
[2023-03-23 13:51:59] [INFO ] Computed 56 place invariants in 22 ms
[2023-03-23 13:52:00] [INFO ] Dead Transitions using invariants and state equation in 1170 ms found 110 transitions.
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 574/844 places, 1274/1652 transitions.
Reduce places removed 2 places and 20 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 572 transition count 1254
Reduce places removed 10 places and 20 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 562 transition count 1234
Deduced a syphon composed of 10 places in 1 ms
Applied a total of 12 rules in 49 ms. Remains 562 /574 variables (removed 12) and now considering 1234/1274 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1523 ms. Remains : 562/844 places, 1234/1652 transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1214 out of 1234 initially.
// Phase 1: matrix 1214 rows 552 cols
[2023-03-23 13:52:00] [INFO ] Computed 56 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 283 resets, run finished after 5970 ms. (steps per millisecond=167 ) properties (out of 4) seen :13
Incomplete Best-First random walk after 1000000 steps, including 820 resets, run finished after 3234 ms. (steps per millisecond=309 ) properties (out of 4) seen :13
Incomplete Best-First random walk after 1000001 steps, including 94 resets, run finished after 2416 ms. (steps per millisecond=413 ) properties (out of 4) seen :13
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2519 ms. (steps per millisecond=396 ) properties (out of 4) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1768 ms. (steps per millisecond=565 ) properties (out of 4) seen :13
[2023-03-23 13:52:16] [INFO ] Flow matrix only has 1214 transitions (discarded 20 similar events)
// Phase 1: matrix 1214 rows 552 cols
[2023-03-23 13:52:16] [INFO ] Computed 56 place invariants in 26 ms
[2023-03-23 13:52:16] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 13:52:16] [INFO ] [Real]Absence check using 15 positive and 41 generalized place invariants in 29 ms returned sat
[2023-03-23 13:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:52:17] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2023-03-23 13:52:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:52:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 13:52:17] [INFO ] [Nat]Absence check using 15 positive and 41 generalized place invariants in 18 ms returned sat
[2023-03-23 13:52:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:52:18] [INFO ] [Nat]Absence check using state equation in 1587 ms returned sat
[2023-03-23 13:52:18] [INFO ] State equation strengthened by 120 read => feed constraints.
[2023-03-23 13:52:21] [INFO ] [Nat]Added 120 Read/Feed constraints in 2040 ms returned sat
[2023-03-23 13:52:21] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 1 ms to minimize.
[2023-03-23 13:52:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 218 ms
[2023-03-23 13:52:21] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 13:52:21] [INFO ] [Real]Absence check using 15 positive and 41 generalized place invariants in 13 ms returned unsat
[2023-03-23 13:52:21] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 13:52:21] [INFO ] [Real]Absence check using 15 positive and 41 generalized place invariants in 20 ms returned sat
[2023-03-23 13:52:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:52:22] [INFO ] [Real]Absence check using state equation in 1087 ms returned sat
[2023-03-23 13:52:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:52:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 13:52:22] [INFO ] [Nat]Absence check using 15 positive and 41 generalized place invariants in 19 ms returned sat
[2023-03-23 13:52:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:52:23] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2023-03-23 13:52:23] [INFO ] [Nat]Added 120 Read/Feed constraints in 541 ms returned sat
[2023-03-23 13:52:24] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 1 ms to minimize.
[2023-03-23 13:52:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 287 ms
[2023-03-23 13:52:24] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 13:52:24] [INFO ] [Real]Absence check using 15 positive and 41 generalized place invariants in 20 ms returned sat
[2023-03-23 13:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 13:52:25] [INFO ] [Real]Absence check using state equation in 1356 ms returned sat
[2023-03-23 13:52:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 13:52:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-23 13:52:25] [INFO ] [Nat]Absence check using 15 positive and 41 generalized place invariants in 22 ms returned sat
[2023-03-23 13:52:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 13:52:27] [INFO ] [Nat]Absence check using state equation in 1874 ms returned sat
[2023-03-23 13:52:27] [INFO ] [Nat]Added 120 Read/Feed constraints in 332 ms returned sat
[2023-03-23 13:52:28] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 2 ms to minimize.
[2023-03-23 13:52:28] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 294 ms
Current structural bounds on expressions (after SMT) : [1, 2, 9, 9, -1] Max seen :[1, 2, 9, 9, 1]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-13 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-07 9 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 67809 ms.
ITS solved all properties within timeout

BK_STOP 1679579549077

--------------------
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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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 ;