Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 23K Apr 12 11:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 12 11:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 958K Apr 12 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.6M Apr 12 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 39K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 32K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Apr 12 14:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 14:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 12 13:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.7M Apr 12 13:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 13M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-00
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-01
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-02
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-03
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-04
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-05
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-06
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-07
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-08
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-09
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-10
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-11
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-12
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-13
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-14
FORMULA_NAME PolyORBNT-PT-S10J20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717132873753

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J20
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 05:21:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:21:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:21:16] [INFO ] Load time of PNML (sax parser for PT used): 709 ms
[2024-05-31 05:21:16] [INFO ] Transformed 474 places.
[2024-05-31 05:21:16] [INFO ] Transformed 11760 transitions.
[2024-05-31 05:21:16] [INFO ] Parsed PT model containing 474 places and 11760 transitions and 111119 arcs in 988 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Normalized transition count is 1641 out of 1650 initially.
// Phase 1: matrix 1641 rows 474 cols
[2024-05-31 05:21:16] [INFO ] Computed 72 invariants in 116 ms
FORMULA PolyORBNT-PT-S10J20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J20-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 560 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :11
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :11
[2024-05-31 05:21:17] [INFO ] Flow matrix only has 1641 transitions (discarded 9 similar events)
// Phase 1: matrix 1641 rows 474 cols
[2024-05-31 05:21:17] [INFO ] Computed 72 invariants in 63 ms
[2024-05-31 05:21:18] [INFO ] [Real]Absence check using 45 positive place invariants in 18 ms returned sat
[2024-05-31 05:21:18] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 12 ms returned unsat
[2024-05-31 05:21:18] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2024-05-31 05:21:18] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-31 05:21:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:19] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2024-05-31 05:21:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:21:19] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-31 05:21:19] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-31 05:21:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:24] [INFO ] [Nat]Absence check using state equation in 4785 ms returned unknown
[2024-05-31 05:21:24] [INFO ] [Real]Absence check using 45 positive place invariants in 22 ms returned sat
[2024-05-31 05:21:24] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 22 ms returned sat
[2024-05-31 05:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:25] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2024-05-31 05:21:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:21:25] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-31 05:21:25] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-31 05:21:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:27] [INFO ] [Nat]Absence check using state equation in 1762 ms returned sat
[2024-05-31 05:21:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:21:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 200 ms returned sat
[2024-05-31 05:21:27] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 322 ms.
[2024-05-31 05:21:29] [INFO ] Added : 31 causal constraints over 7 iterations in 1646 ms. Result :sat
Minimization took 606 ms.
[2024-05-31 05:21:30] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-31 05:21:30] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 5 ms returned unsat
[2024-05-31 05:21:30] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-31 05:21:30] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-31 05:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:30] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2024-05-31 05:21:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:21:31] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-31 05:21:31] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-31 05:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:36] [INFO ] [Nat]Absence check using state equation in 4929 ms returned unknown
[2024-05-31 05:21:36] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-31 05:21:36] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-31 05:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:36] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2024-05-31 05:21:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:21:36] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-31 05:21:36] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 18 ms returned sat
[2024-05-31 05:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:37] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-05-31 05:21:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 81 ms returned sat
[2024-05-31 05:21:37] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 154 ms.
[2024-05-31 05:21:41] [INFO ] Deduced a trap composed of 19 places in 475 ms of which 4 ms to minimize.
[2024-05-31 05:21:41] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 719 ms
[2024-05-31 05:21:43] [INFO ] Deduced a trap composed of 11 places in 1208 ms of which 6 ms to minimize.
[2024-05-31 05:21:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 05:21:43] [INFO ] [Real]Absence check using 45 positive place invariants in 12 ms returned sat
[2024-05-31 05:21:43] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 21 ms returned sat
[2024-05-31 05:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:44] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2024-05-31 05:21:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:21:44] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-31 05:21:44] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-31 05:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:49] [INFO ] [Nat]Absence check using state equation in 4898 ms returned unknown
[2024-05-31 05:21:49] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-31 05:21:49] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-31 05:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:49] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2024-05-31 05:21:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:21:49] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-31 05:21:49] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 14 ms returned sat
[2024-05-31 05:21:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:50] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2024-05-31 05:21:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 490 ms returned sat
[2024-05-31 05:21:51] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 230 ms.
[2024-05-31 05:21:52] [INFO ] Deduced a trap composed of 19 places in 573 ms of which 4 ms to minimize.
[2024-05-31 05:21:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 720 ms
[2024-05-31 05:21:52] [INFO ] Added : 27 causal constraints over 6 iterations in 1740 ms. Result :sat
Minimization took 628 ms.
[2024-05-31 05:21:53] [INFO ] [Real]Absence check using 45 positive place invariants in 27 ms returned sat
[2024-05-31 05:21:53] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 36 ms returned sat
[2024-05-31 05:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:54] [INFO ] [Real]Absence check using state equation in 864 ms returned sat
[2024-05-31 05:21:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:21:54] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-31 05:21:54] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 16 ms returned sat
[2024-05-31 05:21:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:21:54] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2024-05-31 05:21:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 82 ms returned sat
[2024-05-31 05:21:55] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 182 ms.
[2024-05-31 05:21:58] [INFO ] Deduced a trap composed of 19 places in 505 ms of which 2 ms to minimize.
[2024-05-31 05:21:59] [INFO ] Deduced a trap composed of 105 places in 468 ms of which 1 ms to minimize.
[2024-05-31 05:21:59] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1621 ms
[2024-05-31 05:21:59] [INFO ] Deduced a trap composed of 11 places in 514 ms of which 0 ms to minimize.
[2024-05-31 05:21:59] [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 8
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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-31 05:22:00] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-31 05:22:00] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2024-05-31 05:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:00] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2024-05-31 05:22:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:22:00] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-31 05:22:00] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 12 ms returned sat
[2024-05-31 05:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:05] [INFO ] [Nat]Absence check using state equation in 4936 ms returned unknown
[2024-05-31 05:22:05] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-31 05:22:05] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-31 05:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:06] [INFO ] [Real]Absence check using state equation in 728 ms returned sat
[2024-05-31 05:22:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:22:06] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-31 05:22:06] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 15 ms returned sat
[2024-05-31 05:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:07] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-05-31 05:22:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 45 ms returned sat
[2024-05-31 05:22:07] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 128 ms.
[2024-05-31 05:22:08] [INFO ] Deduced a trap composed of 232 places in 498 ms of which 0 ms to minimize.
[2024-05-31 05:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1330 ms
[2024-05-31 05:22:09] [INFO ] Added : 11 causal constraints over 3 iterations in 1984 ms. Result :sat
Minimization took 963 ms.
[2024-05-31 05:22:10] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-31 05:22:10] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-31 05:22:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:10] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2024-05-31 05:22:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:22:10] [INFO ] [Nat]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-31 05:22:10] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 18 ms returned sat
[2024-05-31 05:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:11] [INFO ] [Nat]Absence check using state equation in 766 ms returned sat
[2024-05-31 05:22:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 385 ms returned sat
[2024-05-31 05:22:12] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 168 ms.
[2024-05-31 05:22:13] [INFO ] Deduced a trap composed of 19 places in 369 ms of which 1 ms to minimize.
[2024-05-31 05:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 594 ms
[2024-05-31 05:22:15] [INFO ] Added : 32 causal constraints over 7 iterations in 3673 ms. Result :unknown
[2024-05-31 05:22:15] [INFO ] [Real]Absence check using 45 positive place invariants in 14 ms returned sat
[2024-05-31 05:22:15] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-31 05:22:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:16] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2024-05-31 05:22:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:22:16] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-31 05:22:16] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-31 05:22:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:17] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2024-05-31 05:22:20] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 05:22:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 4559 ms returned unknown
[2024-05-31 05:22:21] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-31 05:22:21] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 13 ms returned sat
[2024-05-31 05:22:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:22] [INFO ] [Real]Absence check using state equation in 752 ms returned sat
[2024-05-31 05:22:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:22:22] [INFO ] [Nat]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-31 05:22:22] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 17 ms returned sat
[2024-05-31 05:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:23] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2024-05-31 05:22:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 539 ms returned sat
[2024-05-31 05:22:24] [INFO ] Computed and/alt/rep : 1307/4443/1307 causal constraints (skipped 323 transitions) in 142 ms.
[2024-05-31 05:22:24] [INFO ] Added : 12 causal constraints over 3 iterations in 553 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : [10, 68, 23, 1, 158, 39, 158, 39, 39, 4, 118, 98, 752, 1] Max seen :[10, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 50 out of 474 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 474/474 places, 1650/1650 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 464 transition count 1626
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 60 place count 440 transition count 1624
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 438 transition count 1624
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 62 place count 438 transition count 1600
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 110 place count 414 transition count 1600
Applied a total of 110 rules in 302 ms. Remains 414 /474 variables (removed 60) and now considering 1600/1650 (removed 50) transitions.
[2024-05-31 05:22:26] [INFO ] Flow matrix only has 1591 transitions (discarded 9 similar events)
// Phase 1: matrix 1591 rows 414 cols
[2024-05-31 05:22:26] [INFO ] Computed 62 invariants in 19 ms
[2024-05-31 05:22:27] [INFO ] Dead Transitions using invariants and state equation in 1019 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 : 414/474 places, 985/1650 transitions.
Applied a total of 0 rules in 31 ms. Remains 414 /414 variables (removed 0) and now considering 985/985 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1356 ms. Remains : 414/474 places, 985/1650 transitions.
Normalized transition count is 976 out of 985 initially.
// Phase 1: matrix 976 rows 414 cols
[2024-05-31 05:22:27] [INFO ] Computed 62 invariants in 25 ms
Incomplete random walk after 1000000 steps, including 68575 resets, run finished after 8296 ms. (steps per millisecond=120 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 8951 resets, run finished after 2071 ms. (steps per millisecond=482 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 1000000 steps, including 9495 resets, run finished after 1890 ms. (steps per millisecond=529 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000000 steps, including 9494 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9557 resets, run finished after 1529 ms. (steps per millisecond=654 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9579 resets, run finished after 1493 ms. (steps per millisecond=669 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9651 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000000 steps, including 9751 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9427 resets, run finished after 1486 ms. (steps per millisecond=672 ) properties (out of 11) seen :20
Incomplete Best-First random walk after 1000000 steps, including 9551 resets, run finished after 1471 ms. (steps per millisecond=679 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9483 resets, run finished after 1662 ms. (steps per millisecond=601 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 9650 resets, run finished after 1983 ms. (steps per millisecond=504 ) properties (out of 11) seen :22
[2024-05-31 05:22:53] [INFO ] Flow matrix only has 976 transitions (discarded 9 similar events)
// Phase 1: matrix 976 rows 414 cols
[2024-05-31 05:22:53] [INFO ] Computed 62 invariants in 13 ms
[2024-05-31 05:22:53] [INFO ] [Real]Absence check using 45 positive place invariants in 50 ms returned sat
[2024-05-31 05:22:53] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 19 ms returned unsat
[2024-05-31 05:22:53] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-31 05:22:53] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 7 ms returned sat
[2024-05-31 05:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:54] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2024-05-31 05:22:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:22:54] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-31 05:22:54] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 3 ms returned unsat
[2024-05-31 05:22:54] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-31 05:22:54] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned unsat
[2024-05-31 05:22:54] [INFO ] [Real]Absence check using 45 positive place invariants in 20 ms returned sat
[2024-05-31 05:22:54] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 8 ms returned unsat
[2024-05-31 05:22:54] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-31 05:22:54] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 11 ms returned sat
[2024-05-31 05:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:54] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2024-05-31 05:22:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:22:55] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-31 05:22:55] [INFO ] [Nat]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned sat
[2024-05-31 05:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:22:55] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-31 05:22:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:22:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 122 ms returned sat
[2024-05-31 05:22:55] [INFO ] Deduced a trap composed of 155 places in 261 ms of which 1 ms to minimize.
[2024-05-31 05:22:55] [INFO ] Deduced a trap composed of 170 places in 221 ms of which 1 ms to minimize.
[2024-05-31 05:22:56] [INFO ] Deduced a trap composed of 176 places in 239 ms of which 0 ms to minimize.
[2024-05-31 05:22:56] [INFO ] Deduced a trap composed of 167 places in 235 ms of which 1 ms to minimize.
[2024-05-31 05:22:56] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 0 ms to minimize.
[2024-05-31 05:22:56] [INFO ] Deduced a trap composed of 165 places in 192 ms of which 0 ms to minimize.
[2024-05-31 05:22:57] [INFO ] Deduced a trap composed of 165 places in 223 ms of which 0 ms to minimize.
[2024-05-31 05:22:57] [INFO ] Deduced a trap composed of 169 places in 194 ms of which 1 ms to minimize.
[2024-05-31 05:22:57] [INFO ] Deduced a trap composed of 178 places in 232 ms of which 0 ms to minimize.
[2024-05-31 05:22:57] [INFO ] Deduced a trap composed of 170 places in 192 ms of which 1 ms to minimize.
[2024-05-31 05:22:58] [INFO ] Deduced a trap composed of 169 places in 248 ms of which 1 ms to minimize.
[2024-05-31 05:23:01] [INFO ] Deduced a trap composed of 181 places in 307 ms of which 0 ms to minimize.
[2024-05-31 05:23:02] [INFO ] Deduced a trap composed of 167 places in 261 ms of which 1 ms to minimize.
[2024-05-31 05:23:05] [INFO ] Trap strengthening (SAT) tested/added 13/13 trap constraints in 10433 ms
[2024-05-31 05:23:05] [INFO ] [Real]Absence check using 45 positive place invariants in 13 ms returned sat
[2024-05-31 05:23:05] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 13 ms returned unsat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned unsat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned unsat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 7 ms returned unsat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 10 ms returned unsat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-31 05:23:06] [INFO ] [Real]Absence check using 45 positive and 17 generalized place invariants in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 1, 2, 1, 77, 1, 1, 1, 3, 1, 4] Max seen :[4, 1, 2, 1, 3, 1, 1, 1, 3, 1, 4]
FORMULA PolyORBNT-PT-S10J20-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-12 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J20-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 985/985 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 413 transition count 984
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 413 transition count 984
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 411 transition count 982
Applied a total of 6 rules in 162 ms. Remains 411 /414 variables (removed 3) and now considering 982/985 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 411/414 places, 982/985 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 05:23:06] [INFO ] Computed 62 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 70429 resets, run finished after 8753 ms. (steps per millisecond=114 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9584 resets, run finished after 1803 ms. (steps per millisecond=554 ) properties (out of 1) seen :3
[2024-05-31 05:23:17] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 05:23:17] [INFO ] Computed 62 invariants in 9 ms
[2024-05-31 05:23:17] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2024-05-31 05:23:17] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 16 ms returned sat
[2024-05-31 05:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:23:17] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-05-31 05:23:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:23:17] [INFO ] [Nat]Absence check using 44 positive place invariants in 13 ms returned sat
[2024-05-31 05:23:17] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 15 ms returned sat
[2024-05-31 05:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:23:17] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2024-05-31 05:23:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:23:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 198 ms returned sat
[2024-05-31 05:23:18] [INFO ] Deduced a trap composed of 173 places in 252 ms of which 1 ms to minimize.
[2024-05-31 05:23:18] [INFO ] Deduced a trap composed of 163 places in 239 ms of which 1 ms to minimize.
[2024-05-31 05:23:18] [INFO ] Deduced a trap composed of 158 places in 236 ms of which 1 ms to minimize.
[2024-05-31 05:23:19] [INFO ] Deduced a trap composed of 171 places in 246 ms of which 0 ms to minimize.
[2024-05-31 05:23:19] [INFO ] Deduced a trap composed of 167 places in 194 ms of which 1 ms to minimize.
[2024-05-31 05:23:19] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2024-05-31 05:23:19] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 1 ms to minimize.
[2024-05-31 05:23:20] [INFO ] Deduced a trap composed of 168 places in 219 ms of which 1 ms to minimize.
[2024-05-31 05:23:20] [INFO ] Deduced a trap composed of 164 places in 192 ms of which 0 ms to minimize.
[2024-05-31 05:23:20] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 1 ms to minimize.
[2024-05-31 05:23:20] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 0 ms to minimize.
[2024-05-31 05:23:21] [INFO ] Deduced a trap composed of 166 places in 202 ms of which 1 ms to minimize.
[2024-05-31 05:23:21] [INFO ] Deduced a trap composed of 175 places in 197 ms of which 0 ms to minimize.
[2024-05-31 05:23:21] [INFO ] Deduced a trap composed of 168 places in 182 ms of which 3 ms to minimize.
[2024-05-31 05:23:22] [INFO ] Deduced a trap composed of 164 places in 269 ms of which 1 ms to minimize.
[2024-05-31 05:23:22] [INFO ] Deduced a trap composed of 158 places in 204 ms of which 0 ms to minimize.
[2024-05-31 05:23:22] [INFO ] Deduced a trap composed of 160 places in 205 ms of which 0 ms to minimize.
[2024-05-31 05:23:22] [INFO ] Deduced a trap composed of 166 places in 209 ms of which 0 ms to minimize.
[2024-05-31 05:23:23] [INFO ] Deduced a trap composed of 168 places in 200 ms of which 0 ms to minimize.
[2024-05-31 05:23:23] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 0 ms to minimize.
[2024-05-31 05:23:23] [INFO ] Deduced a trap composed of 168 places in 190 ms of which 0 ms to minimize.
[2024-05-31 05:23:23] [INFO ] Deduced a trap composed of 160 places in 207 ms of which 1 ms to minimize.
[2024-05-31 05:23:24] [INFO ] Deduced a trap composed of 171 places in 192 ms of which 0 ms to minimize.
[2024-05-31 05:23:24] [INFO ] Deduced a trap composed of 173 places in 216 ms of which 1 ms to minimize.
[2024-05-31 05:23:24] [INFO ] Deduced a trap composed of 168 places in 206 ms of which 0 ms to minimize.
[2024-05-31 05:23:24] [INFO ] Deduced a trap composed of 166 places in 217 ms of which 0 ms to minimize.
[2024-05-31 05:23:25] [INFO ] Deduced a trap composed of 166 places in 190 ms of which 0 ms to minimize.
[2024-05-31 05:23:25] [INFO ] Deduced a trap composed of 175 places in 217 ms of which 0 ms to minimize.
[2024-05-31 05:23:25] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2024-05-31 05:23:25] [INFO ] Deduced a trap composed of 162 places in 229 ms of which 1 ms to minimize.
[2024-05-31 05:23:26] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 0 ms to minimize.
[2024-05-31 05:23:26] [INFO ] Deduced a trap composed of 170 places in 243 ms of which 0 ms to minimize.
[2024-05-31 05:23:26] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 0 ms to minimize.
[2024-05-31 05:23:27] [INFO ] Deduced a trap composed of 169 places in 246 ms of which 1 ms to minimize.
[2024-05-31 05:23:27] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 0 ms to minimize.
[2024-05-31 05:23:27] [INFO ] Deduced a trap composed of 171 places in 223 ms of which 21 ms to minimize.
[2024-05-31 05:23:28] [INFO ] Deduced a trap composed of 172 places in 223 ms of which 0 ms to minimize.
[2024-05-31 05:23:28] [INFO ] Deduced a trap composed of 164 places in 195 ms of which 0 ms to minimize.
[2024-05-31 05:23:28] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 0 ms to minimize.
[2024-05-31 05:23:28] [INFO ] Deduced a trap composed of 164 places in 221 ms of which 1 ms to minimize.
[2024-05-31 05:23:29] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 0 ms to minimize.
[2024-05-31 05:23:29] [INFO ] Deduced a trap composed of 164 places in 242 ms of which 0 ms to minimize.
[2024-05-31 05:23:29] [INFO ] Deduced a trap composed of 158 places in 188 ms of which 1 ms to minimize.
[2024-05-31 05:23:30] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2024-05-31 05:23:30] [INFO ] Deduced a trap composed of 167 places in 203 ms of which 0 ms to minimize.
[2024-05-31 05:23:30] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 2 ms to minimize.
[2024-05-31 05:23:30] [INFO ] Deduced a trap composed of 173 places in 209 ms of which 19 ms to minimize.
[2024-05-31 05:23:31] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 0 ms to minimize.
[2024-05-31 05:23:31] [INFO ] Deduced a trap composed of 162 places in 220 ms of which 1 ms to minimize.
[2024-05-31 05:23:31] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 1 ms to minimize.
[2024-05-31 05:23:32] [INFO ] Deduced a trap composed of 175 places in 237 ms of which 0 ms to minimize.
[2024-05-31 05:23:32] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 0 ms to minimize.
[2024-05-31 05:23:32] [INFO ] Deduced a trap composed of 177 places in 227 ms of which 1 ms to minimize.
[2024-05-31 05:23:33] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 1 ms to minimize.
[2024-05-31 05:23:33] [INFO ] Deduced a trap composed of 172 places in 226 ms of which 1 ms to minimize.
[2024-05-31 05:23:33] [INFO ] Deduced a trap composed of 177 places in 233 ms of which 0 ms to minimize.
[2024-05-31 05:23:33] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 1 ms to minimize.
[2024-05-31 05:23:34] [INFO ] Deduced a trap composed of 164 places in 213 ms of which 0 ms to minimize.
[2024-05-31 05:23:34] [INFO ] Deduced a trap composed of 164 places in 231 ms of which 0 ms to minimize.
[2024-05-31 05:23:35] [INFO ] Deduced a trap composed of 162 places in 181 ms of which 1 ms to minimize.
[2024-05-31 05:23:35] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 1 ms to minimize.
[2024-05-31 05:23:35] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 14 ms to minimize.
[2024-05-31 05:23:36] [INFO ] Deduced a trap composed of 179 places in 261 ms of which 0 ms to minimize.
[2024-05-31 05:23:36] [INFO ] Deduced a trap composed of 167 places in 262 ms of which 1 ms to minimize.
[2024-05-31 05:23:36] [INFO ] Deduced a trap composed of 171 places in 217 ms of which 1 ms to minimize.
[2024-05-31 05:23:37] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2024-05-31 05:23:37] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2024-05-31 05:23:37] [INFO ] Deduced a trap composed of 162 places in 240 ms of which 0 ms to minimize.
[2024-05-31 05:23:37] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 1 ms to minimize.
[2024-05-31 05:23:38] [INFO ] Deduced a trap composed of 177 places in 207 ms of which 0 ms to minimize.
[2024-05-31 05:23:38] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 0 ms to minimize.
[2024-05-31 05:23:38] [INFO ] Deduced a trap composed of 175 places in 211 ms of which 0 ms to minimize.
[2024-05-31 05:23:39] [INFO ] Deduced a trap composed of 167 places in 191 ms of which 0 ms to minimize.
[2024-05-31 05:23:39] [INFO ] Deduced a trap composed of 171 places in 204 ms of which 0 ms to minimize.
[2024-05-31 05:23:41] [INFO ] Deduced a trap composed of 181 places in 239 ms of which 1 ms to minimize.
[2024-05-31 05:23:41] [INFO ] Deduced a trap composed of 169 places in 231 ms of which 0 ms to minimize.
[2024-05-31 05:23:41] [INFO ] Deduced a trap composed of 169 places in 234 ms of which 0 ms to minimize.
[2024-05-31 05:23:42] [INFO ] Deduced a trap composed of 162 places in 198 ms of which 0 ms to minimize.
[2024-05-31 05:23:43] [INFO ] Deduced a trap composed of 168 places in 252 ms of which 1 ms to minimize.
[2024-05-31 05:23:44] [INFO ] Deduced a trap composed of 173 places in 226 ms of which 1 ms to minimize.
[2024-05-31 05:23:44] [INFO ] Deduced a trap composed of 176 places in 232 ms of which 0 ms to minimize.
[2024-05-31 05:23:44] [INFO ] Deduced a trap composed of 162 places in 236 ms of which 1 ms to minimize.
[2024-05-31 05:23:45] [INFO ] Deduced a trap composed of 162 places in 193 ms of which 1 ms to minimize.
[2024-05-31 05:23:46] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 1 ms to minimize.
[2024-05-31 05:23:46] [INFO ] Deduced a trap composed of 167 places in 199 ms of which 1 ms to minimize.
[2024-05-31 05:23:46] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2024-05-31 05:23:47] [INFO ] Deduced a trap composed of 160 places in 196 ms of which 0 ms to minimize.
[2024-05-31 05:23:48] [INFO ] Deduced a trap composed of 177 places in 233 ms of which 0 ms to minimize.
[2024-05-31 05:23:48] [INFO ] Deduced a trap composed of 177 places in 224 ms of which 1 ms to minimize.
[2024-05-31 05:23:49] [INFO ] Deduced a trap composed of 154 places in 248 ms of which 1 ms to minimize.
[2024-05-31 05:23:49] [INFO ] Deduced a trap composed of 160 places in 254 ms of which 1 ms to minimize.
[2024-05-31 05:23:49] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 0 ms to minimize.
[2024-05-31 05:23:50] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 0 ms to minimize.
[2024-05-31 05:23:51] [INFO ] Deduced a trap composed of 162 places in 219 ms of which 0 ms to minimize.
[2024-05-31 05:23:51] [INFO ] Deduced a trap composed of 162 places in 249 ms of which 1 ms to minimize.
[2024-05-31 05:23:52] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 0 ms to minimize.
[2024-05-31 05:23:52] [INFO ] Deduced a trap composed of 167 places in 206 ms of which 1 ms to minimize.
[2024-05-31 05:23:53] [INFO ] Deduced a trap composed of 167 places in 266 ms of which 1 ms to minimize.
[2024-05-31 05:23:54] [INFO ] Deduced a trap composed of 158 places in 243 ms of which 1 ms to minimize.
[2024-05-31 05:23:54] [INFO ] Deduced a trap composed of 156 places in 224 ms of which 0 ms to minimize.
[2024-05-31 05:23:54] [INFO ] Deduced a trap composed of 162 places in 215 ms of which 0 ms to minimize.
[2024-05-31 05:23:54] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2024-05-31 05:23:55] [INFO ] Deduced a trap composed of 166 places in 237 ms of which 0 ms to minimize.
[2024-05-31 05:23:55] [INFO ] Deduced a trap composed of 183 places in 201 ms of which 1 ms to minimize.
[2024-05-31 05:23:57] [INFO ] Deduced a trap composed of 171 places in 241 ms of which 1 ms to minimize.
[2024-05-31 05:23:57] [INFO ] Deduced a trap composed of 164 places in 255 ms of which 0 ms to minimize.
[2024-05-31 05:23:58] [INFO ] Deduced a trap composed of 164 places in 235 ms of which 0 ms to minimize.
[2024-05-31 05:23:59] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 0 ms to minimize.
[2024-05-31 05:24:00] [INFO ] Deduced a trap composed of 156 places in 210 ms of which 0 ms to minimize.
[2024-05-31 05:24:02] [INFO ] Trap strengthening (SAT) tested/added 109/109 trap constraints in 44494 ms
Current structural bounds on expressions (after SMT) : [77] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 61 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 37 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-31 05:24:02] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 05:24:02] [INFO ] Invariant cache hit.
[2024-05-31 05:24:03] [INFO ] Implicit Places using invariants in 557 ms returned []
[2024-05-31 05:24:03] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 05:24:03] [INFO ] Invariant cache hit.
[2024-05-31 05:24:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:24:06] [INFO ] Implicit Places using invariants and state equation in 2830 ms returned []
Implicit Place search using SMT with State Equation took 3414 ms to find 0 implicit places.
[2024-05-31 05:24:06] [INFO ] Redundant transitions in 56 ms returned []
[2024-05-31 05:24:06] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 05:24:06] [INFO ] Invariant cache hit.
[2024-05-31 05:24:06] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4057 ms. Remains : 411/411 places, 982/982 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-06
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 05:24:06] [INFO ] Computed 62 invariants in 10 ms
Incomplete random walk after 10000 steps, including 700 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :3
[2024-05-31 05:24:06] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 05:24:06] [INFO ] Computed 62 invariants in 16 ms
[2024-05-31 05:24:06] [INFO ] [Real]Absence check using 44 positive place invariants in 8 ms returned sat
[2024-05-31 05:24:06] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 9 ms returned sat
[2024-05-31 05:24:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:24:07] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-31 05:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:24:07] [INFO ] [Nat]Absence check using 44 positive place invariants in 9 ms returned sat
[2024-05-31 05:24:07] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 9 ms returned sat
[2024-05-31 05:24:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:24:07] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-31 05:24:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:24:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 207 ms returned sat
[2024-05-31 05:24:08] [INFO ] Deduced a trap composed of 173 places in 274 ms of which 1 ms to minimize.
[2024-05-31 05:24:08] [INFO ] Deduced a trap composed of 163 places in 229 ms of which 0 ms to minimize.
[2024-05-31 05:24:08] [INFO ] Deduced a trap composed of 158 places in 237 ms of which 1 ms to minimize.
[2024-05-31 05:24:08] [INFO ] Deduced a trap composed of 171 places in 281 ms of which 0 ms to minimize.
[2024-05-31 05:24:09] [INFO ] Deduced a trap composed of 167 places in 220 ms of which 1 ms to minimize.
[2024-05-31 05:24:09] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2024-05-31 05:24:09] [INFO ] Deduced a trap composed of 167 places in 202 ms of which 1 ms to minimize.
[2024-05-31 05:24:10] [INFO ] Deduced a trap composed of 168 places in 244 ms of which 1 ms to minimize.
[2024-05-31 05:24:10] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 1 ms to minimize.
[2024-05-31 05:24:10] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 1 ms to minimize.
[2024-05-31 05:24:10] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 1 ms to minimize.
[2024-05-31 05:24:11] [INFO ] Deduced a trap composed of 166 places in 228 ms of which 0 ms to minimize.
[2024-05-31 05:24:11] [INFO ] Deduced a trap composed of 175 places in 205 ms of which 1 ms to minimize.
[2024-05-31 05:24:11] [INFO ] Deduced a trap composed of 168 places in 209 ms of which 1 ms to minimize.
[2024-05-31 05:24:12] [INFO ] Deduced a trap composed of 164 places in 207 ms of which 1 ms to minimize.
[2024-05-31 05:24:12] [INFO ] Deduced a trap composed of 158 places in 221 ms of which 0 ms to minimize.
[2024-05-31 05:24:12] [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:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:773)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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) : [77] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 22 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-31 05:24:12] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 05:24:12] [INFO ] Invariant cache hit.
[2024-05-31 05:24:12] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 602 ms. Remains : 411/411 places, 982/982 transitions.
Normalized transition count is 973 out of 982 initially.
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 05:24:12] [INFO ] Computed 62 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 70242 resets, run finished after 7291 ms. (steps per millisecond=137 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 9569 resets, run finished after 1927 ms. (steps per millisecond=518 ) properties (out of 1) seen :3
[2024-05-31 05:24:22] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
// Phase 1: matrix 973 rows 411 cols
[2024-05-31 05:24:22] [INFO ] Computed 62 invariants in 11 ms
[2024-05-31 05:24:22] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2024-05-31 05:24:22] [INFO ] [Real]Absence check using 44 positive and 18 generalized place invariants in 13 ms returned sat
[2024-05-31 05:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:24:22] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-31 05:24:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:24:22] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2024-05-31 05:24:22] [INFO ] [Nat]Absence check using 44 positive and 18 generalized place invariants in 13 ms returned sat
[2024-05-31 05:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:24:22] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2024-05-31 05:24:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:24:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 294 ms returned sat
[2024-05-31 05:24:23] [INFO ] Deduced a trap composed of 173 places in 264 ms of which 0 ms to minimize.
[2024-05-31 05:24:23] [INFO ] Deduced a trap composed of 163 places in 247 ms of which 1 ms to minimize.
[2024-05-31 05:24:24] [INFO ] Deduced a trap composed of 158 places in 251 ms of which 1 ms to minimize.
[2024-05-31 05:24:24] [INFO ] Deduced a trap composed of 171 places in 250 ms of which 0 ms to minimize.
[2024-05-31 05:24:24] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 0 ms to minimize.
[2024-05-31 05:24:24] [INFO ] Deduced a trap composed of 168 places in 230 ms of which 1 ms to minimize.
[2024-05-31 05:24:25] [INFO ] Deduced a trap composed of 167 places in 237 ms of which 1 ms to minimize.
[2024-05-31 05:24:25] [INFO ] Deduced a trap composed of 168 places in 252 ms of which 1 ms to minimize.
[2024-05-31 05:24:25] [INFO ] Deduced a trap composed of 164 places in 258 ms of which 0 ms to minimize.
[2024-05-31 05:24:26] [INFO ] Deduced a trap composed of 171 places in 252 ms of which 0 ms to minimize.
[2024-05-31 05:24:26] [INFO ] Deduced a trap composed of 168 places in 232 ms of which 1 ms to minimize.
[2024-05-31 05:24:26] [INFO ] Deduced a trap composed of 166 places in 231 ms of which 1 ms to minimize.
[2024-05-31 05:24:26] [INFO ] Deduced a trap composed of 175 places in 214 ms of which 1 ms to minimize.
[2024-05-31 05:24:27] [INFO ] Deduced a trap composed of 168 places in 212 ms of which 0 ms to minimize.
[2024-05-31 05:24:27] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 0 ms to minimize.
[2024-05-31 05:24:27] [INFO ] Deduced a trap composed of 158 places in 217 ms of which 0 ms to minimize.
[2024-05-31 05:24:28] [INFO ] Deduced a trap composed of 160 places in 222 ms of which 0 ms to minimize.
[2024-05-31 05:24:28] [INFO ] Deduced a trap composed of 166 places in 214 ms of which 1 ms to minimize.
[2024-05-31 05:24:28] [INFO ] Deduced a trap composed of 168 places in 201 ms of which 0 ms to minimize.
[2024-05-31 05:24:28] [INFO ] Deduced a trap composed of 160 places in 206 ms of which 1 ms to minimize.
[2024-05-31 05:24:29] [INFO ] Deduced a trap composed of 168 places in 210 ms of which 1 ms to minimize.
[2024-05-31 05:24:29] [INFO ] Deduced a trap composed of 160 places in 228 ms of which 0 ms to minimize.
[2024-05-31 05:24:29] [INFO ] Deduced a trap composed of 171 places in 202 ms of which 1 ms to minimize.
[2024-05-31 05:24:29] [INFO ] Deduced a trap composed of 173 places in 214 ms of which 0 ms to minimize.
[2024-05-31 05:24:30] [INFO ] Deduced a trap composed of 168 places in 211 ms of which 0 ms to minimize.
[2024-05-31 05:24:30] [INFO ] Deduced a trap composed of 166 places in 204 ms of which 0 ms to minimize.
[2024-05-31 05:24:30] [INFO ] Deduced a trap composed of 166 places in 224 ms of which 0 ms to minimize.
[2024-05-31 05:24:30] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 0 ms to minimize.
[2024-05-31 05:24:31] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2024-05-31 05:24:31] [INFO ] Deduced a trap composed of 162 places in 192 ms of which 1 ms to minimize.
[2024-05-31 05:24:31] [INFO ] Deduced a trap composed of 169 places in 208 ms of which 0 ms to minimize.
[2024-05-31 05:24:32] [INFO ] Deduced a trap composed of 170 places in 196 ms of which 0 ms to minimize.
[2024-05-31 05:24:32] [INFO ] Deduced a trap composed of 171 places in 192 ms of which 1 ms to minimize.
[2024-05-31 05:24:32] [INFO ] Deduced a trap composed of 169 places in 196 ms of which 0 ms to minimize.
[2024-05-31 05:24:32] [INFO ] Deduced a trap composed of 162 places in 251 ms of which 1 ms to minimize.
[2024-05-31 05:24:33] [INFO ] Deduced a trap composed of 171 places in 209 ms of which 0 ms to minimize.
[2024-05-31 05:24:33] [INFO ] Deduced a trap composed of 172 places in 227 ms of which 1 ms to minimize.
[2024-05-31 05:24:33] [INFO ] Deduced a trap composed of 164 places in 200 ms of which 1 ms to minimize.
[2024-05-31 05:24:34] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 0 ms to minimize.
[2024-05-31 05:24:34] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2024-05-31 05:24:34] [INFO ] Deduced a trap composed of 164 places in 210 ms of which 1 ms to minimize.
[2024-05-31 05:24:34] [INFO ] Deduced a trap composed of 164 places in 204 ms of which 0 ms to minimize.
[2024-05-31 05:24:35] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 0 ms to minimize.
[2024-05-31 05:24:35] [INFO ] Deduced a trap composed of 160 places in 250 ms of which 1 ms to minimize.
[2024-05-31 05:24:35] [INFO ] Deduced a trap composed of 167 places in 210 ms of which 0 ms to minimize.
[2024-05-31 05:24:36] [INFO ] Deduced a trap composed of 169 places in 227 ms of which 1 ms to minimize.
[2024-05-31 05:24:36] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 0 ms to minimize.
[2024-05-31 05:24:36] [INFO ] Deduced a trap composed of 167 places in 195 ms of which 0 ms to minimize.
[2024-05-31 05:24:37] [INFO ] Deduced a trap composed of 162 places in 216 ms of which 1 ms to minimize.
[2024-05-31 05:24:37] [INFO ] Deduced a trap composed of 171 places in 305 ms of which 0 ms to minimize.
[2024-05-31 05:24:37] [INFO ] Deduced a trap composed of 175 places in 231 ms of which 0 ms to minimize.
[2024-05-31 05:24:38] [INFO ] Deduced a trap composed of 171 places in 237 ms of which 0 ms to minimize.
[2024-05-31 05:24:38] [INFO ] Deduced a trap composed of 177 places in 219 ms of which 0 ms to minimize.
[2024-05-31 05:24:38] [INFO ] Deduced a trap composed of 164 places in 234 ms of which 0 ms to minimize.
[2024-05-31 05:24:38] [INFO ] Deduced a trap composed of 172 places in 208 ms of which 1 ms to minimize.
[2024-05-31 05:24:39] [INFO ] Deduced a trap composed of 177 places in 229 ms of which 0 ms to minimize.
[2024-05-31 05:24:39] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2024-05-31 05:24:40] [INFO ] Deduced a trap composed of 164 places in 241 ms of which 0 ms to minimize.
[2024-05-31 05:24:40] [INFO ] Deduced a trap composed of 164 places in 225 ms of which 0 ms to minimize.
[2024-05-31 05:24:40] [INFO ] Deduced a trap composed of 162 places in 191 ms of which 0 ms to minimize.
[2024-05-31 05:24:41] [INFO ] Deduced a trap composed of 170 places in 211 ms of which 1 ms to minimize.
[2024-05-31 05:24:41] [INFO ] Deduced a trap composed of 170 places in 253 ms of which 0 ms to minimize.
[2024-05-31 05:24:42] [INFO ] Deduced a trap composed of 179 places in 200 ms of which 0 ms to minimize.
[2024-05-31 05:24:42] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 1 ms to minimize.
[2024-05-31 05:24:42] [INFO ] Deduced a trap composed of 171 places in 231 ms of which 0 ms to minimize.
[2024-05-31 05:24:42] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 0 ms to minimize.
[2024-05-31 05:24:43] [INFO ] Deduced a trap composed of 158 places in 237 ms of which 1 ms to minimize.
[2024-05-31 05:24:43] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2024-05-31 05:24:43] [INFO ] Deduced a trap composed of 164 places in 209 ms of which 1 ms to minimize.
[2024-05-31 05:24:43] [INFO ] Deduced a trap composed of 177 places in 218 ms of which 0 ms to minimize.
[2024-05-31 05:24:44] [INFO ] Deduced a trap composed of 175 places in 256 ms of which 0 ms to minimize.
[2024-05-31 05:24:44] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 0 ms to minimize.
[2024-05-31 05:24:44] [INFO ] Deduced a trap composed of 167 places in 195 ms of which 1 ms to minimize.
[2024-05-31 05:24:45] [INFO ] Deduced a trap composed of 171 places in 243 ms of which 0 ms to minimize.
[2024-05-31 05:24:46] [INFO ] Deduced a trap composed of 181 places in 198 ms of which 1 ms to minimize.
[2024-05-31 05:24:47] [INFO ] Deduced a trap composed of 169 places in 216 ms of which 0 ms to minimize.
[2024-05-31 05:24:47] [INFO ] Deduced a trap composed of 169 places in 223 ms of which 0 ms to minimize.
[2024-05-31 05:24:48] [INFO ] Deduced a trap composed of 162 places in 199 ms of which 1 ms to minimize.
[2024-05-31 05:24:48] [INFO ] Deduced a trap composed of 168 places in 222 ms of which 0 ms to minimize.
[2024-05-31 05:24:49] [INFO ] Deduced a trap composed of 173 places in 202 ms of which 1 ms to minimize.
[2024-05-31 05:24:50] [INFO ] Deduced a trap composed of 176 places in 205 ms of which 0 ms to minimize.
[2024-05-31 05:24:50] [INFO ] Deduced a trap composed of 162 places in 218 ms of which 0 ms to minimize.
[2024-05-31 05:24:51] [INFO ] Deduced a trap composed of 162 places in 205 ms of which 0 ms to minimize.
[2024-05-31 05:24:52] [INFO ] Deduced a trap composed of 160 places in 244 ms of which 1 ms to minimize.
[2024-05-31 05:24:52] [INFO ] Deduced a trap composed of 167 places in 227 ms of which 0 ms to minimize.
[2024-05-31 05:24:52] [INFO ] Deduced a trap composed of 164 places in 220 ms of which 1 ms to minimize.
[2024-05-31 05:24:53] [INFO ] Deduced a trap composed of 160 places in 211 ms of which 1 ms to minimize.
[2024-05-31 05:24:54] [INFO ] Deduced a trap composed of 177 places in 245 ms of which 1 ms to minimize.
[2024-05-31 05:24:54] [INFO ] Deduced a trap composed of 177 places in 239 ms of which 0 ms to minimize.
[2024-05-31 05:24:54] [INFO ] Deduced a trap composed of 154 places in 195 ms of which 0 ms to minimize.
[2024-05-31 05:24:55] [INFO ] Deduced a trap composed of 160 places in 200 ms of which 0 ms to minimize.
[2024-05-31 05:24:55] [INFO ] Deduced a trap composed of 171 places in 192 ms of which 0 ms to minimize.
[2024-05-31 05:24:55] [INFO ] Deduced a trap composed of 162 places in 265 ms of which 0 ms to minimize.
[2024-05-31 05:24:57] [INFO ] Deduced a trap composed of 162 places in 206 ms of which 0 ms to minimize.
[2024-05-31 05:24:57] [INFO ] Deduced a trap composed of 162 places in 203 ms of which 0 ms to minimize.
[2024-05-31 05:24:57] [INFO ] Deduced a trap composed of 168 places in 224 ms of which 0 ms to minimize.
[2024-05-31 05:24:58] [INFO ] Deduced a trap composed of 167 places in 258 ms of which 0 ms to minimize.
[2024-05-31 05:24:58] [INFO ] Deduced a trap composed of 167 places in 257 ms of which 0 ms to minimize.
[2024-05-31 05:24:59] [INFO ] Deduced a trap composed of 158 places in 246 ms of which 0 ms to minimize.
[2024-05-31 05:25:00] [INFO ] Deduced a trap composed of 156 places in 220 ms of which 1 ms to minimize.
[2024-05-31 05:25:00] [INFO ] Deduced a trap composed of 162 places in 227 ms of which 1 ms to minimize.
[2024-05-31 05:25:00] [INFO ] Deduced a trap composed of 160 places in 237 ms of which 0 ms to minimize.
[2024-05-31 05:25:01] [INFO ] Deduced a trap composed of 166 places in 225 ms of which 2 ms to minimize.
[2024-05-31 05:25:01] [INFO ] Deduced a trap composed of 183 places in 203 ms of which 0 ms to minimize.
[2024-05-31 05:25:03] [INFO ] Deduced a trap composed of 171 places in 213 ms of which 0 ms to minimize.
[2024-05-31 05:25:03] [INFO ] Deduced a trap composed of 164 places in 203 ms of which 0 ms to minimize.
[2024-05-31 05:25:04] [INFO ] Deduced a trap composed of 164 places in 187 ms of which 1 ms to minimize.
[2024-05-31 05:25:05] [INFO ] Deduced a trap composed of 168 places in 196 ms of which 0 ms to minimize.
[2024-05-31 05:25:05] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 2 ms to minimize.
[2024-05-31 05:25:07] [INFO ] Trap strengthening (SAT) tested/added 109/109 trap constraints in 44408 ms
Current structural bounds on expressions (after SMT) : [77] Max seen :[3]
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 41 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 411/411 places, 982/982 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 982/982 transitions.
Applied a total of 0 rules in 45 ms. Remains 411 /411 variables (removed 0) and now considering 982/982 (removed 0) transitions.
[2024-05-31 05:25:07] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 05:25:07] [INFO ] Invariant cache hit.
[2024-05-31 05:25:08] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-31 05:25:08] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 05:25:08] [INFO ] Invariant cache hit.
[2024-05-31 05:25:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 05:25:11] [INFO ] Implicit Places using invariants and state equation in 2566 ms returned []
Implicit Place search using SMT with State Equation took 3550 ms to find 0 implicit places.
[2024-05-31 05:25:11] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-31 05:25:11] [INFO ] Flow matrix only has 973 transitions (discarded 9 similar events)
[2024-05-31 05:25:11] [INFO ] Invariant cache hit.
[2024-05-31 05:25:11] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4132 ms. Remains : 411/411 places, 982/982 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J20-UpperBounds-06 in 65089 ms.
[2024-05-31 05:25:12] [INFO ] Flatten gal took : 290 ms
[2024-05-31 05:25:12] [INFO ] Applying decomposition
[2024-05-31 05:25:12] [INFO ] Flatten gal took : 122 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6231838349640469053.txt' '-o' '/tmp/graph6231838349640469053.bin' '-w' '/tmp/graph6231838349640469053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6231838349640469053.bin' '-l' '-1' '-v' '-w' '/tmp/graph6231838349640469053.weights' '-q' '0' '-e' '0.001'
[2024-05-31 05:25:13] [INFO ] Decomposing Gal with order
[2024-05-31 05:25:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 05:25:13] [INFO ] Removed a total of 2740 redundant transitions.
[2024-05-31 05:25:13] [INFO ] Flatten gal took : 347 ms
[2024-05-31 05:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 273 labels/synchronizations in 78 ms.
[2024-05-31 05:25:13] [INFO ] Time to serialize gal into /tmp/UpperBounds4942509161492860502.gal : 25 ms
[2024-05-31 05:25:13] [INFO ] Time to serialize properties into /tmp/UpperBounds8745276371389891967.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4942509161492860502.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8745276371389891967.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds8745276371389891967.prop.
Detected timeout of ITS tools.
[2024-05-31 05:46:37] [INFO ] Flatten gal took : 685 ms
[2024-05-31 05:46:37] [INFO ] Time to serialize gal into /tmp/UpperBounds17493382462545717481.gal : 220 ms
[2024-05-31 05:46:37] [INFO ] Time to serialize properties into /tmp/UpperBounds3132629529974800017.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17493382462545717481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3132629529974800017.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds3132629529974800017.prop.
Detected timeout of ITS tools.
[2024-05-31 06:07:59] [INFO ] Flatten gal took : 936 ms
[2024-05-31 06:08:02] [INFO ] Input system was already deterministic with 982 transitions.
[2024-05-31 06:08:02] [INFO ] Transformed 411 places.
[2024-05-31 06:08:02] [INFO ] Transformed 982 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 06:08:32] [INFO ] Time to serialize gal into /tmp/UpperBounds11766244484789461524.gal : 26 ms
[2024-05-31 06:08:32] [INFO ] Time to serialize properties into /tmp/UpperBounds16558835343884139958.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11766244484789461524.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16558835343884139958.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...351
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16558835343884139958.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 158324 kB
After kill :
MemTotal: 16393356 kB
MemFree: 15819240 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is PolyORBNT-PT-S10J20, 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 r307-tajo-171654460900301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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