About the Execution of ITS-Tools for RERS17pb113-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.063 | 3600000.00 | 3683758.00 | 34012.10 | 2 ? ? ? ? ? 2 2 2 2 ? ? 2 2 ? 2 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r325-tall-167889196600013.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is RERS17pb113-PT-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r325-tall-167889196600013
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 18:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 18:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 18:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 18:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 18:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 18:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-00
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-01
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-02
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-03
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-04
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-05
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-06
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-07
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-08
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-09
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-10
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-11
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-12
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-13
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-14
FORMULA_NAME RERS17pb113-PT-2-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678908466997
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb113-PT-2
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-15 19:27:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 19:27:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 19:27:48] [INFO ] Load time of PNML (sax parser for PT used): 529 ms
[2023-03-15 19:27:49] [INFO ] Transformed 639 places.
[2023-03-15 19:27:49] [INFO ] Transformed 31353 transitions.
[2023-03-15 19:27:49] [INFO ] Parsed PT model containing 639 places and 31353 transitions and 125418 arcs in 702 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 18326 out of 31353 initially.
// Phase 1: matrix 18326 rows 639 cols
[2023-03-15 19:27:49] [INFO ] Computed 25 place invariants in 114 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=25 ) properties (out of 16) seen :21
FORMULA RERS17pb113-PT-2-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-09 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb113-PT-2-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :3
[2023-03-15 19:27:50] [INFO ] Flow matrix only has 18326 transitions (discarded 13027 similar events)
// Phase 1: matrix 18326 rows 639 cols
[2023-03-15 19:27:50] [INFO ] Computed 25 place invariants in 74 ms
[2023-03-15 19:27:50] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 19:27:50] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 10 ms returned sat
[2023-03-15 19:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:27:55] [INFO ] [Real]Absence check using state equation in 4674 ms returned unknown
[2023-03-15 19:27:55] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:27:55] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-15 19:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:00] [INFO ] [Real]Absence check using state equation in 4932 ms returned unknown
[2023-03-15 19:28:00] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:28:00] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-15 19:28:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:05] [INFO ] [Real]Absence check using state equation in 4941 ms returned unknown
[2023-03-15 19:28:05] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:28:05] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-15 19:28:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:10] [INFO ] [Real]Absence check using state equation in 4942 ms returned unknown
[2023-03-15 19:28:10] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 19:28:10] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 3 ms returned sat
[2023-03-15 19:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:15] [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 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 19:28:15] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:28:15] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-15 19:28:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:20] [INFO ] [Real]Absence check using state equation in 4944 ms returned unknown
[2023-03-15 19:28:20] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:28:20] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 1 ms returned sat
[2023-03-15 19:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:25] [INFO ] [Real]Absence check using state equation in 4945 ms returned unknown
[2023-03-15 19:28:25] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:28:25] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-15 19:28:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:30] [INFO ] [Real]Absence check using state equation in 4944 ms returned unknown
[2023-03-15 19:28:30] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:28:30] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-15 19:28:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:35] [INFO ] [Real]Absence check using state equation in 4950 ms returned unknown
[2023-03-15 19:28:35] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:28:35] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-15 19:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:40] [INFO ] [Real]Absence check using state equation in 4945 ms returned unknown
[2023-03-15 19:28:40] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 19:28:40] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 2 ms returned sat
[2023-03-15 19:28:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:28:45] [INFO ] [Real]Absence check using state equation in 4937 ms returned unknown
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 11 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 31353/31353 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 627 transition count 31353
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 626 transition count 31352
Applied a total of 13 rules in 606 ms. Remains 626 /639 variables (removed 13) and now considering 31352/31353 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 612 ms. Remains : 626/639 places, 31352/31353 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:28:46] [INFO ] Computed 13 place invariants in 68 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26371 ms. (steps per millisecond=37 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1859 ms. (steps per millisecond=537 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2246 ms. (steps per millisecond=445 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2071 ms. (steps per millisecond=482 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1968 ms. (steps per millisecond=508 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2062 ms. (steps per millisecond=484 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3547 ms. (steps per millisecond=281 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2793 ms. (steps per millisecond=358 ) properties (out of 11) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2596 ms. (steps per millisecond=385 ) properties (out of 11) seen :12
FORMULA RERS17pb113-PT-2-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1957 ms. (steps per millisecond=510 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1810 ms. (steps per millisecond=552 ) properties (out of 10) seen :10
[2023-03-15 19:29:35] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:29:35] [INFO ] Computed 13 place invariants in 51 ms
[2023-03-15 19:29:35] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:29:48] [INFO ] [Real]Absence check using state equation in 13020 ms returned sat
[2023-03-15 19:29:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:29:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:30:03] [INFO ] [Nat]Absence check using state equation in 14121 ms returned sat
[2023-03-15 19:30:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:30:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:30:10] [INFO ] [Nat]Added 268 Read/Feed constraints in 6461 ms returned unknown
[2023-03-15 19:30:10] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2023-03-15 19:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:30:24] [INFO ] [Real]Absence check using state equation in 13777 ms returned sat
[2023-03-15 19:30:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:30:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:30:38] [INFO ] [Nat]Absence check using state equation in 14179 ms returned sat
[2023-03-15 19:30:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:30:45] [INFO ] [Nat]Added 268 Read/Feed constraints in 6404 ms returned unknown
[2023-03-15 19:30:45] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:30:58] [INFO ] [Real]Absence check using state equation in 13723 ms returned sat
[2023-03-15 19:30:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:30:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:30:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:31:11] [INFO ] [Nat]Absence check using state equation in 12136 ms returned sat
[2023-03-15 19:31:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:31:17] [INFO ] [Nat]Added 268 Read/Feed constraints in 6451 ms returned unknown
[2023-03-15 19:31:18] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:31:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:31:30] [INFO ] [Real]Absence check using state equation in 12963 ms returned sat
[2023-03-15 19:31:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:31:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:31:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:31:41] [INFO ] [Nat]Absence check using state equation in 10535 ms returned sat
[2023-03-15 19:31:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:31:47] [INFO ] [Nat]Added 268 Read/Feed constraints in 5602 ms returned sat
[2023-03-15 19:31:50] [INFO ] Deduced a trap composed of 24 places in 2209 ms of which 3 ms to minimize.
[2023-03-15 19:31:52] [INFO ] Deduced a trap composed of 48 places in 2054 ms of which 1 ms to minimize.
[2023-03-15 19:31:54] [INFO ] Deduced a trap composed of 64 places in 2055 ms of which 0 ms to minimize.
[2023-03-15 19:31:57] [INFO ] Deduced a trap composed of 48 places in 2007 ms of which 0 ms to minimize.
[2023-03-15 19:31:59] [INFO ] Deduced a trap composed of 40 places in 1797 ms of which 1 ms to minimize.
[2023-03-15 19:32:01] [INFO ] Deduced a trap composed of 64 places in 1744 ms of which 0 ms to minimize.
[2023-03-15 19:32:03] [INFO ] Deduced a trap composed of 64 places in 1688 ms of which 0 ms to minimize.
[2023-03-15 19:32:04] [INFO ] Deduced a trap composed of 64 places in 1159 ms of which 1 ms to minimize.
[2023-03-15 19:32:05] [INFO ] Deduced a trap composed of 48 places in 929 ms of which 1 ms to minimize.
[2023-03-15 19:32:06] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 19018 ms
[2023-03-15 19:32:09] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2488 ms.
[2023-03-15 19:32:10] [INFO ] Added : 0 causal constraints over 0 iterations in 3610 ms. Result :sat
[2023-03-15 19:32:10] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:32:25] [INFO ] [Real]Absence check using state equation in 15283 ms returned sat
[2023-03-15 19:32:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:32:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:32:37] [INFO ] [Nat]Absence check using state equation in 10710 ms returned sat
[2023-03-15 19:32:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:32:43] [INFO ] [Nat]Added 268 Read/Feed constraints in 6365 ms returned unknown
[2023-03-15 19:32:43] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:32:54] [INFO ] [Real]Absence check using state equation in 10561 ms returned sat
[2023-03-15 19:32:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:32:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:32:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:33:08] [INFO ] [Nat]Absence check using state equation in 14437 ms returned sat
[2023-03-15 19:33:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:33:15] [INFO ] [Nat]Added 268 Read/Feed constraints in 6402 ms returned sat
[2023-03-15 19:33:17] [INFO ] Deduced a trap composed of 40 places in 2211 ms of which 1 ms to minimize.
[2023-03-15 19:33:20] [INFO ] Deduced a trap composed of 40 places in 2173 ms of which 1 ms to minimize.
[2023-03-15 19:33:22] [INFO ] Deduced a trap composed of 64 places in 2079 ms of which 1 ms to minimize.
[2023-03-15 19:33:25] [INFO ] Deduced a trap composed of 24 places in 1998 ms of which 1 ms to minimize.
[2023-03-15 19:33:27] [INFO ] Deduced a trap composed of 40 places in 2004 ms of which 1 ms to minimize.
[2023-03-15 19:33:29] [INFO ] Deduced a trap composed of 64 places in 2048 ms of which 0 ms to minimize.
[2023-03-15 19:33:31] [INFO ] Deduced a trap composed of 48 places in 2030 ms of which 1 ms to minimize.
[2023-03-15 19:33:34] [INFO ] Deduced a trap composed of 64 places in 1948 ms of which 0 ms to minimize.
[2023-03-15 19:33:36] [INFO ] Deduced a trap composed of 48 places in 1914 ms of which 1 ms to minimize.
[2023-03-15 19:33:38] [INFO ] Deduced a trap composed of 112 places in 1844 ms of which 1 ms to minimize.
[2023-03-15 19:33:40] [INFO ] Deduced a trap composed of 48 places in 1812 ms of which 1 ms to minimize.
[2023-03-15 19:33:40] [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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 19:33:40] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:33:52] [INFO ] [Real]Absence check using state equation in 12079 ms returned sat
[2023-03-15 19:33:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:33:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 19:33:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:34:07] [INFO ] [Nat]Absence check using state equation in 14465 ms returned sat
[2023-03-15 19:34:11] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:34:14] [INFO ] [Nat]Added 268 Read/Feed constraints in 6422 ms returned unknown
[2023-03-15 19:34:14] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:34:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:34:28] [INFO ] [Real]Absence check using state equation in 14702 ms returned sat
[2023-03-15 19:34:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:34:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:34:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:34:38] [INFO ] [Nat]Absence check using state equation in 9384 ms returned sat
[2023-03-15 19:34:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:34:45] [INFO ] [Nat]Added 268 Read/Feed constraints in 6445 ms returned unknown
[2023-03-15 19:34:45] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:34:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:34:57] [INFO ] [Real]Absence check using state equation in 12585 ms returned sat
[2023-03-15 19:34:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:34:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:35:08] [INFO ] [Nat]Absence check using state equation in 10706 ms returned sat
[2023-03-15 19:35:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:35:15] [INFO ] [Nat]Added 268 Read/Feed constraints in 6443 ms returned unknown
[2023-03-15 19:35:15] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:35:27] [INFO ] [Real]Absence check using state equation in 11882 ms returned sat
[2023-03-15 19:35:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:35:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:35:41] [INFO ] [Nat]Absence check using state equation in 13382 ms returned sat
[2023-03-15 19:35:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:35:47] [INFO ] [Nat]Added 268 Read/Feed constraints in 6486 ms returned unknown
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 10 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 198 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:35:47] [INFO ] Computed 13 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26224 ms. (steps per millisecond=38 ) properties (out of 10) seen :11
FORMULA RERS17pb113-PT-2-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2101 ms. (steps per millisecond=475 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2077 ms. (steps per millisecond=481 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1884 ms. (steps per millisecond=530 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2079 ms. (steps per millisecond=481 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 3523 ms. (steps per millisecond=283 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2681 ms. (steps per millisecond=372 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1748 ms. (steps per millisecond=572 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1962 ms. (steps per millisecond=509 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties (out of 9) seen :9
[2023-03-15 19:36:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:36:34] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-15 19:36:34] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 19:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:36:48] [INFO ] [Real]Absence check using state equation in 14521 ms returned sat
[2023-03-15 19:36:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:36:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:37:03] [INFO ] [Nat]Absence check using state equation in 14351 ms returned sat
[2023-03-15 19:37:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:37:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:37:10] [INFO ] [Nat]Added 268 Read/Feed constraints in 6454 ms returned unknown
[2023-03-15 19:37:10] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:37:23] [INFO ] [Real]Absence check using state equation in 13359 ms returned sat
[2023-03-15 19:37:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:37:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:37:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:37:36] [INFO ] [Nat]Absence check using state equation in 12974 ms returned sat
[2023-03-15 19:37:40] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:37:43] [INFO ] [Nat]Added 268 Read/Feed constraints in 6439 ms returned unknown
[2023-03-15 19:37:43] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:37:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:37:57] [INFO ] [Real]Absence check using state equation in 14154 ms returned sat
[2023-03-15 19:37:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:37:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:38:08] [INFO ] [Nat]Absence check using state equation in 10811 ms returned sat
[2023-03-15 19:38:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:38:14] [INFO ] [Nat]Added 268 Read/Feed constraints in 6149 ms returned sat
[2023-03-15 19:38:17] [INFO ] Deduced a trap composed of 64 places in 2286 ms of which 1 ms to minimize.
[2023-03-15 19:38:20] [INFO ] Deduced a trap composed of 48 places in 2293 ms of which 1 ms to minimize.
[2023-03-15 19:38:22] [INFO ] Deduced a trap composed of 64 places in 2244 ms of which 0 ms to minimize.
[2023-03-15 19:38:25] [INFO ] Deduced a trap composed of 48 places in 2322 ms of which 1 ms to minimize.
[2023-03-15 19:38:27] [INFO ] Deduced a trap composed of 24 places in 2241 ms of which 1 ms to minimize.
[2023-03-15 19:38:30] [INFO ] Deduced a trap composed of 48 places in 2147 ms of which 1 ms to minimize.
[2023-03-15 19:38:32] [INFO ] Deduced a trap composed of 48 places in 2083 ms of which 0 ms to minimize.
[2023-03-15 19:38:35] [INFO ] Deduced a trap composed of 40 places in 1888 ms of which 1 ms to minimize.
[2023-03-15 19:38:37] [INFO ] Deduced a trap composed of 64 places in 1827 ms of which 0 ms to minimize.
[2023-03-15 19:38:39] [INFO ] Deduced a trap composed of 275 places in 1729 ms of which 0 ms to minimize.
[2023-03-15 19:38:41] [INFO ] Deduced a trap composed of 168 places in 1728 ms of which 1 ms to minimize.
[2023-03-15 19:38:43] [INFO ] Deduced a trap composed of 64 places in 1692 ms of which 0 ms to minimize.
[2023-03-15 19:38: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 19:38:43] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:38:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:38:56] [INFO ] [Real]Absence check using state equation in 12717 ms returned sat
[2023-03-15 19:38:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:38:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:38:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:39:07] [INFO ] [Nat]Absence check using state equation in 11058 ms returned sat
[2023-03-15 19:39:10] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:39:13] [INFO ] [Nat]Added 268 Read/Feed constraints in 6403 ms returned unknown
[2023-03-15 19:39:13] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:39:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:39:25] [INFO ] [Real]Absence check using state equation in 11178 ms returned sat
[2023-03-15 19:39:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:39:25] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:39:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:39:39] [INFO ] [Nat]Absence check using state equation in 14143 ms returned sat
[2023-03-15 19:39:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:39:45] [INFO ] [Nat]Added 268 Read/Feed constraints in 6181 ms returned sat
[2023-03-15 19:39:48] [INFO ] Deduced a trap composed of 24 places in 2276 ms of which 1 ms to minimize.
[2023-03-15 19:39:50] [INFO ] Deduced a trap composed of 48 places in 2201 ms of which 1 ms to minimize.
[2023-03-15 19:39:53] [INFO ] Deduced a trap composed of 40 places in 2214 ms of which 4 ms to minimize.
[2023-03-15 19:39:55] [INFO ] Deduced a trap composed of 40 places in 2176 ms of which 0 ms to minimize.
[2023-03-15 19:39:58] [INFO ] Deduced a trap composed of 40 places in 2186 ms of which 1 ms to minimize.
[2023-03-15 19:40:00] [INFO ] Deduced a trap composed of 40 places in 2167 ms of which 1 ms to minimize.
[2023-03-15 19:40:03] [INFO ] Deduced a trap composed of 64 places in 2087 ms of which 0 ms to minimize.
[2023-03-15 19:40:05] [INFO ] Deduced a trap composed of 64 places in 2055 ms of which 0 ms to minimize.
[2023-03-15 19:40:07] [INFO ] Deduced a trap composed of 64 places in 1997 ms of which 0 ms to minimize.
[2023-03-15 19:40:09] [INFO ] Deduced a trap composed of 64 places in 990 ms of which 1 ms to minimize.
[2023-03-15 19:40:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 23993 ms
[2023-03-15 19:40:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 19:40:10] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:40:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:40:22] [INFO ] [Real]Absence check using state equation in 12259 ms returned sat
[2023-03-15 19:40:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:40:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:40:38] [INFO ] [Nat]Absence check using state equation in 15304 ms returned sat
[2023-03-15 19:40:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:40:44] [INFO ] [Nat]Added 268 Read/Feed constraints in 6457 ms returned unknown
[2023-03-15 19:40:45] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:40:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:41:01] [INFO ] [Real]Absence check using state equation in 16037 ms returned sat
[2023-03-15 19:41:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:41:01] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-15 19:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:41:11] [INFO ] [Nat]Absence check using state equation in 9905 ms returned sat
[2023-03-15 19:41:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:41:17] [INFO ] [Nat]Added 268 Read/Feed constraints in 6427 ms returned unknown
[2023-03-15 19:41:17] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:41:30] [INFO ] [Real]Absence check using state equation in 12457 ms returned sat
[2023-03-15 19:41:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:41:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:41:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:41:41] [INFO ] [Nat]Absence check using state equation in 10691 ms returned sat
[2023-03-15 19:41:44] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:41:47] [INFO ] [Nat]Added 268 Read/Feed constraints in 6387 ms returned unknown
[2023-03-15 19:41:47] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:41:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:42:00] [INFO ] [Real]Absence check using state equation in 12159 ms returned sat
[2023-03-15 19:42:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:42:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:42:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:42:13] [INFO ] [Nat]Absence check using state equation in 13178 ms returned sat
[2023-03-15 19:42:17] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:42:20] [INFO ] [Nat]Added 268 Read/Feed constraints in 6483 ms returned unknown
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, 2, 2, 2, 2, 2] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 183 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:42:20] [INFO ] Computed 13 place invariants in 51 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26796 ms. (steps per millisecond=37 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2289 ms. (steps per millisecond=436 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2186 ms. (steps per millisecond=457 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2033 ms. (steps per millisecond=491 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2219 ms. (steps per millisecond=450 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3639 ms. (steps per millisecond=274 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2766 ms. (steps per millisecond=361 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1787 ms. (steps per millisecond=559 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2030 ms. (steps per millisecond=492 ) properties (out of 9) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1971 ms. (steps per millisecond=507 ) properties (out of 9) seen :9
[2023-03-15 19:43:08] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:43:08] [INFO ] Computed 13 place invariants in 52 ms
[2023-03-15 19:43:08] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:43:23] [INFO ] [Real]Absence check using state equation in 14992 ms returned sat
[2023-03-15 19:43:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:43:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:43:38] [INFO ] [Nat]Absence check using state equation in 15242 ms returned sat
[2023-03-15 19:43:39] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:43:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:43:45] [INFO ] [Nat]Added 268 Read/Feed constraints in 6463 ms returned unknown
[2023-03-15 19:43:45] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:43:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:43:59] [INFO ] [Real]Absence check using state equation in 13884 ms returned sat
[2023-03-15 19:43:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:43:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:44:12] [INFO ] [Nat]Absence check using state equation in 12882 ms returned sat
[2023-03-15 19:44:16] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:44:19] [INFO ] [Nat]Added 268 Read/Feed constraints in 6451 ms returned unknown
[2023-03-15 19:44:19] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:44:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:44:32] [INFO ] [Real]Absence check using state equation in 13662 ms returned sat
[2023-03-15 19:44:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:44:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:44:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:44:44] [INFO ] [Nat]Absence check using state equation in 10826 ms returned sat
[2023-03-15 19:44:47] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:44:50] [INFO ] [Nat]Added 268 Read/Feed constraints in 6009 ms returned sat
[2023-03-15 19:44:52] [INFO ] Deduced a trap composed of 40 places in 2113 ms of which 1 ms to minimize.
[2023-03-15 19:44:55] [INFO ] Deduced a trap composed of 48 places in 2096 ms of which 1 ms to minimize.
[2023-03-15 19:44:57] [INFO ] Deduced a trap composed of 24 places in 2065 ms of which 0 ms to minimize.
[2023-03-15 19:44:59] [INFO ] Deduced a trap composed of 48 places in 2001 ms of which 0 ms to minimize.
[2023-03-15 19:45:01] [INFO ] Deduced a trap composed of 48 places in 1896 ms of which 1 ms to minimize.
[2023-03-15 19:45:04] [INFO ] Deduced a trap composed of 48 places in 1866 ms of which 0 ms to minimize.
[2023-03-15 19:45:06] [INFO ] Deduced a trap composed of 40 places in 1864 ms of which 0 ms to minimize.
[2023-03-15 19:45:08] [INFO ] Deduced a trap composed of 64 places in 1828 ms of which 1 ms to minimize.
[2023-03-15 19:45:09] [INFO ] Deduced a trap composed of 64 places in 1007 ms of which 1 ms to minimize.
[2023-03-15 19:45:10] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 20149 ms
[2023-03-15 19:45:12] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 2172 ms.
[2023-03-15 19:45:13] [INFO ] Added : 0 causal constraints over 0 iterations in 3313 ms. Result :sat
[2023-03-15 19:45:14] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:45:27] [INFO ] [Real]Absence check using state equation in 12896 ms returned sat
[2023-03-15 19:45:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:45:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:45:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:45:38] [INFO ] [Nat]Absence check using state equation in 11033 ms returned sat
[2023-03-15 19:45:41] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:45:44] [INFO ] [Nat]Added 268 Read/Feed constraints in 6371 ms returned unknown
[2023-03-15 19:45:44] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:45:56] [INFO ] [Real]Absence check using state equation in 11494 ms returned sat
[2023-03-15 19:45:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:45:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-15 19:45:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:46:11] [INFO ] [Nat]Absence check using state equation in 14709 ms returned sat
[2023-03-15 19:46:14] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:46:17] [INFO ] [Nat]Added 268 Read/Feed constraints in 6383 ms returned unknown
[2023-03-15 19:46:18] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:46:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:46:31] [INFO ] [Real]Absence check using state equation in 13376 ms returned sat
[2023-03-15 19:46:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:46:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:46:47] [INFO ] [Nat]Absence check using state equation in 15902 ms returned sat
[2023-03-15 19:46:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:46:54] [INFO ] [Nat]Added 268 Read/Feed constraints in 6459 ms returned unknown
[2023-03-15 19:46:54] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:46:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:47:10] [INFO ] [Real]Absence check using state equation in 16679 ms returned sat
[2023-03-15 19:47:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:47:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:47:21] [INFO ] [Nat]Absence check using state equation in 10361 ms returned sat
[2023-03-15 19:47:25] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:47:28] [INFO ] [Nat]Added 268 Read/Feed constraints in 6418 ms returned unknown
[2023-03-15 19:47:28] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:47:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:47:41] [INFO ] [Real]Absence check using state equation in 13237 ms returned sat
[2023-03-15 19:47:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:47:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:47:54] [INFO ] [Nat]Absence check using state equation in 12227 ms returned sat
[2023-03-15 19:47:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:48:00] [INFO ] [Nat]Added 268 Read/Feed constraints in 6412 ms returned unknown
[2023-03-15 19:48:00] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:48:12] [INFO ] [Real]Absence check using state equation in 12167 ms returned sat
[2023-03-15 19:48:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:48:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:48:26] [INFO ] [Nat]Absence check using state equation in 13695 ms returned sat
[2023-03-15 19:48:30] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:48:33] [INFO ] [Nat]Added 268 Read/Feed constraints in 6490 ms returned unknown
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, 2, 2, 2, 2, 2] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 180 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 175 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-15 19:48:33] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:48:33] [INFO ] Invariant cache hit.
[2023-03-15 19:48:35] [INFO ] Implicit Places using invariants in 1783 ms returned []
Implicit Place search using SMT only with invariants took 1784 ms to find 0 implicit places.
[2023-03-15 19:48:35] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:48:35] [INFO ] Invariant cache hit.
[2023-03-15 19:48:43] [INFO ] Dead Transitions using invariants and state equation in 8171 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10133 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting property specific reduction for RERS17pb113-PT-2-UpperBounds-01
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:48:43] [INFO ] Computed 13 place invariants in 49 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2023-03-15 19:48:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:48:44] [INFO ] Computed 13 place invariants in 44 ms
[2023-03-15 19:48:44] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:48:49] [INFO ] [Real]Absence check using state equation in 4944 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 191 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:48:49] [INFO ] Computed 13 place invariants in 50 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26209 ms. (steps per millisecond=38 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2194 ms. (steps per millisecond=455 ) properties (out of 1) seen :1
[2023-03-15 19:49:17] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:49:17] [INFO ] Computed 13 place invariants in 40 ms
[2023-03-15 19:49:18] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:49:32] [INFO ] [Real]Absence check using state equation in 14928 ms returned sat
[2023-03-15 19:49:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:49:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:49:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:49:47] [INFO ] [Nat]Absence check using state equation in 14539 ms returned sat
[2023-03-15 19:49:48] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:49:51] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:49:54] [INFO ] [Nat]Added 268 Read/Feed constraints in 6453 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 170 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 173 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-15 19:49:54] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:49:54] [INFO ] Invariant cache hit.
[2023-03-15 19:49:56] [INFO ] Implicit Places using invariants in 1760 ms returned []
Implicit Place search using SMT only with invariants took 1761 ms to find 0 implicit places.
[2023-03-15 19:49:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:49:56] [INFO ] Invariant cache hit.
[2023-03-15 19:50:04] [INFO ] Dead Transitions using invariants and state equation in 7935 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9872 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-2-UpperBounds-01 in 80779 ms.
Starting property specific reduction for RERS17pb113-PT-2-UpperBounds-02
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:50:04] [INFO ] Computed 13 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :1
[2023-03-15 19:50:04] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:50:04] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-15 19:50:05] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:50:09] [INFO ] [Real]Absence check using state equation in 4949 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:50:10] [INFO ] Computed 13 place invariants in 48 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 25130 ms. (steps per millisecond=39 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2046 ms. (steps per millisecond=488 ) properties (out of 1) seen :1
[2023-03-15 19:50:37] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:50:37] [INFO ] Computed 13 place invariants in 48 ms
[2023-03-15 19:50:37] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:50:51] [INFO ] [Real]Absence check using state equation in 13484 ms returned sat
[2023-03-15 19:50:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:50:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:50:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:51:03] [INFO ] [Nat]Absence check using state equation in 12484 ms returned sat
[2023-03-15 19:51:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:51:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:51:10] [INFO ] [Nat]Added 268 Read/Feed constraints in 6476 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 167 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 155 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-15 19:51:10] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:51:10] [INFO ] Invariant cache hit.
[2023-03-15 19:51:12] [INFO ] Implicit Places using invariants in 1655 ms returned []
Implicit Place search using SMT only with invariants took 1656 ms to find 0 implicit places.
[2023-03-15 19:51:12] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:51:12] [INFO ] Invariant cache hit.
[2023-03-15 19:51:20] [INFO ] Dead Transitions using invariants and state equation in 8004 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9819 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-2-UpperBounds-02 in 75950 ms.
Starting property specific reduction for RERS17pb113-PT-2-UpperBounds-03
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:51:20] [INFO ] Computed 13 place invariants in 49 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2023-03-15 19:51:20] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:51:20] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-15 19:51:20] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:51:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:51:25] [INFO ] [Real]Absence check using state equation in 4952 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:51:26] [INFO ] Computed 13 place invariants in 52 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 26044 ms. (steps per millisecond=38 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1970 ms. (steps per millisecond=507 ) properties (out of 1) seen :1
[2023-03-15 19:51:54] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:51:54] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-15 19:51:54] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:51:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:52:08] [INFO ] [Real]Absence check using state equation in 13761 ms returned sat
[2023-03-15 19:52:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:52:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:52:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:52:19] [INFO ] [Nat]Absence check using state equation in 11103 ms returned sat
[2023-03-15 19:52:19] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:52:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:52:25] [INFO ] [Nat]Added 268 Read/Feed constraints in 6192 ms returned sat
[2023-03-15 19:52:28] [INFO ] Deduced a trap composed of 48 places in 2200 ms of which 1 ms to minimize.
[2023-03-15 19:52:30] [INFO ] Deduced a trap composed of 40 places in 2178 ms of which 0 ms to minimize.
[2023-03-15 19:52:33] [INFO ] Deduced a trap composed of 64 places in 2174 ms of which 1 ms to minimize.
[2023-03-15 19:52:35] [INFO ] Deduced a trap composed of 48 places in 2134 ms of which 0 ms to minimize.
[2023-03-15 19:52:38] [INFO ] Deduced a trap composed of 48 places in 2136 ms of which 4 ms to minimize.
[2023-03-15 19:52:40] [INFO ] Deduced a trap composed of 24 places in 1915 ms of which 1 ms to minimize.
[2023-03-15 19:52:41] [INFO ] Deduced a trap composed of 64 places in 1142 ms of which 0 ms to minimize.
[2023-03-15 19:52:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 16652 ms
[2023-03-15 19:52:44] [INFO ] Computed and/alt/rep : 1/9/1 causal constraints (skipped 18323 transitions) in 1895 ms.
[2023-03-15 19:52:45] [INFO ] Added : 0 causal constraints over 0 iterations in 3023 ms. Result :sat
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 174 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 171 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-15 19:52:46] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:52:46] [INFO ] Invariant cache hit.
[2023-03-15 19:52:48] [INFO ] Implicit Places using invariants in 1727 ms returned []
Implicit Place search using SMT only with invariants took 1728 ms to find 0 implicit places.
[2023-03-15 19:52:48] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:52:48] [INFO ] Invariant cache hit.
[2023-03-15 19:52:56] [INFO ] Dead Transitions using invariants and state equation in 7954 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9857 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-2-UpperBounds-03 in 95602 ms.
Starting property specific reduction for RERS17pb113-PT-2-UpperBounds-04
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:52:56] [INFO ] Computed 13 place invariants in 53 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
[2023-03-15 19:52:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:52:56] [INFO ] Computed 13 place invariants in 49 ms
[2023-03-15 19:52:56] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:53:01] [INFO ] [Real]Absence check using state equation in 4947 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 149 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:53:01] [INFO ] Computed 13 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 25144 ms. (steps per millisecond=39 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2038 ms. (steps per millisecond=490 ) properties (out of 1) seen :1
[2023-03-15 19:53:28] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:53:29] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-15 19:53:29] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:53:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:53:44] [INFO ] [Real]Absence check using state equation in 15014 ms returned sat
[2023-03-15 19:53:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:53:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:53:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:53:55] [INFO ] [Nat]Absence check using state equation in 10661 ms returned sat
[2023-03-15 19:53:55] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:53:58] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:54:01] [INFO ] [Nat]Added 268 Read/Feed constraints in 6448 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 168 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 152 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-15 19:54:02] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:54:02] [INFO ] Invariant cache hit.
[2023-03-15 19:54:03] [INFO ] Implicit Places using invariants in 1720 ms returned []
Implicit Place search using SMT only with invariants took 1721 ms to find 0 implicit places.
[2023-03-15 19:54:03] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:54:03] [INFO ] Invariant cache hit.
[2023-03-15 19:54:11] [INFO ] Dead Transitions using invariants and state equation in 7958 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9835 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-2-UpperBounds-04 in 75661 ms.
Starting property specific reduction for RERS17pb113-PT-2-UpperBounds-05
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:54:11] [INFO ] Computed 13 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2023-03-15 19:54:12] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:54:12] [INFO ] Computed 13 place invariants in 47 ms
[2023-03-15 19:54:12] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:54:17] [INFO ] [Real]Absence check using state equation in 4945 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 153 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:54:17] [INFO ] Computed 13 place invariants in 49 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 25340 ms. (steps per millisecond=39 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3478 ms. (steps per millisecond=287 ) properties (out of 1) seen :1
[2023-03-15 19:54:46] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:54:46] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-15 19:54:46] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:54:57] [INFO ] [Real]Absence check using state equation in 10915 ms returned sat
[2023-03-15 19:54:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:54:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:55:11] [INFO ] [Nat]Absence check using state equation in 14127 ms returned sat
[2023-03-15 19:55:11] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:55:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:55:18] [INFO ] [Nat]Added 268 Read/Feed constraints in 6444 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 170 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 161 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-15 19:55:18] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:55:18] [INFO ] Invariant cache hit.
[2023-03-15 19:55:20] [INFO ] Implicit Places using invariants in 1766 ms returned []
Implicit Place search using SMT only with invariants took 1767 ms to find 0 implicit places.
[2023-03-15 19:55:20] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:55:20] [INFO ] Invariant cache hit.
[2023-03-15 19:55:28] [INFO ] Dead Transitions using invariants and state equation in 7942 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9873 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-2-UpperBounds-05 in 76737 ms.
Starting property specific reduction for RERS17pb113-PT-2-UpperBounds-07
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:55:28] [INFO ] Computed 13 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 1) seen :2
FORMULA RERS17pb113-PT-2-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Ending property specific reduction for RERS17pb113-PT-2-UpperBounds-07 in 317 ms.
Starting property specific reduction for RERS17pb113-PT-2-UpperBounds-10
[2023-03-15 19:55:28] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
[2023-03-15 19:55:29] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:55:29] [INFO ] Computed 13 place invariants in 43 ms
[2023-03-15 19:55:29] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:55:34] [INFO ] [Real]Absence check using state equation in 4950 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 159 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:55:34] [INFO ] Computed 13 place invariants in 50 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 25548 ms. (steps per millisecond=39 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1766 ms. (steps per millisecond=566 ) properties (out of 1) seen :1
[2023-03-15 19:56:01] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:56:01] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-15 19:56:01] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:56:17] [INFO ] [Real]Absence check using state equation in 15782 ms returned sat
[2023-03-15 19:56:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:56:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-15 19:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:56:27] [INFO ] [Nat]Absence check using state equation in 9725 ms returned sat
[2023-03-15 19:56:27] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:56:31] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:56:34] [INFO ] [Nat]Added 268 Read/Feed constraints in 6455 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 173 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 165 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-15 19:56:34] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:56:34] [INFO ] Invariant cache hit.
[2023-03-15 19:56:36] [INFO ] Implicit Places using invariants in 1681 ms returned []
Implicit Place search using SMT only with invariants took 1681 ms to find 0 implicit places.
[2023-03-15 19:56:36] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:56:36] [INFO ] Invariant cache hit.
[2023-03-15 19:56:44] [INFO ] Dead Transitions using invariants and state equation in 7891 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9741 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-2-UpperBounds-10 in 75500 ms.
Starting property specific reduction for RERS17pb113-PT-2-UpperBounds-11
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:56:44] [INFO ] Computed 13 place invariants in 49 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :1
[2023-03-15 19:56:44] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:56:44] [INFO ] Computed 13 place invariants in 45 ms
[2023-03-15 19:56:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 19:56:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:56:49] [INFO ] [Real]Absence check using state equation in 4953 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 162 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:56:49] [INFO ] Computed 13 place invariants in 47 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 24880 ms. (steps per millisecond=40 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1847 ms. (steps per millisecond=541 ) properties (out of 1) seen :1
[2023-03-15 19:57:16] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:57:16] [INFO ] Computed 13 place invariants in 45 ms
[2023-03-15 19:57:16] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:57:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:57:28] [INFO ] [Real]Absence check using state equation in 11840 ms returned sat
[2023-03-15 19:57:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:57:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:57:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:57:39] [INFO ] [Nat]Absence check using state equation in 10015 ms returned sat
[2023-03-15 19:57:39] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:57:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:57:45] [INFO ] [Nat]Added 268 Read/Feed constraints in 6462 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 168 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 175 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-15 19:57:46] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:57:46] [INFO ] Invariant cache hit.
[2023-03-15 19:57:47] [INFO ] Implicit Places using invariants in 1731 ms returned []
Implicit Place search using SMT only with invariants took 1731 ms to find 0 implicit places.
[2023-03-15 19:57:47] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:57:47] [INFO ] Invariant cache hit.
[2023-03-15 19:57:55] [INFO ] Dead Transitions using invariants and state equation in 8007 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9916 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-2-UpperBounds-11 in 71492 ms.
Starting property specific reduction for RERS17pb113-PT-2-UpperBounds-14
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:57:55] [INFO ] Computed 13 place invariants in 47 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
[2023-03-15 19:57:56] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:57:56] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-15 19:57:56] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:57:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:58:01] [INFO ] [Real]Absence check using state equation in 4953 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 626/626 places, 31352/31352 transitions.
Normalized transition count is 18325 out of 31352 initially.
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:58:01] [INFO ] Computed 13 place invariants in 48 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 24157 ms. (steps per millisecond=41 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1767 ms. (steps per millisecond=565 ) properties (out of 1) seen :1
[2023-03-15 19:58:27] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
// Phase 1: matrix 18325 rows 626 cols
[2023-03-15 19:58:27] [INFO ] Computed 13 place invariants in 46 ms
[2023-03-15 19:58:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 19:58:39] [INFO ] [Real]Absence check using state equation in 11464 ms returned sat
[2023-03-15 19:58:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 19:58:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-15 19:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:58:52] [INFO ] [Nat]Absence check using state equation in 12699 ms returned sat
[2023-03-15 19:58:52] [INFO ] State equation strengthened by 268 read => feed constraints.
[2023-03-15 19:58:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-15 19:58:58] [INFO ] [Nat]Added 268 Read/Feed constraints in 6571 ms returned unknown
Current structural bounds on expressions (after SMT) : [2] Max seen :[1]
Support contains 1 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 154 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 626/626 places, 31352/31352 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 31352/31352 transitions.
Applied a total of 0 rules in 150 ms. Remains 626 /626 variables (removed 0) and now considering 31352/31352 (removed 0) transitions.
[2023-03-15 19:58:59] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:58:59] [INFO ] Invariant cache hit.
[2023-03-15 19:59:00] [INFO ] Implicit Places using invariants in 1724 ms returned []
Implicit Place search using SMT only with invariants took 1724 ms to find 0 implicit places.
[2023-03-15 19:59:00] [INFO ] Flow matrix only has 18325 transitions (discarded 13027 similar events)
[2023-03-15 19:59:00] [INFO ] Invariant cache hit.
[2023-03-15 19:59:08] [INFO ] Dead Transitions using invariants and state equation in 8000 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9876 ms. Remains : 626/626 places, 31352/31352 transitions.
Ending property specific reduction for RERS17pb113-PT-2-UpperBounds-14 in 73028 ms.
[2023-03-15 19:59:10] [INFO ] Flatten gal took : 1025 ms
[2023-03-15 19:59:10] [INFO ] Applying decomposition
[2023-03-15 19:59:11] [INFO ] Flatten gal took : 704 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13284883027594922831.txt' '-o' '/tmp/graph13284883027594922831.bin' '-w' '/tmp/graph13284883027594922831.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13284883027594922831.bin' '-l' '-1' '-v' '-w' '/tmp/graph13284883027594922831.weights' '-q' '0' '-e' '0.001'
[2023-03-15 19:59:13] [INFO ] Decomposing Gal with order
[2023-03-15 19:59:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 19:59:15] [INFO ] Removed a total of 91770 redundant transitions.
[2023-03-15 19:59:15] [INFO ] Flatten gal took : 1551 ms
[2023-03-15 19:59:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1166 labels/synchronizations in 1153 ms.
[2023-03-15 19:59:18] [INFO ] Time to serialize gal into /tmp/UpperBounds416773920431066741.gal : 137 ms
[2023-03-15 19:59:18] [INFO ] Time to serialize properties into /tmp/UpperBounds2552564594642448565.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds416773920431066741.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2552564594642448565.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds2552564594642448565.prop.
ITS-tools command line returned an error code 137
[2023-03-15 20:08:53] [INFO ] Flatten gal took : 2279 ms
[2023-03-15 20:08:53] [INFO ] Time to serialize gal into /tmp/UpperBounds13435333701312703187.gal : 422 ms
[2023-03-15 20:08:53] [INFO ] Time to serialize properties into /tmp/UpperBounds18095456243411811504.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13435333701312703187.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18095456243411811504.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds18095456243411811504.prop.
ITS-tools command line returned an error code 137
[2023-03-15 20:20:16] [INFO ] Flatten gal took : 2007 ms
[2023-03-15 20:20:18] [INFO ] Input system was already deterministic with 31352 transitions.
[2023-03-15 20:20:18] [INFO ] Transformed 626 places.
[2023-03-15 20:20:18] [INFO ] Transformed 31352 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-15 20:20:21] [INFO ] Time to serialize gal into /tmp/UpperBounds1689633451500314514.gal : 99 ms
[2023-03-15 20:20:21] [INFO ] Time to serialize properties into /tmp/UpperBounds13913051662778408464.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1689633451500314514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13913051662778408464.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13913051662778408464.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 3103728 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16205056 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="RERS17pb113-PT-2"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is RERS17pb113-PT-2, 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 r325-tall-167889196600013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb113-PT-2.tgz
mv RERS17pb113-PT-2 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 ;