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.r299-tall-167873953400781.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 smartxred
Input is PolyORBNT-PT-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r299-tall-167873953400781
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 64K Feb 26 00:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 276K Feb 26 00:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 518K Feb 26 00:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.0M Feb 26 00:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 36K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 120K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 53K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 254K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 300K Feb 26 01:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 981K Feb 26 01:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J60-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679551541992

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J60
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 06:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 06:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:05:44] [INFO ] Load time of PNML (sax parser for PT used): 640 ms
[2023-03-23 06:05:44] [INFO ] Transformed 1234 places.
[2023-03-23 06:05:44] [INFO ] Transformed 12920 transitions.
[2023-03-23 06:05:44] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 802 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 2801 out of 2810 initially.
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-23 06:05:44] [INFO ] Computed 152 place invariants in 276 ms
Incomplete random walk after 10000 steps, including 559 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :21
FORMULA PolyORBNT-PT-S10J60-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-23 06:05:45] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2023-03-23 06:05:45] [INFO ] Computed 152 place invariants in 99 ms
[2023-03-23 06:05:46] [INFO ] [Real]Absence check using 121 positive place invariants in 37 ms returned sat
[2023-03-23 06:05:46] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 41 ms returned sat
[2023-03-23 06:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:05:47] [INFO ] [Real]Absence check using state equation in 853 ms returned sat
[2023-03-23 06:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:05:47] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-23 06:05:47] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 43 ms returned sat
[2023-03-23 06:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:05:52] [INFO ] [Nat]Absence check using state equation in 4690 ms returned unknown
[2023-03-23 06:05:52] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-23 06:05:52] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 34 ms returned unsat
[2023-03-23 06:05:52] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-23 06:05:52] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 40 ms returned sat
[2023-03-23 06:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:05:53] [INFO ] [Real]Absence check using state equation in 791 ms returned sat
[2023-03-23 06:05:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:05:53] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2023-03-23 06:05:53] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 45 ms returned sat
[2023-03-23 06:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:05:58] [INFO ] [Nat]Absence check using state equation in 4794 ms returned unknown
[2023-03-23 06:05:58] [INFO ] [Real]Absence check using 121 positive place invariants in 56 ms returned sat
[2023-03-23 06:05:58] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 73 ms returned sat
[2023-03-23 06:05:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:00] [INFO ] [Real]Absence check using state equation in 2044 ms returned sat
[2023-03-23 06:06:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:06:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2023-03-23 06:06:01] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 46 ms returned sat
[2023-03-23 06:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:02] [INFO ] [Nat]Absence check using state equation in 1140 ms returned sat
[2023-03-23 06:06:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:06:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 406 ms returned sat
[2023-03-23 06:06:03] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 326 ms.
[2023-03-23 06:06:06] [INFO ] Deduced a trap composed of 630 places in 825 ms of which 5 ms to minimize.
[2023-03-23 06:06:06] [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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 06:06:06] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-23 06:06:06] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 41 ms returned sat
[2023-03-23 06:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:07] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2023-03-23 06:06:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:06:07] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-23 06:06:07] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 42 ms returned sat
[2023-03-23 06:06:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:10] [INFO ] [Nat]Absence check using state equation in 3153 ms returned sat
[2023-03-23 06:06:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 188 ms returned sat
[2023-03-23 06:06:11] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 300 ms.
[2023-03-23 06:06:12] [INFO ] Added : 10 causal constraints over 2 iterations in 1390 ms. Result :unknown
[2023-03-23 06:06:12] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2023-03-23 06:06:12] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 32 ms returned unsat
[2023-03-23 06:06:12] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-23 06:06:12] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 32 ms returned unsat
[2023-03-23 06:06:13] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-23 06:06:13] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 42 ms returned unsat
[2023-03-23 06:06:13] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2023-03-23 06:06:13] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 32 ms returned unsat
[2023-03-23 06:06:13] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-23 06:06:13] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 39 ms returned sat
[2023-03-23 06:06:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:15] [INFO ] [Real]Absence check using state equation in 2453 ms returned sat
[2023-03-23 06:06:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:06:16] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2023-03-23 06:06:16] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 46 ms returned sat
[2023-03-23 06:06:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:19] [INFO ] [Nat]Absence check using state equation in 2751 ms returned sat
[2023-03-23 06:06:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 322 ms returned sat
[2023-03-23 06:06:19] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 193 ms.
[2023-03-23 06:06:22] [INFO ] Deduced a trap composed of 3 places in 961 ms of which 2 ms to minimize.
[2023-03-23 06:06:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 06:06:22] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-23 06:06:22] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 31 ms returned unsat
[2023-03-23 06:06:22] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-23 06:06:22] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 42 ms returned sat
[2023-03-23 06:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:25] [INFO ] [Real]Absence check using state equation in 2712 ms returned sat
[2023-03-23 06:06:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:06:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2023-03-23 06:06:25] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 41 ms returned sat
[2023-03-23 06:06:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:30] [INFO ] [Nat]Absence check using state equation in 4822 ms returned unknown
[2023-03-23 06:06:30] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-23 06:06:30] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 40 ms returned sat
[2023-03-23 06:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:31] [INFO ] [Real]Absence check using state equation in 748 ms returned unsat
Current structural bounds on expressions (after SMT) : [523, 1, 523, 2, 70, 1, 1, 1, 1, 10, 1, 1, 10] Max seen :[1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 10]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 1224 transition count 2746
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 139 place count 1160 transition count 2745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 1159 transition count 2745
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 140 place count 1159 transition count 2682
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 266 place count 1096 transition count 2682
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 267 place count 1095 transition count 2681
Iterating global reduction 3 with 1 rules applied. Total rules applied 268 place count 1095 transition count 2681
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 272 place count 1093 transition count 2679
Applied a total of 272 rules in 595 ms. Remains 1093 /1234 variables (removed 141) and now considering 2679/2810 (removed 131) transitions.
[2023-03-23 06:06:31] [INFO ] Flow matrix only has 2670 transitions (discarded 9 similar events)
// Phase 1: matrix 2670 rows 1093 cols
[2023-03-23 06:06:31] [INFO ] Computed 142 place invariants in 60 ms
[2023-03-23 06:06:34] [INFO ] Dead Transitions using invariants and state equation in 2331 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1093/1234 places, 2064/2810 transitions.
Applied a total of 0 rules in 75 ms. Remains 1093 /1093 variables (removed 0) and now considering 2064/2064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3002 ms. Remains : 1093/1234 places, 2064/2810 transitions.
Normalized transition count is 2055 out of 2064 initially.
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-23 06:06:34] [INFO ] Computed 142 place invariants in 63 ms
Incomplete random walk after 1000000 steps, including 70228 resets, run finished after 10021 ms. (steps per millisecond=99 ) properties (out of 6) seen :11
FORMULA PolyORBNT-PT-S10J60-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7184 resets, run finished after 1825 ms. (steps per millisecond=547 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000000 steps, including 7201 resets, run finished after 1829 ms. (steps per millisecond=546 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 7056 resets, run finished after 1824 ms. (steps per millisecond=548 ) properties (out of 3) seen :7
[2023-03-23 06:06:49] [INFO ] Flow matrix only has 2055 transitions (discarded 9 similar events)
// Phase 1: matrix 2055 rows 1093 cols
[2023-03-23 06:06:49] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-23 06:06:50] [INFO ] [Real]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-23 06:06:50] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 29 ms returned sat
[2023-03-23 06:06:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:51] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2023-03-23 06:06:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:06:51] [INFO ] [Nat]Absence check using 122 positive place invariants in 28 ms returned sat
[2023-03-23 06:06:51] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 28 ms returned sat
[2023-03-23 06:06:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:06:52] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2023-03-23 06:06:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:06:55] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 06:06:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 3535 ms returned sat
[2023-03-23 06:06:56] [INFO ] Deduced a trap composed of 430 places in 468 ms of which 1 ms to minimize.
[2023-03-23 06:06:56] [INFO ] Deduced a trap composed of 452 places in 516 ms of which 1 ms to minimize.
[2023-03-23 06:06:57] [INFO ] Deduced a trap composed of 461 places in 472 ms of which 1 ms to minimize.
[2023-03-23 06:06:57] [INFO ] Deduced a trap composed of 450 places in 475 ms of which 0 ms to minimize.
[2023-03-23 06:06:58] [INFO ] Deduced a trap composed of 461 places in 468 ms of which 1 ms to minimize.
[2023-03-23 06:06:59] [INFO ] Deduced a trap composed of 457 places in 474 ms of which 1 ms to minimize.
[2023-03-23 06:06:59] [INFO ] Deduced a trap composed of 468 places in 523 ms of which 1 ms to minimize.
[2023-03-23 06:07:00] [INFO ] Deduced a trap composed of 445 places in 493 ms of which 1 ms to minimize.
[2023-03-23 06:07:01] [INFO ] Deduced a trap composed of 475 places in 488 ms of which 1 ms to minimize.
[2023-03-23 06:07:01] [INFO ] Deduced a trap composed of 444 places in 468 ms of which 1 ms to minimize.
[2023-03-23 06:07:02] [INFO ] Deduced a trap composed of 442 places in 495 ms of which 1 ms to minimize.
[2023-03-23 06:07:02] [INFO ] Deduced a trap composed of 457 places in 495 ms of which 1 ms to minimize.
[2023-03-23 06:07:03] [INFO ] Deduced a trap composed of 438 places in 480 ms of which 0 ms to minimize.
[2023-03-23 06:07:04] [INFO ] Deduced a trap composed of 448 places in 483 ms of which 3 ms to minimize.
[2023-03-23 06:07:04] [INFO ] Deduced a trap composed of 460 places in 491 ms of which 1 ms to minimize.
[2023-03-23 06:07:05] [INFO ] Deduced a trap composed of 448 places in 514 ms of which 1 ms to minimize.
[2023-03-23 06:07:06] [INFO ] Deduced a trap composed of 458 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:07:06] [INFO ] Deduced a trap composed of 458 places in 498 ms of which 1 ms to minimize.
[2023-03-23 06:07:07] [INFO ] Deduced a trap composed of 442 places in 506 ms of which 1 ms to minimize.
[2023-03-23 06:07:08] [INFO ] Deduced a trap composed of 456 places in 498 ms of which 1 ms to minimize.
[2023-03-23 06:07:08] [INFO ] Deduced a trap composed of 473 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:07:09] [INFO ] Deduced a trap composed of 446 places in 510 ms of which 1 ms to minimize.
[2023-03-23 06:07:09] [INFO ] Deduced a trap composed of 458 places in 517 ms of which 1 ms to minimize.
[2023-03-23 06:07:10] [INFO ] Deduced a trap composed of 456 places in 516 ms of which 1 ms to minimize.
[2023-03-23 06:07:11] [INFO ] Deduced a trap composed of 442 places in 512 ms of which 0 ms to minimize.
[2023-03-23 06:07:11] [INFO ] Deduced a trap composed of 460 places in 503 ms of which 1 ms to minimize.
[2023-03-23 06:07:12] [INFO ] Deduced a trap composed of 459 places in 507 ms of which 1 ms to minimize.
[2023-03-23 06:07:13] [INFO ] Deduced a trap composed of 464 places in 504 ms of which 1 ms to minimize.
[2023-03-23 06:07:13] [INFO ] Deduced a trap composed of 455 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:07:14] [INFO ] Deduced a trap composed of 428 places in 517 ms of which 1 ms to minimize.
[2023-03-23 06:07:15] [INFO ] Deduced a trap composed of 447 places in 510 ms of which 1 ms to minimize.
[2023-03-23 06:07:16] [INFO ] Deduced a trap composed of 462 places in 464 ms of which 1 ms to minimize.
[2023-03-23 06:07:16] [INFO ] Deduced a trap composed of 446 places in 485 ms of which 5 ms to minimize.
[2023-03-23 06:07:17] [INFO ] Deduced a trap composed of 443 places in 477 ms of which 1 ms to minimize.
[2023-03-23 06:07:19] [INFO ] Deduced a trap composed of 448 places in 488 ms of which 0 ms to minimize.
[2023-03-23 06:07:20] [INFO ] Deduced a trap composed of 456 places in 519 ms of which 1 ms to minimize.
[2023-03-23 06:07:22] [INFO ] Deduced a trap composed of 440 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:07:22] [INFO ] Deduced a trap composed of 454 places in 503 ms of which 1 ms to minimize.
[2023-03-23 06:07:23] [INFO ] Deduced a trap composed of 454 places in 509 ms of which 1 ms to minimize.
[2023-03-23 06:07:24] [INFO ] Deduced a trap composed of 442 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:07:24] [INFO ] Deduced a trap composed of 436 places in 508 ms of which 0 ms to minimize.
[2023-03-23 06:07:25] [INFO ] Deduced a trap composed of 473 places in 509 ms of which 0 ms to minimize.
[2023-03-23 06:07:26] [INFO ] Deduced a trap composed of 460 places in 487 ms of which 1 ms to minimize.
[2023-03-23 06:07:26] [INFO ] Deduced a trap composed of 452 places in 471 ms of which 1 ms to minimize.
[2023-03-23 06:07:27] [INFO ] Deduced a trap composed of 475 places in 517 ms of which 1 ms to minimize.
[2023-03-23 06:07:28] [INFO ] Deduced a trap composed of 448 places in 491 ms of which 0 ms to minimize.
[2023-03-23 06:07:29] [INFO ] Deduced a trap composed of 446 places in 513 ms of which 1 ms to minimize.
[2023-03-23 06:07:30] [INFO ] Deduced a trap composed of 455 places in 529 ms of which 1 ms to minimize.
[2023-03-23 06:07:30] [INFO ] Deduced a trap composed of 475 places in 471 ms of which 1 ms to minimize.
[2023-03-23 06:07:31] [INFO ] Deduced a trap composed of 465 places in 481 ms of which 5 ms to minimize.
[2023-03-23 06:07:31] [INFO ] Deduced a trap composed of 443 places in 530 ms of which 1 ms to minimize.
[2023-03-23 06:07:32] [INFO ] Deduced a trap composed of 471 places in 487 ms of which 1 ms to minimize.
[2023-03-23 06:07:33] [INFO ] Deduced a trap composed of 471 places in 472 ms of which 1 ms to minimize.
[2023-03-23 06:07:34] [INFO ] Deduced a trap composed of 450 places in 468 ms of which 1 ms to minimize.
[2023-03-23 06:07:36] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 40618 ms
[2023-03-23 06:07:36] [INFO ] [Real]Absence check using 122 positive place invariants in 28 ms returned sat
[2023-03-23 06:07:36] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 29 ms returned sat
[2023-03-23 06:07:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:07:37] [INFO ] [Real]Absence check using state equation in 1204 ms returned sat
[2023-03-23 06:07:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:07:37] [INFO ] [Nat]Absence check using 122 positive place invariants in 31 ms returned sat
[2023-03-23 06:07:37] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 28 ms returned sat
[2023-03-23 06:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:08:22] [INFO ] [Nat]Absence check using state equation in 44852 ms returned unknown
[2023-03-23 06:08:22] [INFO ] [Real]Absence check using 122 positive place invariants in 28 ms returned sat
[2023-03-23 06:08:22] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [118, 118, 1] Max seen :[3, 3, 1]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 1093 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1093/1093 places, 2064/2064 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1093 transition count 2063
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1092 transition count 2063
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1092 transition count 2062
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1091 transition count 2062
Applied a total of 4 rules in 93 ms. Remains 1091 /1093 variables (removed 2) and now considering 2062/2064 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1091/1093 places, 2062/2064 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:08:23] [INFO ] Computed 142 place invariants in 43 ms
Incomplete random walk after 1000000 steps, including 70049 resets, run finished after 10342 ms. (steps per millisecond=96 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 7004 resets, run finished after 1946 ms. (steps per millisecond=513 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 7106 resets, run finished after 1968 ms. (steps per millisecond=508 ) properties (out of 2) seen :4
[2023-03-23 06:08:37] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:08:37] [INFO ] Computed 142 place invariants in 48 ms
[2023-03-23 06:08:37] [INFO ] [Real]Absence check using 122 positive place invariants in 28 ms returned sat
[2023-03-23 06:08:37] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 36 ms returned sat
[2023-03-23 06:08:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:08:38] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2023-03-23 06:08:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:08:38] [INFO ] [Nat]Absence check using 122 positive place invariants in 29 ms returned sat
[2023-03-23 06:08:38] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 24 ms returned sat
[2023-03-23 06:08:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:08:39] [INFO ] [Nat]Absence check using state equation in 590 ms returned sat
[2023-03-23 06:08:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:08:42] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 06:08:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 3204 ms returned sat
[2023-03-23 06:08:43] [INFO ] Deduced a trap composed of 429 places in 526 ms of which 1 ms to minimize.
[2023-03-23 06:08:43] [INFO ] Deduced a trap composed of 442 places in 504 ms of which 1 ms to minimize.
[2023-03-23 06:08:44] [INFO ] Deduced a trap composed of 436 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:08:44] [INFO ] Deduced a trap composed of 440 places in 511 ms of which 0 ms to minimize.
[2023-03-23 06:08:45] [INFO ] Deduced a trap composed of 466 places in 518 ms of which 1 ms to minimize.
[2023-03-23 06:08:46] [INFO ] Deduced a trap composed of 460 places in 492 ms of which 1 ms to minimize.
[2023-03-23 06:08:46] [INFO ] Deduced a trap composed of 442 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:08:47] [INFO ] Deduced a trap composed of 451 places in 502 ms of which 1 ms to minimize.
[2023-03-23 06:08:47] [INFO ] Deduced a trap composed of 443 places in 480 ms of which 2 ms to minimize.
[2023-03-23 06:08:48] [INFO ] Deduced a trap composed of 436 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:08:48] [INFO ] Deduced a trap composed of 434 places in 498 ms of which 2 ms to minimize.
[2023-03-23 06:08:49] [INFO ] Deduced a trap composed of 446 places in 519 ms of which 1 ms to minimize.
[2023-03-23 06:08:50] [INFO ] Deduced a trap composed of 434 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:08:51] [INFO ] Deduced a trap composed of 438 places in 509 ms of which 1 ms to minimize.
[2023-03-23 06:08:52] [INFO ] Deduced a trap composed of 434 places in 475 ms of which 1 ms to minimize.
[2023-03-23 06:08:53] [INFO ] Deduced a trap composed of 426 places in 471 ms of which 0 ms to minimize.
[2023-03-23 06:08:53] [INFO ] Deduced a trap composed of 443 places in 478 ms of which 1 ms to minimize.
[2023-03-23 06:08:54] [INFO ] Deduced a trap composed of 444 places in 477 ms of which 1 ms to minimize.
[2023-03-23 06:08:54] [INFO ] Deduced a trap composed of 453 places in 468 ms of which 1 ms to minimize.
[2023-03-23 06:08:55] [INFO ] Deduced a trap composed of 450 places in 468 ms of which 1 ms to minimize.
[2023-03-23 06:08:55] [INFO ] Deduced a trap composed of 438 places in 504 ms of which 1 ms to minimize.
[2023-03-23 06:08:56] [INFO ] Deduced a trap composed of 424 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:08:57] [INFO ] Deduced a trap composed of 439 places in 506 ms of which 1 ms to minimize.
[2023-03-23 06:08:57] [INFO ] Deduced a trap composed of 430 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:08:58] [INFO ] Deduced a trap composed of 426 places in 502 ms of which 1 ms to minimize.
[2023-03-23 06:08:59] [INFO ] Deduced a trap composed of 432 places in 501 ms of which 0 ms to minimize.
[2023-03-23 06:08:59] [INFO ] Deduced a trap composed of 444 places in 523 ms of which 1 ms to minimize.
[2023-03-23 06:09:00] [INFO ] Deduced a trap composed of 426 places in 512 ms of which 1 ms to minimize.
[2023-03-23 06:09:00] [INFO ] Deduced a trap composed of 428 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:09:01] [INFO ] Deduced a trap composed of 430 places in 521 ms of which 1 ms to minimize.
[2023-03-23 06:09:01] [INFO ] Deduced a trap composed of 434 places in 514 ms of which 1 ms to minimize.
[2023-03-23 06:09:02] [INFO ] Deduced a trap composed of 432 places in 506 ms of which 1 ms to minimize.
[2023-03-23 06:09:03] [INFO ] Deduced a trap composed of 436 places in 513 ms of which 1 ms to minimize.
[2023-03-23 06:09:06] [INFO ] Deduced a trap composed of 443 places in 508 ms of which 1 ms to minimize.
[2023-03-23 06:09:06] [INFO ] Deduced a trap composed of 434 places in 518 ms of which 1 ms to minimize.
[2023-03-23 06:09:07] [INFO ] Deduced a trap composed of 451 places in 507 ms of which 1 ms to minimize.
[2023-03-23 06:09:08] [INFO ] Deduced a trap composed of 434 places in 498 ms of which 1 ms to minimize.
[2023-03-23 06:09:10] [INFO ] Deduced a trap composed of 450 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:09:10] [INFO ] Deduced a trap composed of 428 places in 508 ms of which 1 ms to minimize.
[2023-03-23 06:09:11] [INFO ] Deduced a trap composed of 429 places in 507 ms of which 1 ms to minimize.
[2023-03-23 06:09:11] [INFO ] Deduced a trap composed of 451 places in 468 ms of which 1 ms to minimize.
[2023-03-23 06:09:12] [INFO ] Deduced a trap composed of 439 places in 497 ms of which 0 ms to minimize.
[2023-03-23 06:09:12] [INFO ] Deduced a trap composed of 448 places in 493 ms of which 1 ms to minimize.
[2023-03-23 06:09:14] [INFO ] Deduced a trap composed of 454 places in 503 ms of which 1 ms to minimize.
[2023-03-23 06:09:14] [INFO ] Deduced a trap composed of 443 places in 510 ms of which 1 ms to minimize.
[2023-03-23 06:09:15] [INFO ] Deduced a trap composed of 470 places in 498 ms of which 1 ms to minimize.
[2023-03-23 06:09:16] [INFO ] Deduced a trap composed of 446 places in 504 ms of which 1 ms to minimize.
[2023-03-23 06:09:16] [INFO ] Deduced a trap composed of 453 places in 493 ms of which 1 ms to minimize.
[2023-03-23 06:09:17] [INFO ] Deduced a trap composed of 422 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:09:18] [INFO ] Deduced a trap composed of 449 places in 508 ms of which 1 ms to minimize.
[2023-03-23 06:09:18] [INFO ] Deduced a trap composed of 453 places in 493 ms of which 1 ms to minimize.
[2023-03-23 06:09:20] [INFO ] Deduced a trap composed of 451 places in 501 ms of which 1 ms to minimize.
[2023-03-23 06:09:20] [INFO ] Deduced a trap composed of 453 places in 497 ms of which 1 ms to minimize.
[2023-03-23 06:09:21] [INFO ] Deduced a trap composed of 463 places in 469 ms of which 1 ms to minimize.
[2023-03-23 06:09:21] [INFO ] Deduced a trap composed of 454 places in 510 ms of which 1 ms to minimize.
[2023-03-23 06:09:22] [INFO ] Deduced a trap composed of 463 places in 519 ms of which 1 ms to minimize.
[2023-03-23 06:09:23] [INFO ] Deduced a trap composed of 432 places in 504 ms of which 1 ms to minimize.
[2023-03-23 06:09:23] [INFO ] Trap strengthening (SAT) tested/added 57/57 trap constraints in 41034 ms
[2023-03-23 06:09:23] [INFO ] [Real]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-23 06:09:23] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2023-03-23 06:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:24] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2023-03-23 06:09:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:09:24] [INFO ] [Nat]Absence check using 122 positive place invariants in 32 ms returned sat
[2023-03-23 06:09:24] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 24 ms returned sat
[2023-03-23 06:09:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:09:25] [INFO ] [Nat]Absence check using state equation in 593 ms returned sat
[2023-03-23 06:09:28] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 06:09:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 4957 ms returned sat
[2023-03-23 06:09:31] [INFO ] Deduced a trap composed of 428 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:09:31] [INFO ] Deduced a trap composed of 436 places in 507 ms of which 1 ms to minimize.
[2023-03-23 06:09:32] [INFO ] Deduced a trap composed of 434 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:09:32] [INFO ] Deduced a trap composed of 452 places in 495 ms of which 1 ms to minimize.
[2023-03-23 06:09:33] [INFO ] Deduced a trap composed of 436 places in 483 ms of which 1 ms to minimize.
[2023-03-23 06:09:34] [INFO ] Deduced a trap composed of 441 places in 477 ms of which 1 ms to minimize.
[2023-03-23 06:09:34] [INFO ] Deduced a trap composed of 452 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:09:35] [INFO ] Deduced a trap composed of 432 places in 506 ms of which 0 ms to minimize.
[2023-03-23 06:09:36] [INFO ] Deduced a trap composed of 450 places in 512 ms of which 1 ms to minimize.
[2023-03-23 06:09:36] [INFO ] Deduced a trap composed of 442 places in 507 ms of which 1 ms to minimize.
[2023-03-23 06:09:37] [INFO ] Deduced a trap composed of 444 places in 510 ms of which 1 ms to minimize.
[2023-03-23 06:09:38] [INFO ] Deduced a trap composed of 447 places in 516 ms of which 1 ms to minimize.
[2023-03-23 06:09:38] [INFO ] Deduced a trap composed of 437 places in 512 ms of which 1 ms to minimize.
[2023-03-23 06:09:39] [INFO ] Deduced a trap composed of 440 places in 513 ms of which 1 ms to minimize.
[2023-03-23 06:09:39] [INFO ] Deduced a trap composed of 444 places in 511 ms of which 1 ms to minimize.
[2023-03-23 06:09:40] [INFO ] Deduced a trap composed of 442 places in 520 ms of which 1 ms to minimize.
[2023-03-23 06:09:41] [INFO ] Deduced a trap composed of 422 places in 515 ms of which 1 ms to minimize.
[2023-03-23 06:09:41] [INFO ] Deduced a trap composed of 450 places in 514 ms of which 1 ms to minimize.
[2023-03-23 06:09:42] [INFO ] Deduced a trap composed of 444 places in 517 ms of which 2 ms to minimize.
[2023-03-23 06:09:43] [INFO ] Deduced a trap composed of 451 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:09:44] [INFO ] Deduced a trap composed of 434 places in 508 ms of which 1 ms to minimize.
[2023-03-23 06:09:45] [INFO ] Deduced a trap composed of 433 places in 514 ms of which 1 ms to minimize.
[2023-03-23 06:09:45] [INFO ] Deduced a trap composed of 440 places in 502 ms of which 1 ms to minimize.
[2023-03-23 06:09:46] [INFO ] Deduced a trap composed of 462 places in 477 ms of which 1 ms to minimize.
[2023-03-23 06:09:47] [INFO ] Deduced a trap composed of 434 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:09:47] [INFO ] Deduced a trap composed of 425 places in 517 ms of which 1 ms to minimize.
[2023-03-23 06:09:48] [INFO ] Deduced a trap composed of 430 places in 498 ms of which 1 ms to minimize.
[2023-03-23 06:09:49] [INFO ] Deduced a trap composed of 460 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:09:50] [INFO ] Deduced a trap composed of 432 places in 476 ms of which 1 ms to minimize.
[2023-03-23 06:09:50] [INFO ] Deduced a trap composed of 460 places in 509 ms of which 2 ms to minimize.
[2023-03-23 06:09:51] [INFO ] Deduced a trap composed of 458 places in 514 ms of which 1 ms to minimize.
[2023-03-23 06:09:52] [INFO ] Deduced a trap composed of 459 places in 502 ms of which 1 ms to minimize.
[2023-03-23 06:09:53] [INFO ] Deduced a trap composed of 448 places in 510 ms of which 1 ms to minimize.
[2023-03-23 06:09:55] [INFO ] Deduced a trap composed of 460 places in 515 ms of which 0 ms to minimize.
[2023-03-23 06:09:55] [INFO ] Deduced a trap composed of 438 places in 507 ms of which 1 ms to minimize.
[2023-03-23 06:09:56] [INFO ] Deduced a trap composed of 436 places in 498 ms of which 1 ms to minimize.
[2023-03-23 06:09:57] [INFO ] Deduced a trap composed of 432 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:09:57] [INFO ] Deduced a trap composed of 434 places in 494 ms of which 1 ms to minimize.
[2023-03-23 06:09:58] [INFO ] Deduced a trap composed of 462 places in 484 ms of which 1 ms to minimize.
[2023-03-23 06:09:58] [INFO ] Deduced a trap composed of 432 places in 469 ms of which 1 ms to minimize.
[2023-03-23 06:09:59] [INFO ] Deduced a trap composed of 422 places in 489 ms of which 1 ms to minimize.
[2023-03-23 06:09:59] [INFO ] Deduced a trap composed of 452 places in 473 ms of which 1 ms to minimize.
[2023-03-23 06:10:00] [INFO ] Deduced a trap composed of 450 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:10:01] [INFO ] Deduced a trap composed of 446 places in 518 ms of which 1 ms to minimize.
[2023-03-23 06:10:02] [INFO ] Deduced a trap composed of 434 places in 467 ms of which 0 ms to minimize.
[2023-03-23 06:10:03] [INFO ] Deduced a trap composed of 426 places in 469 ms of which 0 ms to minimize.
[2023-03-23 06:10:03] [INFO ] Deduced a trap composed of 436 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:10:04] [INFO ] Deduced a trap composed of 434 places in 471 ms of which 1 ms to minimize.
[2023-03-23 06:10:05] [INFO ] Deduced a trap composed of 444 places in 478 ms of which 1 ms to minimize.
[2023-03-23 06:10:05] [INFO ] Deduced a trap composed of 461 places in 469 ms of which 1 ms to minimize.
[2023-03-23 06:10:06] [INFO ] Deduced a trap composed of 468 places in 470 ms of which 2 ms to minimize.
[2023-03-23 06:10:07] [INFO ] Deduced a trap composed of 442 places in 475 ms of which 0 ms to minimize.
[2023-03-23 06:10:08] [INFO ] Deduced a trap composed of 456 places in 509 ms of which 1 ms to minimize.
[2023-03-23 06:10:08] [INFO ] Deduced a trap composed of 440 places in 470 ms of which 1 ms to minimize.
[2023-03-23 06:10:09] [INFO ] Deduced a trap composed of 458 places in 467 ms of which 1 ms to minimize.
[2023-03-23 06:10:10] [INFO ] Deduced a trap composed of 460 places in 514 ms of which 1 ms to minimize.
[2023-03-23 06:10:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
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)
Current structural bounds on expressions (after SMT) : [118, 118] Max seen :[3, 3]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 75 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 61 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 06:10:10] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:10:10] [INFO ] Invariant cache hit.
[2023-03-23 06:10:12] [INFO ] Implicit Places using invariants in 1984 ms returned []
[2023-03-23 06:10:12] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:10:12] [INFO ] Invariant cache hit.
[2023-03-23 06:10:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:10:30] [INFO ] Implicit Places using invariants and state equation in 17823 ms returned []
Implicit Place search using SMT with State Equation took 19813 ms to find 0 implicit places.
[2023-03-23 06:10:30] [INFO ] Redundant transitions in 135 ms returned []
[2023-03-23 06:10:30] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:10:30] [INFO ] Invariant cache hit.
[2023-03-23 06:10:31] [INFO ] Dead Transitions using invariants and state equation in 1667 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21695 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-00
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:10:31] [INFO ] Computed 142 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 717 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :3
[2023-03-23 06:10:32] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:10:32] [INFO ] Computed 142 place invariants in 41 ms
[2023-03-23 06:10:32] [INFO ] [Real]Absence check using 122 positive place invariants in 29 ms returned sat
[2023-03-23 06:10:32] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 28 ms returned sat
[2023-03-23 06:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:10:33] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2023-03-23 06:10:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:10:33] [INFO ] [Nat]Absence check using 122 positive place invariants in 29 ms returned sat
[2023-03-23 06:10:33] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2023-03-23 06:10:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:10:34] [INFO ] [Nat]Absence check using state equation in 567 ms returned sat
[2023-03-23 06:10:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:10:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 06:10:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 4190 ms returned sat
[2023-03-23 06:10:38] [INFO ] Deduced a trap composed of 422 places in 519 ms of which 1 ms to minimize.
[2023-03-23 06:10:38] [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 0
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:733)
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)
Current structural bounds on expressions (after SMT) : [136] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 61 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 06:10:38] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:10:38] [INFO ] Invariant cache hit.
[2023-03-23 06:10:40] [INFO ] Dead Transitions using invariants and state equation in 1758 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1820 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:10:40] [INFO ] Computed 142 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 70436 resets, run finished after 10150 ms. (steps per millisecond=98 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7092 resets, run finished after 1929 ms. (steps per millisecond=518 ) properties (out of 1) seen :3
[2023-03-23 06:10:52] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:10:52] [INFO ] Computed 142 place invariants in 49 ms
[2023-03-23 06:10:52] [INFO ] [Real]Absence check using 122 positive place invariants in 28 ms returned sat
[2023-03-23 06:10:53] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 27 ms returned sat
[2023-03-23 06:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:10:53] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2023-03-23 06:10:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:10:54] [INFO ] [Nat]Absence check using 122 positive place invariants in 30 ms returned sat
[2023-03-23 06:10:54] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2023-03-23 06:10:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:10:54] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2023-03-23 06:10:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:10:57] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 06:10:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 5086 ms returned sat
[2023-03-23 06:11:00] [INFO ] Deduced a trap composed of 428 places in 474 ms of which 1 ms to minimize.
[2023-03-23 06:11:01] [INFO ] Deduced a trap composed of 436 places in 526 ms of which 1 ms to minimize.
[2023-03-23 06:11:01] [INFO ] Deduced a trap composed of 431 places in 530 ms of which 1 ms to minimize.
[2023-03-23 06:11:02] [INFO ] Deduced a trap composed of 452 places in 499 ms of which 0 ms to minimize.
[2023-03-23 06:11:02] [INFO ] Deduced a trap composed of 432 places in 508 ms of which 1 ms to minimize.
[2023-03-23 06:11:03] [INFO ] Deduced a trap composed of 458 places in 538 ms of which 1 ms to minimize.
[2023-03-23 06:11:04] [INFO ] Deduced a trap composed of 433 places in 502 ms of which 4 ms to minimize.
[2023-03-23 06:11:04] [INFO ] Deduced a trap composed of 448 places in 493 ms of which 1 ms to minimize.
[2023-03-23 06:11:05] [INFO ] Deduced a trap composed of 440 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:11:05] [INFO ] Deduced a trap composed of 424 places in 509 ms of which 1 ms to minimize.
[2023-03-23 06:11:06] [INFO ] Deduced a trap composed of 426 places in 492 ms of which 1 ms to minimize.
[2023-03-23 06:11:07] [INFO ] Deduced a trap composed of 438 places in 510 ms of which 1 ms to minimize.
[2023-03-23 06:11:07] [INFO ] Deduced a trap composed of 434 places in 503 ms of which 1 ms to minimize.
[2023-03-23 06:11:08] [INFO ] Deduced a trap composed of 434 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:11:08] [INFO ] Deduced a trap composed of 434 places in 531 ms of which 1 ms to minimize.
[2023-03-23 06:11:09] [INFO ] Deduced a trap composed of 437 places in 515 ms of which 1 ms to minimize.
[2023-03-23 06:11:10] [INFO ] Deduced a trap composed of 448 places in 518 ms of which 1 ms to minimize.
[2023-03-23 06:11:10] [INFO ] Deduced a trap composed of 440 places in 521 ms of which 1 ms to minimize.
[2023-03-23 06:11:11] [INFO ] Deduced a trap composed of 436 places in 538 ms of which 1 ms to minimize.
[2023-03-23 06:11:12] [INFO ] Deduced a trap composed of 442 places in 483 ms of which 1 ms to minimize.
[2023-03-23 06:11:12] [INFO ] Deduced a trap composed of 440 places in 513 ms of which 1 ms to minimize.
[2023-03-23 06:11:13] [INFO ] Deduced a trap composed of 437 places in 500 ms of which 1 ms to minimize.
[2023-03-23 06:11:14] [INFO ] Deduced a trap composed of 446 places in 506 ms of which 1 ms to minimize.
[2023-03-23 06:11:14] [INFO ] Deduced a trap composed of 480 places in 502 ms of which 1 ms to minimize.
[2023-03-23 06:11:15] [INFO ] Deduced a trap composed of 454 places in 490 ms of which 1 ms to minimize.
[2023-03-23 06:11:15] [INFO ] Deduced a trap composed of 458 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:11:16] [INFO ] Deduced a trap composed of 433 places in 495 ms of which 1 ms to minimize.
[2023-03-23 06:11:16] [INFO ] Deduced a trap composed of 453 places in 491 ms of which 1 ms to minimize.
[2023-03-23 06:11:18] [INFO ] Deduced a trap composed of 442 places in 527 ms of which 1 ms to minimize.
[2023-03-23 06:11:18] [INFO ] Deduced a trap composed of 428 places in 502 ms of which 1 ms to minimize.
[2023-03-23 06:11:19] [INFO ] Deduced a trap composed of 450 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:11:20] [INFO ] Deduced a trap composed of 454 places in 519 ms of which 1 ms to minimize.
[2023-03-23 06:11:20] [INFO ] Deduced a trap composed of 436 places in 496 ms of which 1 ms to minimize.
[2023-03-23 06:11:21] [INFO ] Deduced a trap composed of 442 places in 495 ms of which 1 ms to minimize.
[2023-03-23 06:11:22] [INFO ] Deduced a trap composed of 438 places in 484 ms of which 1 ms to minimize.
[2023-03-23 06:11:22] [INFO ] Deduced a trap composed of 434 places in 475 ms of which 1 ms to minimize.
[2023-03-23 06:11:23] [INFO ] Deduced a trap composed of 440 places in 495 ms of which 1 ms to minimize.
[2023-03-23 06:11:24] [INFO ] Deduced a trap composed of 436 places in 488 ms of which 1 ms to minimize.
[2023-03-23 06:11:24] [INFO ] Deduced a trap composed of 440 places in 504 ms of which 1 ms to minimize.
[2023-03-23 06:11:25] [INFO ] Deduced a trap composed of 444 places in 485 ms of which 1 ms to minimize.
[2023-03-23 06:11:26] [INFO ] Deduced a trap composed of 442 places in 493 ms of which 0 ms to minimize.
[2023-03-23 06:11:27] [INFO ] Deduced a trap composed of 436 places in 561 ms of which 1 ms to minimize.
[2023-03-23 06:11:27] [INFO ] Deduced a trap composed of 439 places in 533 ms of which 1 ms to minimize.
[2023-03-23 06:11:28] [INFO ] Deduced a trap composed of 434 places in 484 ms of which 1 ms to minimize.
[2023-03-23 06:11:29] [INFO ] Deduced a trap composed of 432 places in 491 ms of which 1 ms to minimize.
[2023-03-23 06:11:30] [INFO ] Deduced a trap composed of 462 places in 478 ms of which 1 ms to minimize.
[2023-03-23 06:11:31] [INFO ] Deduced a trap composed of 447 places in 484 ms of which 0 ms to minimize.
[2023-03-23 06:11:31] [INFO ] Deduced a trap composed of 430 places in 501 ms of which 1 ms to minimize.
[2023-03-23 06:11:33] [INFO ] Deduced a trap composed of 451 places in 485 ms of which 1 ms to minimize.
[2023-03-23 06:11:33] [INFO ] Deduced a trap composed of 434 places in 494 ms of which 0 ms to minimize.
[2023-03-23 06:11:34] [INFO ] Deduced a trap composed of 451 places in 497 ms of which 1 ms to minimize.
[2023-03-23 06:11:35] [INFO ] Deduced a trap composed of 448 places in 500 ms of which 0 ms to minimize.
[2023-03-23 06:11:35] [INFO ] Deduced a trap composed of 440 places in 488 ms of which 1 ms to minimize.
[2023-03-23 06:11:37] [INFO ] Deduced a trap composed of 424 places in 513 ms of which 1 ms to minimize.
[2023-03-23 06:11:39] [INFO ] Deduced a trap composed of 436 places in 489 ms of which 0 ms to minimize.
[2023-03-23 06:11:39] [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 0
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:733)
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)
Current structural bounds on expressions (after SMT) : [136] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 92 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 79 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 06:11:39] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:11:39] [INFO ] Invariant cache hit.
[2023-03-23 06:11:41] [INFO ] Implicit Places using invariants in 2019 ms returned []
[2023-03-23 06:11:41] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:11:41] [INFO ] Invariant cache hit.
[2023-03-23 06:11:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:12:00] [INFO ] Implicit Places using invariants and state equation in 19541 ms returned []
Implicit Place search using SMT with State Equation took 21561 ms to find 0 implicit places.
[2023-03-23 06:12:01] [INFO ] Redundant transitions in 123 ms returned []
[2023-03-23 06:12:01] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:12:01] [INFO ] Invariant cache hit.
[2023-03-23 06:12:02] [INFO ] Dead Transitions using invariants and state equation in 1628 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23432 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-00 in 90850 ms.
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-04
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:12:02] [INFO ] Computed 142 place invariants in 34 ms
Incomplete random walk after 10000 steps, including 725 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2023-03-23 06:12:02] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:12:02] [INFO ] Computed 142 place invariants in 42 ms
[2023-03-23 06:12:03] [INFO ] [Real]Absence check using 122 positive place invariants in 25 ms returned sat
[2023-03-23 06:12:03] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2023-03-23 06:12:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:12:03] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2023-03-23 06:12:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:12:04] [INFO ] [Nat]Absence check using 122 positive place invariants in 28 ms returned sat
[2023-03-23 06:12:04] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 23 ms returned sat
[2023-03-23 06:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:12:04] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
[2023-03-23 06:12:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:12:07] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 06:12:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 4306 ms returned unknown
Current structural bounds on expressions (after SMT) : [136] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 59 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 06:12:09] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:12:09] [INFO ] Invariant cache hit.
[2023-03-23 06:12:10] [INFO ] Dead Transitions using invariants and state equation in 1691 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1759 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:12:10] [INFO ] Computed 142 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 70122 resets, run finished after 9882 ms. (steps per millisecond=101 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7173 resets, run finished after 1872 ms. (steps per millisecond=534 ) properties (out of 1) seen :3
[2023-03-23 06:12:22] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2023-03-23 06:12:22] [INFO ] Computed 142 place invariants in 38 ms
[2023-03-23 06:12:22] [INFO ] [Real]Absence check using 122 positive place invariants in 27 ms returned sat
[2023-03-23 06:12:22] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2023-03-23 06:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 06:12:23] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2023-03-23 06:12:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 06:12:23] [INFO ] [Nat]Absence check using 122 positive place invariants in 28 ms returned sat
[2023-03-23 06:12:23] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 26 ms returned sat
[2023-03-23 06:12:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 06:12:24] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2023-03-23 06:12:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:12:27] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-23 06:12:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 5128 ms returned sat
[2023-03-23 06:12:30] [INFO ] Deduced a trap composed of 438 places in 486 ms of which 1 ms to minimize.
[2023-03-23 06:12:30] [INFO ] Deduced a trap composed of 434 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:12:31] [INFO ] Deduced a trap composed of 440 places in 506 ms of which 0 ms to minimize.
[2023-03-23 06:12:31] [INFO ] Deduced a trap composed of 420 places in 524 ms of which 1 ms to minimize.
[2023-03-23 06:12:32] [INFO ] Deduced a trap composed of 438 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:12:33] [INFO ] Deduced a trap composed of 426 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:12:33] [INFO ] Deduced a trap composed of 418 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:12:34] [INFO ] Deduced a trap composed of 436 places in 492 ms of which 1 ms to minimize.
[2023-03-23 06:12:34] [INFO ] Deduced a trap composed of 428 places in 490 ms of which 1 ms to minimize.
[2023-03-23 06:12:35] [INFO ] Deduced a trap composed of 434 places in 523 ms of which 1 ms to minimize.
[2023-03-23 06:12:36] [INFO ] Deduced a trap composed of 432 places in 498 ms of which 1 ms to minimize.
[2023-03-23 06:12:36] [INFO ] Deduced a trap composed of 438 places in 514 ms of which 1 ms to minimize.
[2023-03-23 06:12:37] [INFO ] Deduced a trap composed of 479 places in 508 ms of which 1 ms to minimize.
[2023-03-23 06:12:38] [INFO ] Deduced a trap composed of 449 places in 515 ms of which 1 ms to minimize.
[2023-03-23 06:12:38] [INFO ] Deduced a trap composed of 445 places in 499 ms of which 1 ms to minimize.
[2023-03-23 06:12:39] [INFO ] Deduced a trap composed of 454 places in 536 ms of which 1 ms to minimize.
[2023-03-23 06:12:40] [INFO ] Deduced a trap composed of 464 places in 551 ms of which 1 ms to minimize.
[2023-03-23 06:12:40] [INFO ] Deduced a trap composed of 459 places in 548 ms of which 1 ms to minimize.
[2023-03-23 06:12:41] [INFO ] Deduced a trap composed of 430 places in 505 ms of which 1 ms to minimize.
[2023-03-23 06:12:41] [INFO ] Deduced a trap composed of 465 places in 509 ms of which 1 ms to minimize.
[2023-03-23 06:12:42] [INFO ] Deduced a trap composed of 439 places in 531 ms of which 1 ms to minimize.
[2023-03-23 06:12:43] [INFO ] Deduced a trap composed of 444 places in 530 ms of which 1 ms to minimize.
[2023-03-23 06:12:46] [INFO ] Trap strengthening (SAT) tested/added 22/22 trap constraints in 16617 ms
Current structural bounds on expressions (after SMT) : [136] Max seen :[3]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 70 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Applied a total of 0 rules in 89 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2023-03-23 06:12:46] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:12:46] [INFO ] Invariant cache hit.
[2023-03-23 06:12:48] [INFO ] Implicit Places using invariants in 1966 ms returned []
[2023-03-23 06:12:48] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:12:48] [INFO ] Invariant cache hit.
[2023-03-23 06:12:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 06:13:06] [INFO ] Implicit Places using invariants and state equation in 17722 ms returned []
Implicit Place search using SMT with State Equation took 19690 ms to find 0 implicit places.
[2023-03-23 06:13:06] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-23 06:13:06] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2023-03-23 06:13:06] [INFO ] Invariant cache hit.
[2023-03-23 06:13:07] [INFO ] Dead Transitions using invariants and state equation in 1692 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21547 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-04 in 65147 ms.
[2023-03-23 06:13:08] [INFO ] Flatten gal took : 375 ms
[2023-03-23 06:13:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-23 06:13:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1091 places, 2062 transitions and 11821 arcs took 23 ms.
Total runtime 445170 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running PolyORBNT (PT), instance S10J60
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 1091 places, 2062 transitions, 11821 arcs.
Final Score: 468255.887
Took : 46 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 14421912 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16083472 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="PolyORBNT-PT-S10J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is PolyORBNT-PT-S10J60, 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 r299-tall-167873953400781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S10J60.tgz
mv PolyORBNT-PT-S10J60 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;