About the Execution of LTSMin+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 |
| 16204.016 | 547720.00 | 689777.00 | 1832.40 | 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.r516-tajo-171654446800309.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 ltsminxred
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 r516-tajo-171654446800309
=====================================================================
--------------------
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 1717255169160
Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:19:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 15:19:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:19:31] [INFO ] Load time of PNML (sax parser for PT used): 514 ms
[2024-06-01 15:19:31] [INFO ] Transformed 966 places.
[2024-06-01 15:19:31] [INFO ] Transformed 5354 transitions.
[2024-06-01 15:19:31] [INFO ] Parsed PT model containing 966 places and 5354 transitions and 36134 arcs in 779 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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-06-01 15:19:31] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
// Phase 1: matrix 2604 rows 966 cols
[2024-06-01 15:19:31] [INFO ] Computed 62 invariants in 195 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 294 ms. (33 steps per ms)
FORMULA PolyORBLF-PT-S04J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150009 steps (30 resets) in 672 ms. (222 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-06-01 15:19:32] [INFO ] Flow matrix only has 2604 transitions (discarded 40 similar events)
[2024-06-01 15:19:32] [INFO ] Invariant cache hit.
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 12 ms returned unsat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive place invariants in 15 ms returned sat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 56 ms returned unsat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 36 ms returned unsat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 37 ms returned unsat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 20 ms returned unsat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-06-01 15:19:33] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 36 ms returned unsat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 24 ms returned unsat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 38 ms returned unsat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive place invariants in 26 ms returned sat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 9 ms returned unsat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive place invariants in 16 ms returned sat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 37 ms returned unsat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 75 ms returned unsat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-06-01 15:19:34] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 21 ms returned unsat
[2024-06-01 15:19:35] [INFO ] [Real]Absence check using 16 positive place invariants in 12 ms returned sat
[2024-06-01 15:19:35] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 36 ms returned unsat
[2024-06-01 15:19:35] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:19:35] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 36 ms returned sat
[2024-06-01 15:19:37] [INFO ] [Real]Absence check using state equation in 2082 ms returned sat
[2024-06-01 15:19:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:19:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:19:37] [INFO ] [Nat]Absence check using 16 positive and 46 generalized place invariants in 38 ms returned sat
[2024-06-01 15:19:39] [INFO ] [Nat]Absence check using state equation in 1441 ms returned sat
[2024-06-01 15:19:39] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:19:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 15:19:39] [INFO ] [Nat]Added 200 Read/Feed constraints in 792 ms returned sat
[2024-06-01 15:19:40] [INFO ] Deduced a trap composed of 83 places in 816 ms of which 56 ms to minimize.
[2024-06-01 15:19:41] [INFO ] Deduced a trap composed of 83 places in 749 ms of which 15 ms to minimize.
[2024-06-01 15:19:42] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 2 ms to minimize.
[2024-06-01 15:19:42] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:19:42] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 2 ms to minimize.
[2024-06-01 15:19:43] [INFO ] Deduced a trap composed of 2 places in 824 ms of which 7 ms to minimize.
[2024-06-01 15:19:43] [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-06-01 15:19:43] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 15:19:43] [INFO ] [Real]Absence check using 16 positive and 46 generalized place invariants in 35 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 4 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 3 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 434 ms. Remains 633 /966 variables (removed 333) and now considering 2315/2644 (removed 329) transitions.
Running 2311 sub problems to find dead transitions.
[2024-06-01 15:19:43] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
// Phase 1: matrix 2275 rows 633 cols
[2024-06-01 15:19:44] [INFO ] Computed 58 invariants in 74 ms
[2024-06-01 15:19:44] [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
SMT process timed out in 38097ms, After SMT, problems are : Problem set: 0 solved, 2311 unsolved
Search for dead transitions found 0 dead transitions in 38147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38625 ms. Remains : 633/966 places, 2315/2644 transitions.
[2024-06-01 15:20:22] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
[2024-06-01 15:20:22] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (70 resets) in 11888 ms. (84 steps per ms)
BEST_FIRST walk for 1000001 steps (23 resets) in 3966 ms. (252 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-06-01 15:20:37] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
[2024-06-01 15:20:37] [INFO ] Invariant cache hit.
[2024-06-01 15:20:38] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-06-01 15:20:38] [INFO ] [Real]Absence check using 16 positive and 42 generalized place invariants in 35 ms returned sat
[2024-06-01 15:20:40] [INFO ] [Real]Absence check using state equation in 2717 ms returned sat
[2024-06-01 15:20:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:20:41] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-06-01 15:20:41] [INFO ] [Nat]Absence check using 16 positive and 42 generalized place invariants in 35 ms returned sat
[2024-06-01 15:20:51] [INFO ] [Nat]Absence check using state equation in 10676 ms returned sat
[2024-06-01 15:20:51] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:20:53] [INFO ] [Nat]Added 200 Read/Feed constraints in 1813 ms returned sat
[2024-06-01 15:20:53] [INFO ] Deduced a trap composed of 51 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:20:54] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 11 ms to minimize.
[2024-06-01 15:20:55] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 1 ms to minimize.
[2024-06-01 15:20:55] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2024-06-01 15:20:56] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-01 15:20:57] [INFO ] Deduced a trap composed of 261 places in 719 ms of which 5 ms to minimize.
[2024-06-01 15:20:59] [INFO ] Deduced a trap composed of 286 places in 698 ms of which 5 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 263 places in 676 ms of which 4 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Trap strengthening (SAT) tested/added 9/9 trap constraints in 10926 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 74 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 75 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 69 ms. Remains 633 /633 variables (removed 0) and now considering 2315/2315 (removed 0) transitions.
[2024-06-01 15:21:04] [INFO ] Flow matrix only has 2275 transitions (discarded 40 similar events)
[2024-06-01 15:21:05] [INFO ] Invariant cache hit.
[2024-06-01 15:21:06] [INFO ] Implicit Places using invariants in 1076 ms returned [66, 145, 180, 223, 305, 342, 364, 436, 474, 553]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1083 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 73 ms. Remains 617 /623 variables (removed 6) and now considering 2309/2315 (removed 6) transitions.
[2024-06-01 15:21:06] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
// Phase 1: matrix 2269 rows 617 cols
[2024-06-01 15:21:06] [INFO ] Computed 48 invariants in 42 ms
[2024-06-01 15:21:07] [INFO ] Implicit Places using invariants in 1096 ms returned []
[2024-06-01 15:21:07] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:21:07] [INFO ] Invariant cache hit.
[2024-06-01 15:21:08] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:21:38] [INFO ] Performed 362/617 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:21:51] [INFO ] Implicit Places using invariants and state equation in 44488 ms returned []
Implicit Place search using SMT with State Equation took 45589 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 46816 ms. Remains : 617/633 places, 2309/2315 transitions.
[2024-06-01 15:21:51] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:21:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (84 resets) in 10434 ms. (95 steps per ms)
BEST_FIRST walk for 1000001 steps (25 resets) in 3061 ms. (326 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-06-01 15:22:05] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:22:05] [INFO ] Invariant cache hit.
[2024-06-01 15:22:05] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 15:22:05] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 23 ms returned sat
[2024-06-01 15:22:07] [INFO ] [Real]Absence check using state equation in 2373 ms returned sat
[2024-06-01 15:22:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:22:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2024-06-01 15:22:07] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 21 ms returned sat
[2024-06-01 15:22:12] [INFO ] [Nat]Absence check using state equation in 4804 ms returned sat
[2024-06-01 15:22:12] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:22:15] [INFO ] [Nat]Added 200 Read/Feed constraints in 2398 ms returned sat
[2024-06-01 15:22:15] [INFO ] Deduced a trap composed of 50 places in 70 ms of which 1 ms to minimize.
[2024-06-01 15:22:16] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 1 ms to minimize.
[2024-06-01 15:22:17] [INFO ] Deduced a trap composed of 23 places in 497 ms of which 4 ms to minimize.
[2024-06-01 15:22:18] [INFO ] Deduced a trap composed of 289 places in 549 ms of which 4 ms to minimize.
[2024-06-01 15:22:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3431 ms
[2024-06-01 15:22:18] [INFO ] Computed and/alt/rep : 985/2945/955 causal constraints (skipped 1310 transitions) in 221 ms.
[2024-06-01 15:22:25] [INFO ] Added : 57 causal constraints over 12 iterations in 7001 ms. Result :sat
Minimization took 5079 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 67 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 67 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 72 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2024-06-01 15:22:30] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:22:30] [INFO ] Invariant cache hit.
[2024-06-01 15:22:31] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-06-01 15:22:31] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:22:31] [INFO ] Invariant cache hit.
[2024-06-01 15:22:33] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:23:03] [INFO ] Performed 350/617 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:23:17] [INFO ] Implicit Places using invariants and state equation in 46028 ms returned []
Implicit Place search using SMT with State Equation took 46965 ms to find 0 implicit places.
[2024-06-01 15:23:17] [INFO ] Redundant transitions in 147 ms returned []
Running 2305 sub problems to find dead transitions.
[2024-06-01 15:23:18] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:23:18] [INFO ] Invariant cache hit.
[2024-06-01 15:23:18] [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-06-01 15:23:56] [INFO ] Deduced a trap composed of 20 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:23:56] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:24:02] [INFO ] Deduced a trap composed of 42 places in 180 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 30046 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-06-01 15:24:18] [INFO ] Deduced a trap composed of 51 places in 472 ms of which 4 ms to minimize.
[2024-06-01 15:24:18] [INFO ] Deduced a trap composed of 50 places in 143 ms of which 1 ms to minimize.
[2024-06-01 15:24:18] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 2 ms to minimize.
[2024-06-01 15:24:18] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-01 15:24:18] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:24:19] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
[2024-06-01 15:24:19] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:24:19] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 3 ms to minimize.
[2024-06-01 15:24:19] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 0 ms to minimize.
[2024-06-01 15:24:20] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
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 30038 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 80652ms problems are : Problem set: 0 solved, 2305 unsolved
Search for dead transitions found 0 dead transitions in 80675ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127893 ms. Remains : 617/617 places, 2309/2309 transitions.
RANDOM walk for 40000 steps (8 resets) in 1492 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 393 ms. (101 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (10 resets) in 387 ms. (103 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 112147 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 2
Probabilistic random walk after 112147 steps, saw 86611 distinct states, run finished after 3004 ms. (steps per millisecond=37 ) properties seen :0
[2024-06-01 15:24:42] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:24:42] [INFO ] Invariant cache hit.
[2024-06-01 15:24:42] [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-06-01 15:24:42] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 2 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 4631 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-06-01 15:24:47] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 4 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 50 places in 228 ms of which 7 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 3 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 2 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 9 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 1 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:24:48] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 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 5006 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 9682ms 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 79 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
Running 2305 sub problems to find dead transitions.
[2024-06-01 15:24:52] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:24:52] [INFO ] Invariant cache hit.
[2024-06-01 15:24:52] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 2.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 2.0)
(s11 1.0)
(s12 2.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 3.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 4.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 2.0)
(s66 1.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 2.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 3.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 4.0)
(s104 1.0)
(s105 1.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 3.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 3.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 4.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 1.0)
(s155 2.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 0.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 4.0)
(s206 1.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 2.0)
(s227 1.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 1.0)
(s244 9.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 0.0)
(s264 1.0)
(s265 0.0)
(s266 4.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 4.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 4.0)
(s304 1.0)
(s305 0.0)
(s306 3.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 3.0)
(s320 0.0)
(s322 1.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 0.0)
(s349 1.0)
(s350 1.0)
(s351 0.0)
(s352 2.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 1.0)
(s368 0.0)
(s369 3.0)
(s370 1.0)
(s371 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
SMT process timed out in 39867ms, After SMT, problems are : Problem set: 0 solved, 2305 unsolved
Search for dead transitions found 0 dead transitions in 39937ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40028 ms. Remains : 617/617 places, 2309/2309 transitions.
RANDOM walk for 40000 steps (10 resets) in 832 ms. (48 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 155451 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 1
Probabilistic random walk after 155451 steps, saw 119542 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 15:25:35] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:25:35] [INFO ] Invariant cache hit.
[2024-06-01 15:25:35] [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-06-01 15:25:36] [INFO ] Deduced a trap composed of 62 places in 311 ms of which 9 ms to minimize.
[2024-06-01 15:25:36] [INFO ] Deduced a trap composed of 57 places in 248 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 2248 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-06-01 15:25:38] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 3 ms to minimize.
[2024-06-01 15:25:38] [INFO ] Deduced a trap composed of 51 places in 198 ms of which 3 ms to minimize.
[2024-06-01 15:25:38] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:25:38] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2024-06-01 15:25:38] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-06-01 15:25:39] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 2 ms to minimize.
[2024-06-01 15:25:39] [INFO ] Deduced a trap composed of 51 places in 56 ms of which 2 ms to minimize.
[2024-06-01 15:25:39] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 2 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 45018 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 47286ms 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 51 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 52 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 45 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
[2024-06-01 15:26:22] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:26:22] [INFO ] Invariant cache hit.
[2024-06-01 15:26:24] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2024-06-01 15:26:24] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:26:24] [INFO ] Invariant cache hit.
[2024-06-01 15:26:25] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 15:26:55] [INFO ] Performed 394/617 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 15:27:05] [INFO ] Implicit Places using invariants and state equation in 41766 ms returned []
Implicit Place search using SMT with State Equation took 42835 ms to find 0 implicit places.
[2024-06-01 15:27:05] [INFO ] Redundant transitions in 63 ms returned []
Running 2305 sub problems to find dead transitions.
[2024-06-01 15:27:05] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:27:05] [INFO ] Invariant cache hit.
[2024-06-01 15:27:05] [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-06-01 15:27:42] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 2 ms to minimize.
[2024-06-01 15:27:42] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-06-01 15:27:47] [INFO ] Deduced a trap composed of 42 places in 158 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 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: 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-06-01 15:28:05] [INFO ] Deduced a trap composed of 51 places in 377 ms of which 3 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 50 places in 169 ms of which 1 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 8 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 52 places in 88 ms of which 1 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:28:06] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:28:06] [INFO ] Deduced a trap composed of 39 places in 369 ms of which 3 ms to minimize.
[2024-06-01 15:28:06] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:28:07] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 2305 unsolved
[2024-06-01 15:28:25] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 613/2886 variables, and 53 constraints, problems are : Problem set: 0 solved, 2305 unsolved in 30028 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: 14/14 constraints]
After SMT, in 80587ms problems are : Problem set: 0 solved, 2305 unsolved
Search for dead transitions found 0 dead transitions in 80608ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123566 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-06-01 15:28:26] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:28:26] [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 104 ms. (95 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 33 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-06-01 15:28:26] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:28:26] [INFO ] Invariant cache hit.
[2024-06-01 15:28:26] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-06-01 15:28:26] [INFO ] [Real]Absence check using 16 positive and 32 generalized place invariants in 33 ms returned sat
[2024-06-01 15:28:29] [INFO ] [Real]Absence check using state equation in 2429 ms returned sat
[2024-06-01 15:28:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:28:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2024-06-01 15:28:29] [INFO ] [Nat]Absence check using 16 positive and 32 generalized place invariants in 29 ms returned sat
[2024-06-01 15:28:31] [INFO ] [Nat]Absence check using state equation in 1610 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 54 ms. Remains 617 /617 variables (removed 0) and now considering 2309/2309 (removed 0) transitions.
Running 2305 sub problems to find dead transitions.
[2024-06-01 15:28:31] [INFO ] Flow matrix only has 2269 transitions (discarded 40 similar events)
[2024-06-01 15:28:31] [INFO ] Invariant cache hit.
[2024-06-01 15:28:31] [INFO ] State equation strengthened by 200 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-00
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-01
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-02
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-03
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-04
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-05
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-06
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-07
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-08
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-09
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-10
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-11
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-12
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-13
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-14
Could not compute solution for formula : PolyORBLF-PT-S04J06T10-UpperBounds-15
BK_STOP 1717255716880
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2024
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-00
ub formula formula --maxsum=/tmp/884/ub_0_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-01
ub formula formula --maxsum=/tmp/884/ub_1_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-02
ub formula formula --maxsum=/tmp/884/ub_2_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-03
ub formula formula --maxsum=/tmp/884/ub_3_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-04
ub formula formula --maxsum=/tmp/884/ub_4_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-05
ub formula formula --maxsum=/tmp/884/ub_5_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-06
ub formula formula --maxsum=/tmp/884/ub_6_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-07
ub formula formula --maxsum=/tmp/884/ub_7_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-08
ub formula formula --maxsum=/tmp/884/ub_8_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-09
ub formula formula --maxsum=/tmp/884/ub_9_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-10
ub formula formula --maxsum=/tmp/884/ub_10_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-11
ub formula formula --maxsum=/tmp/884/ub_11_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-12
ub formula formula --maxsum=/tmp/884/ub_12_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-13
ub formula formula --maxsum=/tmp/884/ub_13_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-14
ub formula formula --maxsum=/tmp/884/ub_14_
ub formula name PolyORBLF-PT-S04J06T10-UpperBounds-15
ub formula formula --maxsum=/tmp/884/ub_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="ltsminxred"
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 ltsminxred"
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 r516-tajo-171654446800309"
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 '
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 ;