fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r295-tall-167873948000493
Last Updated
May 14, 2023

About the Execution of LoLa+red for PolyORBLF-PT-S02J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
397.852 24205.00 34148.00 310.80 1 6 1 1 2 5 2 1 10 1 1 10 2 1 2 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873948000493.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 lolaxred
Input is PolyORBLF-PT-S02J04T06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948000493
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 15K Feb 26 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 14:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Feb 26 14:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Feb 25 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K Feb 26 14:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 227K Feb 26 14:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 31K Feb 26 14:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 177K Feb 26 14:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K 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 862K 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-S02J04T06-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678851335202

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J04T06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 03:35:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-15 03:35:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 03:35:36] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2023-03-15 03:35:36] [INFO ] Transformed 476 places.
[2023-03-15 03:35:36] [INFO ] Transformed 920 transitions.
[2023-03-15 03:35:36] [INFO ] Parsed PT model containing 476 places and 920 transitions and 4242 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 96 transitions
Reduce redundant transitions removed 96 transitions.
Normalized transition count is 812 out of 824 initially.
// Phase 1: matrix 812 rows 476 cols
[2023-03-15 03:35:37] [INFO ] Computed 46 place invariants in 64 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :44
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :35
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 15) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 15) seen :32
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :34
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 15) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) seen :33
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 15) seen :34
[2023-03-15 03:35:37] [INFO ] Flow matrix only has 812 transitions (discarded 12 similar events)
// Phase 1: matrix 812 rows 476 cols
[2023-03-15 03:35:37] [INFO ] Computed 46 place invariants in 27 ms
[2023-03-15 03:35:37] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-15 03:35:37] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned unsat
[2023-03-15 03:35:37] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 03:35:37] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 13 ms returned unsat
[2023-03-15 03:35:38] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-15 03:35:38] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned sat
[2023-03-15 03:35:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 03:35:38] [INFO ] [Real]Absence check using state equation in 429 ms returned sat
[2023-03-15 03:35:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 03:35:38] [INFO ] [Nat]Absence check using 11 positive place invariants in 60 ms returned sat
[2023-03-15 03:35:38] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned unsat
[2023-03-15 03:35:38] [INFO ] [Real]Absence check using 11 positive place invariants in 25 ms returned sat
[2023-03-15 03:35:38] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 16 ms returned unsat
[2023-03-15 03:35:38] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:38] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 16 ms returned unsat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned unsat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 14 ms returned unsat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 10 ms returned unsat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 18 ms returned unsat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 11 ms returned unsat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 21 ms returned unsat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:39] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned sat
[2023-03-15 03:35:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 03:35:40] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2023-03-15 03:35:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 03:35:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:40] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 15 ms returned sat
[2023-03-15 03:35:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 03:35:41] [INFO ] [Nat]Absence check using state equation in 1426 ms returned sat
[2023-03-15 03:35:41] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-15 03:35:42] [INFO ] [Nat]Added 72 Read/Feed constraints in 371 ms returned sat
[2023-03-15 03:35:42] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 56 ms.
[2023-03-15 03:35:45] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 4 ms to minimize.
[2023-03-15 03:35:45] [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 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 03:35:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:45] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 12 ms returned unsat
[2023-03-15 03:35:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:45] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 17 ms returned sat
[2023-03-15 03:35:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 03:35:45] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2023-03-15 03:35:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 03:35:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-15 03:35:46] [INFO ] [Nat]Absence check using 11 positive and 35 generalized place invariants in 16 ms returned sat
[2023-03-15 03:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 03:35:47] [INFO ] [Nat]Absence check using state equation in 1211 ms returned sat
[2023-03-15 03:35:47] [INFO ] [Nat]Added 72 Read/Feed constraints in 516 ms returned sat
[2023-03-15 03:35:47] [INFO ] Computed and/alt/rep : 558/1858/552 causal constraints (skipped 258 transitions) in 63 ms.
[2023-03-15 03:35:51] [INFO ] Added : 110 causal constraints over 22 iterations in 3164 ms. Result :unknown
[2023-03-15 03:35:51] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-15 03:35:51] [INFO ] [Real]Absence check using 11 positive and 35 generalized place invariants in 13 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 6, 1, 1, 2, 5, 2, 1, 10, 1, 1, -1, 1, -1, 1] Max seen :[1, 6, 1, 1, 2, 5, 2, 1, 10, 1, 1, 2, 1, 2, 1]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 824/824 transitions.
Ensure Unique test removed 2 places
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 474 transition count 772
Reduce places removed 52 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 53 rules applied. Total rules applied 107 place count 422 transition count 771
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 108 place count 421 transition count 771
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 108 place count 421 transition count 723
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 204 place count 373 transition count 723
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 298 place count 326 transition count 676
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 310 place count 326 transition count 664
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 322 place count 314 transition count 664
Applied a total of 322 rules in 142 ms. Remains 314 /476 variables (removed 162) and now considering 664/824 (removed 160) transitions.
[2023-03-15 03:35:51] [INFO ] Flow matrix only has 652 transitions (discarded 12 similar events)
// Phase 1: matrix 652 rows 314 cols
[2023-03-15 03:35:51] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-15 03:35:52] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 66 transitions.
Found 66 dead transitions using SMT.
Drop transitions removed 66 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 66 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 314/476 places, 598/824 transitions.
Reduce places removed 2 places and 12 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 586
Reduce places removed 12 places and 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 14 place count 300 transition count 574
Applied a total of 14 rules in 20 ms. Remains 300 /314 variables (removed 14) and now considering 574/598 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 602 ms. Remains : 300/476 places, 574/824 transitions.
Normalized transition count is 562 out of 574 initially.
// Phase 1: matrix 562 rows 300 cols
[2023-03-15 03:35:52] [INFO ] Computed 44 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 589 resets, run finished after 3097 ms. (steps per millisecond=322 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 250 resets, run finished after 1541 ms. (steps per millisecond=648 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000000 steps, including 259 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties (out of 2) seen :4
[2023-03-15 03:35:58] [INFO ] Flow matrix only has 562 transitions (discarded 12 similar events)
// Phase 1: matrix 562 rows 300 cols
[2023-03-15 03:35:58] [INFO ] Computed 44 place invariants in 28 ms
[2023-03-15 03:35:58] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-15 03:35:58] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 2 ms returned unsat
[2023-03-15 03:35:58] [INFO ] [Real]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-15 03:35:58] [INFO ] [Real]Absence check using 14 positive and 30 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2] Max seen :[2, 2]
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T06-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21845 ms.
ITS solved all properties within timeout

BK_STOP 1678851359407

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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-S02J04T06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is PolyORBLF-PT-S02J04T06, 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 r295-tall-167873948000493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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