fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445600309
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-PT-S04J06T10

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16016.323 3600000.00 12632912.00 284.00 4 1 1 1 1 1 4 4 1 1 1 1 1 10 ? 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445600309.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S04J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445600309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.0M
-rw-r--r-- 1 mcc users 21K Apr 11 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 11 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Apr 11 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 11 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 11 17:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 256K Apr 11 17:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 11 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 540K Apr 11 17:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.3M May 18 16:43 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-S04J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S04J06T10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716868977160

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 04:02:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 04:02:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 04:02:59] [INFO ] Load time of PNML (sax parser for PT used): 398 ms
[2024-05-28 04:02:59] [INFO ] Transformed 966 places.
[2024-05-28 04:02:59] [INFO ] Transformed 5354 transitions.
[2024-05-28 04:02:59] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 563 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 2710 transitions
Reduce redundant transitions removed 2710 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 10, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 10, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 04:02:59] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2024-05-28 04:02:59] [INFO ] Computed 62 invariants in 265 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 10, 1, 0] Max Struct:[+inf, +inf, 535, +inf, +inf, 130, +inf, +inf, 4, +inf, 1, 535, +inf, +inf, 10, +inf]
RANDOM walk for 10000 steps (2 resets) in 130 ms. (76 steps per ms)
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150011 steps (31 resets) in 636 ms. (235 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 10, 1, 1] Max Struct:[+inf, +inf, 535, +inf, +inf, 130, +inf, +inf, 4, +inf, 535, +inf, +inf, 10, +inf]
[2024-05-28 04:03:00] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-05-28 04:03:00] [INFO ] Invariant cache hit.
[2024-05-28 04:03:00] [INFO ] [Real]Absence check using 16 positive place invariants in 23 ms returned sat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 16 ms returned unsat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 41 ms returned unsat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 32 ms returned unsat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 71 ms returned unsat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 17 ms returned unsat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 48 ms returned unsat
[2024-05-28 04:03:01] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 10 ms returned unsat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 32 ms returned unsat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 8 ms returned unsat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 39 ms returned unsat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 33 ms returned unsat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 16 ms returned unsat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 04:03:02] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 34 ms returned unsat
[2024-05-28 04:03:03] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 04:03:03] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 37 ms returned sat
[2024-05-28 04:03:05] [INFO ] [Real]Absence check using state equation in 2056 ms returned sat
[2024-05-28 04:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:03:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 04:03:05] [INFO ] [Nat]Absence check using 16 positive and 46 generalized place invariants in 36 ms returned sat
[2024-05-28 04:03:06] [INFO ] [Nat]Absence check using state equation in 1405 ms returned sat
[2024-05-28 04:03:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 04:03:07] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 04:03:07] [INFO ] [Nat]Added 200 Read/Feed constraints in 737 ms returned sat
[2024-05-28 04:03:08] [INFO ] Deduced a trap composed of 83 places in 720 ms of which 58 ms to minimize.
[2024-05-28 04:03:09] [INFO ] Deduced a trap composed of 83 places in 613 ms of which 7 ms to minimize.
[2024-05-28 04:03:09] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-28 04:03:09] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-28 04:03:10] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 2 ms to minimize.
[2024-05-28 04:03:10] [INFO ] Deduced a trap composed of 84 places in 79 ms of which 1 ms to minimize.
[2024-05-28 04:03:10] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
[2024-05-28 04:03:10] [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 13
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 04:03:10] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2024-05-28 04:03:10] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 38 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[4, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 10, 1, 1] Max Struct:[4, 1, 1, 1, 1, 1, 4, 4, 1, 1, 1, 1, 10, 10, 1]
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 966/966 places, 2644/2644 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 962 transition count 2554
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 184 place count 872 transition count 2554
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 120 Pre rules applied. Total rules applied 184 place count 872 transition count 2434
Deduced a syphon composed of 120 places in 3 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 240 rules applied. Total rules applied 424 place count 752 transition count 2434
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 4 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 2 with 198 rules applied. Total rules applied 622 place count 653 transition count 2335
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 642 place count 653 transition count 2315
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 662 place count 633 transition count 2315
Applied a total of 662 rules in 446 ms. Remains 633 /966 variables (removed 333) and now considering 2315/2644 (removed 329) transitions.
Running 2311 sub problems to find dead transitions.
[2024-05-28 04:03:11] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
// Phase 1: matrix 2275 rows 633 cols
[2024-05-28 04:03:11] [INFO ] Computed 58 invariants in 90 ms
[2024-05-28 04:03:11] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/2908 variables, and 54 constraints, problems are : Problem set: 0 solved, 2311 unsolved in 20074 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/633 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2311/2311 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 2311 unsolved
[2024-05-28 04:03:55] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 4 ms to minimize.
[2024-05-28 04:03:55] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 3 ms to minimize.
[2024-05-28 04:03:55] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 2 ms to minimize.
[2024-05-28 04:03:55] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 2 ms to minimize.
[2024-05-28 04:03:55] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 1 ms to minimize.
[2024-05-28 04:03:56] [INFO ] Deduced a trap composed of 50 places in 101 ms of which 1 ms to minimize.
[2024-05-28 04:03:56] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2024-05-28 04:03:56] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 1 ms to minimize.
[2024-05-28 04:03:56] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2024-05-28 04:03:56] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-05-28 04:03:57] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 4 ms to minimize.
[2024-05-28 04:03:59] [INFO ] Deduced a trap composed of 257 places in 667 ms of which 5 ms to minimize.
[2024-05-28 04:04:00] [INFO ] Deduced a trap composed of 207 places in 569 ms of which 5 ms to minimize.
[2024-05-28 04:04:04] [INFO ] Deduced a trap composed of 80 places in 529 ms of which 4 ms to minimize.
[2024-05-28 04:04:07] [INFO ] Deduced a trap composed of 218 places in 565 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 629/2908 variables, and 69 constraints, problems are : Problem set: 0 solved, 2311 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/42 constraints, State Equation: 0/633 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2311 constraints, Known Traps: 15/15 constraints]
After SMT, in 58737ms problems are : Problem set: 0 solved, 2311 unsolved
Search for dead transitions found 0 dead transitions in 58781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59268 ms. Remains : 633/966 places, 2315/2644 transitions.
[2024-05-28 04:04:09] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
[2024-05-28 04:04:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (60 resets) in 11797 ms. (84 steps per ms)
BEST_FIRST walk for 1000000 steps (19 resets) in 3917 ms. (255 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-28 04:04:25] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
[2024-05-28 04:04:25] [INFO ] Invariant cache hit.
[2024-05-28 04:04:25] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 04:04:25] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 34 ms returned sat
[2024-05-28 04:04:28] [INFO ] [Real]Absence check using state equation in 2861 ms returned sat
[2024-05-28 04:04:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:04:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-05-28 04:04:28] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 27 ms returned sat
[2024-05-28 04:04:40] [INFO ] [Nat]Absence check using state equation in 11552 ms returned sat
[2024-05-28 04:04:40] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 04:04:42] [INFO ] [Nat]Added 200 Read/Feed constraints in 1801 ms returned sat
[2024-05-28 04:04:42] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 2 ms to minimize.
[2024-05-28 04:04:42] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-28 04:04:43] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2024-05-28 04:04:44] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2024-05-28 04:04:44] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 1 ms to minimize.
[2024-05-28 04:04:45] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2024-05-28 04:04:46] [INFO ] Deduced a trap composed of 261 places in 659 ms of which 5 ms to minimize.
[2024-05-28 04:04:48] [INFO ] Deduced a trap composed of 286 places in 703 ms of which 5 ms to minimize.
[2024-05-28 04:04:48] [INFO ] Deduced a trap composed of 263 places in 599 ms of which 5 ms to minimize.
[2024-05-28 04:04:53] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 11082 ms
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 2315/2315 transitions.
Applied a total of 0 rules in 80 ms. Remains 633 /633 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 633/633 places, 2315/2315 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 2315/2315 transitions.
Applied a total of 0 rules in 76 ms. Remains 633 /633 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
[2024-05-28 04:04:53] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
[2024-05-28 04:04:53] [INFO ] Invariant cache hit.
[2024-05-28 04:04:54] [INFO ] Implicit Places using invariants in 1068 ms returned [66, 145, 180, 223, 305, 342, 364, 436, 474, 553]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1079 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 623/633 places, 2315/2315 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 617 transition count 2309
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 617 transition count 2309
Applied a total of 12 rules in 91 ms. Remains 617 /623 variables (removed 6) and now considering 2309/2315 (removed 6) transitions.
[2024-05-28 04:04:54] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
// Phase 1: matrix 2269 rows 617 cols
[2024-05-28 04:04:55] [INFO ] Computed 48 invariants in 91 ms
[2024-05-28 04:04:56] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2024-05-28 04:04:56] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:04:56] [INFO ] Invariant cache hit.
[2024-05-28 04:04:57] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 04:05:28] [INFO ] Performed 303/617 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 04:05:45] [INFO ] Implicit Places using invariants and state equation in 49623 ms returned []
Implicit Place search using SMT with State Equation took 50816 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 617/633 places, 2309/2315 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 52063 ms. Remains : 617/633 places, 2309/2315 transitions.
[2024-05-28 04:05:45] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:05:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (78 resets) in 11147 ms. (89 steps per ms)
BEST_FIRST walk for 1000001 steps (27 resets) in 3533 ms. (282 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-28 04:06:00] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:06:00] [INFO ] Invariant cache hit.
[2024-05-28 04:06:00] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 04:06:00] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 34 ms returned sat
[2024-05-28 04:06:03] [INFO ] [Real]Absence check using state equation in 2824 ms returned sat
[2024-05-28 04:06:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:06:03] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 04:06:03] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 28 ms returned sat
[2024-05-28 04:06:08] [INFO ] [Nat]Absence check using state equation in 5233 ms returned sat
[2024-05-28 04:06:08] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 04:06:11] [INFO ] [Nat]Added 200 Read/Feed constraints in 2694 ms returned sat
[2024-05-28 04:06:11] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2024-05-28 04:06:12] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-28 04:06:13] [INFO ] Deduced a trap composed of 23 places in 688 ms of which 5 ms to minimize.
[2024-05-28 04:06:15] [INFO ] Deduced a trap composed of 289 places in 653 ms of which 6 ms to minimize.
[2024-05-28 04:06:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3901 ms
[2024-05-28 04:06:15] [INFO ] Computed and/alt/rep : 985/2945/955 causal constraints (skipped 1310 transitions) in 231 ms.
[2024-05-28 04:06:23] [INFO ] Added : 57 causal constraints over 12 iterations in 7923 ms. Result :sat
Minimization took 5094 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 2309/2309 transitions.
Applied a total of 0 rules in 107 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 617/617 places, 2309/2309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 2309/2309 transitions.
Applied a total of 0 rules in 74 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2024-05-28 04:06:28] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:06:28] [INFO ] Invariant cache hit.
[2024-05-28 04:06:29] [INFO ] Implicit Places using invariants in 1108 ms returned []
[2024-05-28 04:06:29] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:06:29] [INFO ] Invariant cache hit.
[2024-05-28 04:06:31] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 04:07:01] [INFO ] Performed 288/617 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 04:07:20] [INFO ] Implicit Places using invariants and state equation in 50157 ms returned []
Implicit Place search using SMT with State Equation took 51272 ms to find 0 implicit places.
[2024-05-28 04:07:20] [INFO ] Redundant transitions in 181 ms returned []
Running 2305 sub problems to find dead transitions.
[2024-05-28 04:07:20] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:07:20] [INFO ] Invariant cache hit.
[2024-05-28 04:07:20] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-05-28 04:07:59] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-28 04:07:59] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-05-28 04:08:06] [INFO ] Deduced a trap composed of 42 places in 149 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/2886 variables, and 42 constraints, problems are : Problem set: 0 solved, 2305 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2305/2305 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-05-28 04:08:21] [INFO ] Deduced a trap composed of 51 places in 531 ms of which 4 ms to minimize.
[2024-05-28 04:08:21] [INFO ] Deduced a trap composed of 50 places in 138 ms of which 3 ms to minimize.
[2024-05-28 04:08:21] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2024-05-28 04:08:21] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-28 04:08:21] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 1 ms to minimize.
[2024-05-28 04:08:21] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 0 ms to minimize.
[2024-05-28 04:08:21] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 1 ms to minimize.
[2024-05-28 04:08:22] [INFO ] Deduced a trap composed of 39 places in 319 ms of which 3 ms to minimize.
[2024-05-28 04:08:22] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-28 04:08:22] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/2886 variables, and 52 constraints, problems are : Problem set: 0 solved, 2305 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2305 constraints, Known Traps: 13/13 constraints]
After SMT, in 80117ms problems are : Problem set: 0 solved, 2305 unsolved
Search for dead transitions found 0 dead transitions in 80170ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131735 ms. Remains : 617/617 places, 2309/2309 transitions.
RANDOM walk for 40000 steps (8 resets) in 1177 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 404 ms. (98 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 371 ms. (107 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 104600 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 2
Probabilistic random walk after 104600 steps, saw 80839 distinct states, run finished after 3006 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-28 04:08:44] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:08:44] [INFO ] Invariant cache hit.
[2024-05-28 04:08:44] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 492/504 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 29/533 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 04:08:44] [INFO ] Deduced a trap composed of 57 places in 327 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 8 (OVERLAPS) 81/614 variables, 29/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/615 variables, 1/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2884/2886 variables, and 663 constraints, problems are : Problem set: 1 solved, 1 unsolved in 4897 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 615/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 492/504 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/533 variables, 13/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/614 variables, 29/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 04:08:49] [INFO ] Deduced a trap composed of 51 places in 216 ms of which 3 ms to minimize.
[2024-05-28 04:08:49] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 3 ms to minimize.
[2024-05-28 04:08:49] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 2 ms to minimize.
[2024-05-28 04:08:49] [INFO ] Deduced a trap composed of 51 places in 173 ms of which 2 ms to minimize.
[2024-05-28 04:08:50] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 2 ms to minimize.
[2024-05-28 04:08:50] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2024-05-28 04:08:50] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 14 ms to minimize.
[2024-05-28 04:08:50] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 8/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/615 variables, 1/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2884/2886 variables, and 671 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 615/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 9943ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 2309/2309 transitions.
Applied a total of 0 rules in 77 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
Running 2305 sub problems to find dead transitions.
[2024-05-28 04:08:54] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:08:54] [INFO ] Invariant cache hit.
[2024-05-28 04:08:54] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-05-28 04:09:33] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 2 ms to minimize.
[2024-05-28 04:09:34] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 2.0)
(s6 1.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 8.0)
(s11 0.0)
(s12 2.0)
(s13 1.0)
(s14 0.0)
(s15 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/2886 variables, and 41 constraints, problems are : Problem set: 0 solved, 2305 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2305/2305 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-05-28 04:09:38] [INFO ] Deduced a trap composed of 50 places in 601 ms of which 5 ms to minimize.
[2024-05-28 04:09:39] [INFO ] Deduced a trap composed of 51 places in 599 ms of which 5 ms to minimize.
[2024-05-28 04:09:40] [INFO ] Deduced a trap composed of 39 places in 687 ms of which 4 ms to minimize.
[2024-05-28 04:09:40] [INFO ] Deduced a trap composed of 50 places in 582 ms of which 5 ms to minimize.
[2024-05-28 04:09:41] [INFO ] Deduced a trap composed of 50 places in 541 ms of which 5 ms to minimize.
[2024-05-28 04:09:41] [INFO ] Deduced a trap composed of 42 places in 528 ms of which 4 ms to minimize.
[2024-05-28 04:09:42] [INFO ] Deduced a trap composed of 51 places in 413 ms of which 4 ms to minimize.
[2024-05-28 04:09:42] [INFO ] Deduced a trap composed of 51 places in 383 ms of which 3 ms to minimize.
[2024-05-28 04:09:42] [INFO ] Deduced a trap composed of 45 places in 356 ms of which 3 ms to minimize.
[2024-05-28 04:09:43] [INFO ] Deduced a trap composed of 39 places in 344 ms of which 3 ms to minimize.
[2024-05-28 04:09:43] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-28 04:09:43] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-05-28 04:09:43] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 2 ms to minimize.
[2024-05-28 04:09:48] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/2886 variables, and 55 constraints, problems are : Problem set: 0 solved, 2305 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2305 constraints, Known Traps: 16/16 constraints]
After SMT, in 60965ms problems are : Problem set: 0 solved, 2305 unsolved
Search for dead transitions found 0 dead transitions in 61004ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61095 ms. Remains : 617/617 places, 2309/2309 transitions.
RANDOM walk for 40000 steps (9 resets) in 902 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 143868 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 1
Probabilistic random walk after 143868 steps, saw 110848 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
[2024-05-28 04:09:58] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:09:58] [INFO ] Invariant cache hit.
[2024-05-28 04:09:58] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 492/504 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/533 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:09:58] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 3 ms to minimize.
[2024-05-28 04:09:59] [INFO ] Deduced a trap composed of 57 places in 252 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/614 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/615 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2269/2884 variables, 615/664 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2884 variables, 200/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2884 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2886 variables, 2/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2886 variables, 1/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2886 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2886 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2886/2886 variables, and 867 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 617/617 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 492/504 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/533 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 81/614 variables, 29/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 04:10:01] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 2 ms to minimize.
[2024-05-28 04:10:01] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 3 ms to minimize.
[2024-05-28 04:10:01] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 2 ms to minimize.
[2024-05-28 04:10:01] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 2 ms to minimize.
[2024-05-28 04:10:01] [INFO ] Deduced a trap composed of 50 places in 124 ms of which 2 ms to minimize.
[2024-05-28 04:10:02] [INFO ] Deduced a trap composed of 50 places in 82 ms of which 2 ms to minimize.
[2024-05-28 04:10:02] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 1 ms to minimize.
[2024-05-28 04:10:02] [INFO ] Deduced a trap composed of 50 places in 69 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/615 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/615 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2884/2886 variables, and 672 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45014 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 615/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 47258ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 2309/2309 transitions.
Applied a total of 0 rules in 53 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 617/617 places, 2309/2309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 2309/2309 transitions.
Applied a total of 0 rules in 52 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2024-05-28 04:10:45] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:10:45] [INFO ] Invariant cache hit.
[2024-05-28 04:10:47] [INFO ] Implicit Places using invariants in 1231 ms returned []
[2024-05-28 04:10:47] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:10:47] [INFO ] Invariant cache hit.
[2024-05-28 04:10:48] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-28 04:11:18] [INFO ] Performed 316/617 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-28 04:11:35] [INFO ] Implicit Places using invariants and state equation in 48598 ms returned []
Implicit Place search using SMT with State Equation took 49833 ms to find 0 implicit places.
[2024-05-28 04:11:35] [INFO ] Redundant transitions in 133 ms returned []
Running 2305 sub problems to find dead transitions.
[2024-05-28 04:11:35] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:11:35] [INFO ] Invariant cache hit.
[2024-05-28 04:11:35] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-05-28 04:12:16] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 2 ms to minimize.
[2024-05-28 04:12:16] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 2 ms to minimize.
[2024-05-28 04:12:23] [INFO ] Deduced a trap composed of 42 places in 194 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/2886 variables, and 42 constraints, problems are : Problem set: 0 solved, 2305 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 2305/2305 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-05-28 04:12:38] [INFO ] Deduced a trap composed of 51 places in 520 ms of which 3 ms to minimize.
[2024-05-28 04:12:38] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 2 ms to minimize.
[2024-05-28 04:12:38] [INFO ] Deduced a trap composed of 50 places in 116 ms of which 1 ms to minimize.
[2024-05-28 04:12:38] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-05-28 04:12:38] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-28 04:12:38] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2024-05-28 04:12:39] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2024-05-28 04:12:39] [INFO ] Deduced a trap composed of 39 places in 480 ms of which 4 ms to minimize.
[2024-05-28 04:12:39] [INFO ] Deduced a trap composed of 51 places in 44 ms of which 0 ms to minimize.
[2024-05-28 04:12:40] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/2886 variables, and 52 constraints, problems are : Problem set: 0 solved, 2305 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 23/32 constraints, State Equation: 0/617 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/2305 constraints, Known Traps: 13/13 constraints]
After SMT, in 81649ms problems are : Problem set: 0 solved, 2305 unsolved
Search for dead transitions found 0 dead transitions in 81687ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131724 ms. Remains : 617/617 places, 2309/2309 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1] Max Struct:[10]
Starting property specific reduction for PolyORBLF-PT-S04J06T10-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[10]
[2024-05-28 04:12:57] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:12:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 10000 steps (2 resets) in 110 ms. (90 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 36 ms. (270 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-28 04:12:57] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:12:57] [INFO ] Invariant cache hit.
[2024-05-28 04:12:57] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-28 04:12:57] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 26 ms returned sat
[2024-05-28 04:12:59] [INFO ] [Real]Absence check using state equation in 1738 ms returned sat
[2024-05-28 04:12:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 04:12:59] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-28 04:12:59] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 30 ms returned sat
[2024-05-28 04:13:01] [INFO ] [Nat]Absence check using state equation in 1703 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 617/617 places, 2309/2309 transitions.
Applied a total of 0 rules in 80 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
Running 2305 sub problems to find dead transitions.
[2024-05-28 04:13:01] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-05-28 04:13:01] [INFO ] Invariant cache hit.
[2024-05-28 04:13:01] [INFO ] State equation strengthened by 200 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S04J06T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 966
TRANSITIONS: 5354
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.253s, Sys 0.026s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.043s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1019
MODEL NAME: /home/mcc/execution/model
966 places, 5354 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-S04J06T10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S04J06T10, 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 r289-tajo-171654445600309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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