MCC'2024- Execution of r307-tajo-171654460900316

About the Execution of 2023-gold for PolyORBNT-PT-S10J60

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16217.308	3600000.00	3654490.00	239824.50	4 ? 1 1 4 1 3 10 1 10 ? 1 ? 1 2 ?	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r307-tajo-171654460900316.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-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r307-tajo-171654460900316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 36K Apr 12 11:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 12 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 180K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 160K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 714K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 401K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.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 14M 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-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 1717135322353

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-S10J60
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 06:02:04] [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 06:02:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 06:02:05] [INFO ] Load time of PNML (sax parser for PT used): 967 ms
[2024-05-31 06:02:05] [INFO ] Transformed 1234 places.
[2024-05-31 06:02:06] [INFO ] Transformed 12920 transitions.
[2024-05-31 06:02:06] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 1321 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 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
[2024-05-31 06:02:06] [INFO ] Computed 152 invariants in 314 ms
FORMULA PolyORBNT-PT-S10J60-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J60-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 560 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 14) seen :3
FORMULA PolyORBNT-PT-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 12) seen :1
[2024-05-31 06:02:07] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-31 06:02:07] [INFO ] Computed 152 invariants in 156 ms
[2024-05-31 06:02:08] [INFO ] [Real]Absence check using 121 positive place invariants in 67 ms returned sat
[2024-05-31 06:02:08] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 102 ms returned sat
[2024-05-31 06:02:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:10] [INFO ] [Real]Absence check using state equation in 1907 ms returned sat
[2024-05-31 06:02:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:02:11] [INFO ] [Nat]Absence check using 121 positive place invariants in 43 ms returned sat
[2024-05-31 06:02:11] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 55 ms returned sat
[2024-05-31 06:02:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:13] [INFO ] [Nat]Absence check using state equation in 2113 ms returned sat
[2024-05-31 06:02:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:02:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 06:02:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 2413 ms returned unknown
[2024-05-31 06:02:15] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-05-31 06:02:16] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 54 ms returned sat
[2024-05-31 06:02:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:17] [INFO ] [Real]Absence check using state equation in 1617 ms returned sat
[2024-05-31 06:02:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:02:18] [INFO ] [Nat]Absence check using 121 positive place invariants in 55 ms returned sat
[2024-05-31 06:02:18] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 62 ms returned sat
[2024-05-31 06:02:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:20] [INFO ] [Nat]Absence check using state equation in 2702 ms returned sat
[2024-05-31 06:02:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1806 ms returned sat
[2024-05-31 06:02:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1002)
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 06:02:23] [INFO ] [Real]Absence check using 121 positive place invariants in 77 ms returned sat
[2024-05-31 06:02:23] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 107 ms returned sat
[2024-05-31 06:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:24] [INFO ] [Real]Absence check using state equation in 989 ms returned sat
[2024-05-31 06:02:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:02:24] [INFO ] [Nat]Absence check using 121 positive place invariants in 47 ms returned sat
[2024-05-31 06:02:24] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 51 ms returned sat
[2024-05-31 06:02:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:29] [INFO ] [Nat]Absence check using state equation in 4768 ms returned unknown
[2024-05-31 06:02:29] [INFO ] [Real]Absence check using 121 positive place invariants in 36 ms returned sat
[2024-05-31 06:02:29] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 52 ms returned sat
[2024-05-31 06:02:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:32] [INFO ] [Real]Absence check using state equation in 2773 ms returned sat
[2024-05-31 06:02:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:02:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 53 ms returned sat
[2024-05-31 06:02:33] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 97 ms returned sat
[2024-05-31 06:02:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:35] [INFO ] [Nat]Absence check using state equation in 1960 ms returned sat
[2024-05-31 06:02:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 06:02:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 2641 ms returned unknown
[2024-05-31 06:02:38] [INFO ] [Real]Absence check using 121 positive place invariants in 39 ms returned sat
[2024-05-31 06:02:38] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 43 ms returned sat
[2024-05-31 06:02:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:39] [INFO ] [Real]Absence check using state equation in 1869 ms returned sat
[2024-05-31 06:02:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:02:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 38 ms returned sat
[2024-05-31 06:02:40] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 60 ms returned sat
[2024-05-31 06:02:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:44] [INFO ] [Nat]Absence check using state equation in 4049 ms returned sat
[2024-05-31 06:02:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 636 ms returned sat
[2024-05-31 06:02:46] [INFO ] Deduced a trap composed of 3 places in 1332 ms of which 5 ms to minimize.
[2024-05-31 06:02:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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: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 06:02:46] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-05-31 06:02:46] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 38 ms returned sat
[2024-05-31 06:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:49] [INFO ] [Real]Absence check using state equation in 2822 ms returned sat
[2024-05-31 06:02:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:02:49] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2024-05-31 06:02:49] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 117 ms returned sat
[2024-05-31 06:02:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:51] [INFO ] [Nat]Absence check using state equation in 1446 ms returned sat
[2024-05-31 06:02:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 2555 ms returned sat
[2024-05-31 06:02:54] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 321 ms.
[2024-05-31 06:02:54] [INFO ] Added : 5 causal constraints over 1 iterations in 532 ms. Result :unknown
[2024-05-31 06:02:54] [INFO ] [Real]Absence check using 121 positive place invariants in 50 ms returned sat
[2024-05-31 06:02:55] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 91 ms returned sat
[2024-05-31 06:02:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:02:56] [INFO ] [Real]Absence check using state equation in 1752 ms returned sat
[2024-05-31 06:02:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:02:57] [INFO ] [Nat]Absence check using 121 positive place invariants in 41 ms returned sat
[2024-05-31 06:02:57] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 57 ms returned sat
[2024-05-31 06:02:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:01] [INFO ] [Nat]Absence check using state equation in 4736 ms returned unknown
[2024-05-31 06:03:02] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-05-31 06:03:02] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 38 ms returned sat
[2024-05-31 06:03:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:03] [INFO ] [Real]Absence check using state equation in 1587 ms returned sat
[2024-05-31 06:03:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:03:04] [INFO ] [Nat]Absence check using 121 positive place invariants in 31 ms returned sat
[2024-05-31 06:03:04] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 41 ms returned sat
[2024-05-31 06:03:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:07] [INFO ] [Nat]Absence check using state equation in 2805 ms returned sat
[2024-05-31 06:03:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1811 ms returned sat
[2024-05-31 06:03:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1002)
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 06:03:09] [INFO ] [Real]Absence check using 121 positive place invariants in 29 ms returned sat
[2024-05-31 06:03:09] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 63 ms returned sat
[2024-05-31 06:03:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:13] [INFO ] [Real]Absence check using state equation in 4262 ms returned sat
[2024-05-31 06:03:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:03:13] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2024-05-31 06:03:13] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 56 ms returned sat
[2024-05-31 06:03:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:18] [INFO ] [Nat]Absence check using state equation in 4745 ms returned unknown
[2024-05-31 06:03:18] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-31 06:03:18] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 39 ms returned unsat
[2024-05-31 06:03:19] [INFO ] [Real]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-05-31 06:03:19] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 52 ms returned sat
[2024-05-31 06:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:21] [INFO ] [Real]Absence check using state equation in 2286 ms returned sat
[2024-05-31 06:03:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:03:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2024-05-31 06:03:21] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 56 ms returned sat
[2024-05-31 06:03:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:23] [INFO ] [Nat]Absence check using state equation in 1318 ms returned sat
[2024-05-31 06:03:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 524 ms returned sat
[2024-05-31 06:03:24] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 270 ms.
[2024-05-31 06:03:27] [INFO ] Deduced a trap composed of 630 places in 987 ms of which 1 ms to minimize.
[2024-05-31 06:03:27] [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 10
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 06:03:27] [INFO ] [Real]Absence check using 121 positive place invariants in 55 ms returned sat
[2024-05-31 06:03:27] [INFO ] [Real]Absence check using 121 positive and 31 generalized place invariants in 37 ms returned sat
[2024-05-31 06:03:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:29] [INFO ] [Real]Absence check using state equation in 1842 ms returned sat
[2024-05-31 06:03:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:03:29] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-31 06:03:30] [INFO ] [Nat]Absence check using 121 positive and 31 generalized place invariants in 38 ms returned sat
[2024-05-31 06:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:03:31] [INFO ] [Nat]Absence check using state equation in 1736 ms returned sat
[2024-05-31 06:03:34] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 06:03:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 3018 ms returned unknown
Current structural bounds on expressions (after SMT) : [201, 10, 70, 201, 4, 3, 10, 10, 523, 1, 2, 4] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 130 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 19 place count 1220 transition count 2805
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 1219 transition count 2805
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 20 place count 1219 transition count 2741
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 148 place count 1155 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 1154 transition count 2740
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 1154 transition count 2740
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 154 place count 1152 transition count 2738
Applied a total of 154 rules in 1051 ms. Remains 1152 /1234 variables (removed 82) and now considering 2738/2810 (removed 72) transitions.
[2024-05-31 06:03:35] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
// Phase 1: matrix 2729 rows 1152 cols
[2024-05-31 06:03:35] [INFO ] Computed 142 invariants in 87 ms
[2024-05-31 06:03:38] [INFO ] Dead Transitions using invariants and state equation in 3013 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 : 1152/1234 places, 2123/2810 transitions.
Applied a total of 0 rules in 70 ms. Remains 1152 /1152 variables (removed 0) and now considering 2123/2123 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4142 ms. Remains : 1152/1234 places, 2123/2810 transitions.
Normalized transition count is 2114 out of 2123 initially.
// Phase 1: matrix 2114 rows 1152 cols
[2024-05-31 06:03:39] [INFO ] Computed 142 invariants in 44 ms
Incomplete random walk after 1000000 steps, including 69698 resets, run finished after 13464 ms. (steps per millisecond=74 ) properties (out of 11) seen :30
FORMULA PolyORBNT-PT-S10J60-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 6025 resets, run finished after 3235 ms. (steps per millisecond=309 ) properties (out of 8) seen :19
Incomplete Best-First random walk after 1000001 steps, including 6225 resets, run finished after 2253 ms. (steps per millisecond=443 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 7115 resets, run finished after 2388 ms. (steps per millisecond=418 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 7095 resets, run finished after 3798 ms. (steps per millisecond=263 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 6295 resets, run finished after 2277 ms. (steps per millisecond=439 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 6061 resets, run finished after 2662 ms. (steps per millisecond=375 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 7263 resets, run finished after 2702 ms. (steps per millisecond=370 ) properties (out of 8) seen :21
Incomplete Best-First random walk after 1000001 steps, including 7111 resets, run finished after 2369 ms. (steps per millisecond=422 ) properties (out of 8) seen :21
[2024-05-31 06:04:14] [INFO ] Flow matrix only has 2114 transitions (discarded 9 similar events)
// Phase 1: matrix 2114 rows 1152 cols
[2024-05-31 06:04:14] [INFO ] Computed 142 invariants in 34 ms
[2024-05-31 06:04:14] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2024-05-31 06:04:14] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 36 ms returned unsat
[2024-05-31 06:04:14] [INFO ] [Real]Absence check using 121 positive place invariants in 27 ms returned sat
[2024-05-31 06:04:14] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 31 ms returned sat
[2024-05-31 06:04:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:04:17] [INFO ] [Real]Absence check using state equation in 2899 ms returned sat
[2024-05-31 06:04:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:04:17] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-05-31 06:04:17] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 31 ms returned sat
[2024-05-31 06:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:04:28] [INFO ] [Nat]Absence check using state equation in 10922 ms returned unknown
[2024-05-31 06:04:28] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2024-05-31 06:04:28] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 9 ms returned unsat
[2024-05-31 06:04:29] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-31 06:04:29] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 42 ms returned unsat
[2024-05-31 06:04:29] [INFO ] [Real]Absence check using 121 positive place invariants in 34 ms returned sat
[2024-05-31 06:04:29] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 39 ms returned unsat
[2024-05-31 06:04:29] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2024-05-31 06:04:29] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 34 ms returned sat
[2024-05-31 06:04:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:04:32] [INFO ] [Real]Absence check using state equation in 2632 ms returned sat
[2024-05-31 06:04:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:04:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2024-05-31 06:04:32] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 38 ms returned sat
[2024-05-31 06:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:04:44] [INFO ] [Nat]Absence check using state equation in 11394 ms returned unknown
[2024-05-31 06:04:44] [INFO ] [Real]Absence check using 121 positive place invariants in 33 ms returned sat
[2024-05-31 06:04:44] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 39 ms returned sat
[2024-05-31 06:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:04:45] [INFO ] [Real]Absence check using state equation in 839 ms returned sat
[2024-05-31 06:04:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:04:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 33 ms returned sat
[2024-05-31 06:04:45] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 35 ms returned sat
[2024-05-31 06:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:04:47] [INFO ] [Nat]Absence check using state equation in 1979 ms returned sat
[2024-05-31 06:04:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:04:50] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 06:04:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 4086 ms returned sat
[2024-05-31 06:04:52] [INFO ] Deduced a trap composed of 504 places in 711 ms of which 2 ms to minimize.
[2024-05-31 06:04:53] [INFO ] Deduced a trap composed of 499 places in 650 ms of which 3 ms to minimize.
[2024-05-31 06:04:53] [INFO ] Deduced a trap composed of 510 places in 693 ms of which 1 ms to minimize.
[2024-05-31 06:04:54] [INFO ] Deduced a trap composed of 493 places in 636 ms of which 1 ms to minimize.
[2024-05-31 06:04:55] [INFO ] Deduced a trap composed of 490 places in 610 ms of which 1 ms to minimize.
[2024-05-31 06:04:55] [INFO ] Deduced a trap composed of 497 places in 680 ms of which 3 ms to minimize.
[2024-05-31 06:04:56] [INFO ] Deduced a trap composed of 497 places in 636 ms of which 2 ms to minimize.
[2024-05-31 06:04:57] [INFO ] Deduced a trap composed of 497 places in 741 ms of which 1 ms to minimize.
[2024-05-31 06:04:58] [INFO ] Deduced a trap composed of 522 places in 628 ms of which 1 ms to minimize.
[2024-05-31 06:04:59] [INFO ] Deduced a trap composed of 491 places in 732 ms of which 1 ms to minimize.
[2024-05-31 06:04:59] [INFO ] Deduced a trap composed of 477 places in 652 ms of which 1 ms to minimize.
[2024-05-31 06:05:01] [INFO ] Deduced a trap composed of 514 places in 669 ms of which 2 ms to minimize.
[2024-05-31 06:05:01] [INFO ] Deduced a trap composed of 495 places in 606 ms of which 1 ms to minimize.
[2024-05-31 06:05:02] [INFO ] Deduced a trap composed of 502 places in 707 ms of which 1 ms to minimize.
[2024-05-31 06:05:03] [INFO ] Deduced a trap composed of 493 places in 775 ms of which 1 ms to minimize.
[2024-05-31 06:05:04] [INFO ] Deduced a trap composed of 502 places in 606 ms of which 1 ms to minimize.
[2024-05-31 06:05:05] [INFO ] Deduced a trap composed of 514 places in 638 ms of which 1 ms to minimize.
[2024-05-31 06:05:06] [INFO ] Deduced a trap composed of 514 places in 806 ms of which 1 ms to minimize.
[2024-05-31 06:05:07] [INFO ] Deduced a trap composed of 504 places in 737 ms of which 1 ms to minimize.
[2024-05-31 06:05:10] [INFO ] Deduced a trap composed of 495 places in 689 ms of which 2 ms to minimize.
[2024-05-31 06:05:11] [INFO ] Deduced a trap composed of 495 places in 695 ms of which 1 ms to minimize.
[2024-05-31 06:05:12] [INFO ] Deduced a trap composed of 507 places in 759 ms of which 1 ms to minimize.
[2024-05-31 06:05:13] [INFO ] Deduced a trap composed of 497 places in 748 ms of which 2 ms to minimize.
[2024-05-31 06:05:14] [INFO ] Deduced a trap composed of 501 places in 747 ms of which 2 ms to minimize.
[2024-05-31 06:05:15] [INFO ] Deduced a trap composed of 499 places in 755 ms of which 1 ms to minimize.
[2024-05-31 06:05:16] [INFO ] Deduced a trap composed of 499 places in 743 ms of which 1 ms to minimize.
[2024-05-31 06:05:17] [INFO ] Deduced a trap composed of 491 places in 765 ms of which 1 ms to minimize.
[2024-05-31 06:05:18] [INFO ] Deduced a trap composed of 497 places in 758 ms of which 2 ms to minimize.
[2024-05-31 06:05:18] [INFO ] Deduced a trap composed of 511 places in 664 ms of which 1 ms to minimize.
[2024-05-31 06:05:19] [INFO ] Deduced a trap composed of 497 places in 625 ms of which 1 ms to minimize.
[2024-05-31 06:05:21] [INFO ] Deduced a trap composed of 499 places in 761 ms of which 1 ms to minimize.
[2024-05-31 06:05:22] [INFO ] Deduced a trap composed of 491 places in 722 ms of which 2 ms to minimize.
[2024-05-31 06:05:23] [INFO ] Deduced a trap composed of 512 places in 731 ms of which 5 ms to minimize.
[2024-05-31 06:05:27] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 35681 ms
[2024-05-31 06:05:27] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-31 06:05:27] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 39 ms returned sat
[2024-05-31 06:05:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:05:28] [INFO ] [Real]Absence check using state equation in 807 ms returned sat
[2024-05-31 06:05:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:05:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 28 ms returned sat
[2024-05-31 06:05:28] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 30 ms returned sat
[2024-05-31 06:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:05:29] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2024-05-31 06:05:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1878 ms returned sat
[2024-05-31 06:05:31] [INFO ] Deduced a trap composed of 512 places in 602 ms of which 1 ms to minimize.
[2024-05-31 06:05:32] [INFO ] Deduced a trap composed of 507 places in 692 ms of which 1 ms to minimize.
[2024-05-31 06:05:33] [INFO ] Deduced a trap composed of 527 places in 673 ms of which 13 ms to minimize.
[2024-05-31 06:05:34] [INFO ] Deduced a trap composed of 516 places in 693 ms of which 1 ms to minimize.
[2024-05-31 06:05:34] [INFO ] Deduced a trap composed of 513 places in 588 ms of which 0 ms to minimize.
[2024-05-31 06:05:35] [INFO ] Deduced a trap composed of 511 places in 567 ms of which 1 ms to minimize.
[2024-05-31 06:05:35] [INFO ] Deduced a trap composed of 508 places in 610 ms of which 1 ms to minimize.
[2024-05-31 06:05:36] [INFO ] Deduced a trap composed of 505 places in 518 ms of which 1 ms to minimize.
[2024-05-31 06:05:37] [INFO ] Deduced a trap composed of 517 places in 558 ms of which 1 ms to minimize.
[2024-05-31 06:05:38] [INFO ] Deduced a trap composed of 524 places in 649 ms of which 2 ms to minimize.
[2024-05-31 06:05:39] [INFO ] Deduced a trap composed of 517 places in 635 ms of which 1 ms to minimize.
[2024-05-31 06:05:39] [INFO ] Deduced a trap composed of 495 places in 559 ms of which 1 ms to minimize.
[2024-05-31 06:05:40] [INFO ] Deduced a trap composed of 503 places in 535 ms of which 1 ms to minimize.
[2024-05-31 06:05:41] [INFO ] Deduced a trap composed of 513 places in 524 ms of which 1 ms to minimize.
[2024-05-31 06:05:41] [INFO ] Deduced a trap composed of 491 places in 528 ms of which 1 ms to minimize.
[2024-05-31 06:05:42] [INFO ] Deduced a trap composed of 496 places in 543 ms of which 2 ms to minimize.
[2024-05-31 06:05:42] [INFO ] Deduced a trap composed of 495 places in 545 ms of which 1 ms to minimize.
[2024-05-31 06:05:43] [INFO ] Deduced a trap composed of 505 places in 554 ms of which 1 ms to minimize.
[2024-05-31 06:05:44] [INFO ] Deduced a trap composed of 499 places in 613 ms of which 1 ms to minimize.
[2024-05-31 06:05:44] [INFO ] Deduced a trap composed of 501 places in 544 ms of which 1 ms to minimize.
[2024-05-31 06:05:46] [INFO ] Deduced a trap composed of 497 places in 664 ms of which 1 ms to minimize.
[2024-05-31 06:05:46] [INFO ] Deduced a trap composed of 523 places in 607 ms of which 23 ms to minimize.
[2024-05-31 06:05:47] [INFO ] Deduced a trap composed of 507 places in 692 ms of which 2 ms to minimize.
[2024-05-31 06:05:48] [INFO ] Deduced a trap composed of 511 places in 669 ms of which 1 ms to minimize.
[2024-05-31 06:05:49] [INFO ] Deduced a trap composed of 492 places in 665 ms of which 1 ms to minimize.
[2024-05-31 06:05:50] [INFO ] Deduced a trap composed of 515 places in 573 ms of which 1 ms to minimize.
[2024-05-31 06:05:50] [INFO ] Deduced a trap composed of 503 places in 540 ms of which 1 ms to minimize.
[2024-05-31 06:05:51] [INFO ] Deduced a trap composed of 503 places in 604 ms of which 1 ms to minimize.
[2024-05-31 06:05:52] [INFO ] Deduced a trap composed of 510 places in 548 ms of which 1 ms to minimize.
[2024-05-31 06:05:53] [INFO ] Deduced a trap composed of 501 places in 546 ms of which 2 ms to minimize.
[2024-05-31 06:05:53] [INFO ] Deduced a trap composed of 527 places in 568 ms of which 1 ms to minimize.
[2024-05-31 06:05:54] [INFO ] Deduced a trap composed of 519 places in 675 ms of which 2 ms to minimize.
[2024-05-31 06:05:55] [INFO ] Deduced a trap composed of 519 places in 689 ms of which 3 ms to minimize.
[2024-05-31 06:05:56] [INFO ] Deduced a trap composed of 495 places in 630 ms of which 1 ms to minimize.
[2024-05-31 06:05:57] [INFO ] Deduced a trap composed of 513 places in 613 ms of which 1 ms to minimize.
[2024-05-31 06:05:58] [INFO ] Deduced a trap composed of 537 places in 562 ms of which 1 ms to minimize.
[2024-05-31 06:06:00] [INFO ] Deduced a trap composed of 550 places in 612 ms of which 1 ms to minimize.
[2024-05-31 06:06:01] [INFO ] Deduced a trap composed of 520 places in 688 ms of which 1 ms to minimize.
[2024-05-31 06:06:01] [INFO ] Deduced a trap composed of 502 places in 678 ms of which 5 ms to minimize.
[2024-05-31 06:06:02] [INFO ] Deduced a trap composed of 513 places in 560 ms of which 1 ms to minimize.
[2024-05-31 06:06:03] [INFO ] Deduced a trap composed of 521 places in 529 ms of which 1 ms to minimize.
[2024-05-31 06:06:03] [INFO ] Deduced a trap composed of 515 places in 593 ms of which 1 ms to minimize.
[2024-05-31 06:06:04] [INFO ] Deduced a trap composed of 529 places in 589 ms of which 1 ms to minimize.
[2024-05-31 06:06:05] [INFO ] Deduced a trap composed of 510 places in 565 ms of which 1 ms to minimize.
[2024-05-31 06:06:06] [INFO ] Deduced a trap composed of 526 places in 683 ms of which 3 ms to minimize.
[2024-05-31 06:06:07] [INFO ] Deduced a trap composed of 534 places in 688 ms of which 1 ms to minimize.
[2024-05-31 06:06:07] [INFO ] Deduced a trap composed of 531 places in 555 ms of which 1 ms to minimize.
[2024-05-31 06:06:08] [INFO ] Deduced a trap composed of 512 places in 565 ms of which 1 ms to minimize.
[2024-05-31 06:06:08] [INFO ] Deduced a trap composed of 518 places in 577 ms of which 1 ms to minimize.
[2024-05-31 06:06:09] [INFO ] Deduced a trap composed of 516 places in 615 ms of which 1 ms to minimize.
[2024-05-31 06:06:10] [INFO ] Deduced a trap composed of 515 places in 610 ms of which 1 ms to minimize.
[2024-05-31 06:06:11] [INFO ] Deduced a trap composed of 515 places in 589 ms of which 1 ms to minimize.
[2024-05-31 06:06:11] [INFO ] Deduced a trap composed of 505 places in 545 ms of which 1 ms to minimize.
[2024-05-31 06:06:12] [INFO ] Deduced a trap composed of 542 places in 567 ms of which 1 ms to minimize.
[2024-05-31 06:06:13] [INFO ] Deduced a trap composed of 520 places in 570 ms of which 1 ms to minimize.
[2024-05-31 06:06:13] [INFO ] Trap strengthening (SAT) tested/added 55/55 trap constraints in 42379 ms
Current structural bounds on expressions (after SMT) : [4, 10, 1, 1, 1, 10, 523, 4] Max seen :[4, 4, 1, 1, 1, 4, 3, 3]
FORMULA PolyORBNT-PT-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-PT-S10J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2123/2123 transitions.
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 61 Pre rules applied. Total rules applied 0 place count 1152 transition count 2062
Deduced a syphon composed of 61 places in 6 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 1091 transition count 2062
Applied a total of 122 rules in 152 ms. Remains 1091 /1152 variables (removed 61) and now considering 2062/2123 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 1091/1152 places, 2062/2123 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:06:13] [INFO ] Computed 142 invariants in 40 ms
Incomplete random walk after 1000000 steps, including 70635 resets, run finished after 12408 ms. (steps per millisecond=80 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 1000001 steps, including 6096 resets, run finished after 1990 ms. (steps per millisecond=502 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 1000001 steps, including 5944 resets, run finished after 2334 ms. (steps per millisecond=428 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 1000001 steps, including 7088 resets, run finished after 2269 ms. (steps per millisecond=440 ) properties (out of 4) seen :14
Incomplete Best-First random walk after 1000001 steps, including 7313 resets, run finished after 2251 ms. (steps per millisecond=444 ) properties (out of 4) seen :14
[2024-05-31 06:06:34] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:06:34] [INFO ] Computed 142 invariants in 64 ms
[2024-05-31 06:06:35] [INFO ] [Real]Absence check using 122 positive place invariants in 26 ms returned sat
[2024-05-31 06:06:35] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 26 ms returned sat
[2024-05-31 06:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:06:38] [INFO ] [Real]Absence check using state equation in 3579 ms returned sat
[2024-05-31 06:06:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:06:38] [INFO ] [Nat]Absence check using 122 positive place invariants in 34 ms returned sat
[2024-05-31 06:06:39] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 29 ms returned sat
[2024-05-31 06:06:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:06:48] [INFO ] [Nat]Absence check using state equation in 9380 ms returned unknown
[2024-05-31 06:06:48] [INFO ] [Real]Absence check using 122 positive place invariants in 32 ms returned sat
[2024-05-31 06:06:48] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 30 ms returned sat
[2024-05-31 06:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:06:52] [INFO ] [Real]Absence check using state equation in 3550 ms returned sat
[2024-05-31 06:06:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:06:52] [INFO ] [Nat]Absence check using 122 positive place invariants in 28 ms returned sat
[2024-05-31 06:06:52] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 24 ms returned sat
[2024-05-31 06:06:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:07:01] [INFO ] [Nat]Absence check using state equation in 9173 ms returned unknown
[2024-05-31 06:07:01] [INFO ] [Real]Absence check using 122 positive place invariants in 27 ms returned sat
[2024-05-31 06:07:01] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2024-05-31 06:07:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:07:02] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2024-05-31 06:07:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:07:02] [INFO ] [Nat]Absence check using 122 positive place invariants in 27 ms returned sat
[2024-05-31 06:07:02] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 23 ms returned sat
[2024-05-31 06:07:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:07:04] [INFO ] [Nat]Absence check using state equation in 2097 ms returned sat
[2024-05-31 06:07:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:07:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 2554 ms returned sat
[2024-05-31 06:07:08] [INFO ] Deduced a trap composed of 458 places in 712 ms of which 1 ms to minimize.
[2024-05-31 06:07:08] [INFO ] Deduced a trap composed of 446 places in 497 ms of which 0 ms to minimize.
[2024-05-31 06:07:09] [INFO ] Deduced a trap composed of 442 places in 478 ms of which 1 ms to minimize.
[2024-05-31 06:07:09] [INFO ] Deduced a trap composed of 438 places in 642 ms of which 2 ms to minimize.
[2024-05-31 06:07:10] [INFO ] Deduced a trap composed of 464 places in 621 ms of which 1 ms to minimize.
[2024-05-31 06:07:11] [INFO ] Deduced a trap composed of 458 places in 696 ms of which 2 ms to minimize.
[2024-05-31 06:07:12] [INFO ] Deduced a trap composed of 436 places in 652 ms of which 1 ms to minimize.
[2024-05-31 06:07:12] [INFO ] Deduced a trap composed of 465 places in 661 ms of which 1 ms to minimize.
[2024-05-31 06:07:13] [INFO ] Deduced a trap composed of 438 places in 656 ms of which 1 ms to minimize.
[2024-05-31 06:07:14] [INFO ] Deduced a trap composed of 446 places in 641 ms of which 1 ms to minimize.
[2024-05-31 06:07:15] [INFO ] Deduced a trap composed of 442 places in 656 ms of which 1 ms to minimize.
[2024-05-31 06:07:15] [INFO ] Deduced a trap composed of 452 places in 655 ms of which 1 ms to minimize.
[2024-05-31 06:07:17] [INFO ] Deduced a trap composed of 459 places in 693 ms of which 1 ms to minimize.
[2024-05-31 06:07:19] [INFO ] Deduced a trap composed of 447 places in 639 ms of which 1 ms to minimize.
[2024-05-31 06:07:20] [INFO ] Deduced a trap composed of 460 places in 677 ms of which 1 ms to minimize.
[2024-05-31 06:07:21] [INFO ] Deduced a trap composed of 443 places in 673 ms of which 1 ms to minimize.
[2024-05-31 06:07:22] [INFO ] Deduced a trap composed of 457 places in 515 ms of which 1 ms to minimize.
[2024-05-31 06:07:22] [INFO ] Deduced a trap composed of 447 places in 608 ms of which 1 ms to minimize.
[2024-05-31 06:07:23] [INFO ] Deduced a trap composed of 463 places in 534 ms of which 1 ms to minimize.
[2024-05-31 06:07:24] [INFO ] Deduced a trap composed of 464 places in 582 ms of which 1 ms to minimize.
[2024-05-31 06:07:24] [INFO ] Deduced a trap composed of 439 places in 501 ms of which 1 ms to minimize.
[2024-05-31 06:07:25] [INFO ] Deduced a trap composed of 449 places in 510 ms of which 1 ms to minimize.
[2024-05-31 06:07:26] [INFO ] Deduced a trap composed of 436 places in 548 ms of which 1 ms to minimize.
[2024-05-31 06:07:26] [INFO ] Deduced a trap composed of 443 places in 527 ms of which 1 ms to minimize.
[2024-05-31 06:07:27] [INFO ] Deduced a trap composed of 444 places in 622 ms of which 1 ms to minimize.
[2024-05-31 06:07:28] [INFO ] Deduced a trap composed of 436 places in 557 ms of which 1 ms to minimize.
[2024-05-31 06:07:29] [INFO ] Deduced a trap composed of 471 places in 591 ms of which 1 ms to minimize.
[2024-05-31 06:07:30] [INFO ] Deduced a trap composed of 466 places in 651 ms of which 1 ms to minimize.
[2024-05-31 06:07:31] [INFO ] Deduced a trap composed of 438 places in 651 ms of which 1 ms to minimize.
[2024-05-31 06:07:32] [INFO ] Deduced a trap composed of 453 places in 550 ms of which 1 ms to minimize.
[2024-05-31 06:07:32] [INFO ] Deduced a trap composed of 448 places in 589 ms of which 1 ms to minimize.
[2024-05-31 06:07:33] [INFO ] Deduced a trap composed of 442 places in 533 ms of which 1 ms to minimize.
[2024-05-31 06:07:33] [INFO ] Deduced a trap composed of 461 places in 548 ms of which 1 ms to minimize.
[2024-05-31 06:07:34] [INFO ] Deduced a trap composed of 432 places in 650 ms of which 1 ms to minimize.
[2024-05-31 06:07:35] [INFO ] Deduced a trap composed of 473 places in 686 ms of which 1 ms to minimize.
[2024-05-31 06:07:36] [INFO ] Deduced a trap composed of 450 places in 651 ms of which 1 ms to minimize.
[2024-05-31 06:07:37] [INFO ] Deduced a trap composed of 474 places in 663 ms of which 2 ms to minimize.
[2024-05-31 06:07:38] [INFO ] Deduced a trap composed of 448 places in 605 ms of which 1 ms to minimize.
[2024-05-31 06:07:38] [INFO ] Deduced a trap composed of 469 places in 635 ms of which 1 ms to minimize.
[2024-05-31 06:07:39] [INFO ] Deduced a trap composed of 452 places in 674 ms of which 3 ms to minimize.
[2024-05-31 06:07:40] [INFO ] Deduced a trap composed of 443 places in 669 ms of which 1 ms to minimize.
[2024-05-31 06:07:43] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 36254 ms
[2024-05-31 06:07:43] [INFO ] [Real]Absence check using 122 positive place invariants in 31 ms returned sat
[2024-05-31 06:07:43] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 32 ms returned sat
[2024-05-31 06:07:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:07:45] [INFO ] [Real]Absence check using state equation in 2013 ms returned sat
[2024-05-31 06:07:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:07:46] [INFO ] [Nat]Absence check using 122 positive place invariants in 34 ms returned sat
[2024-05-31 06:07:46] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 32 ms returned sat
[2024-05-31 06:07:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:07:46] [INFO ] [Nat]Absence check using state equation in 645 ms returned sat
[2024-05-31 06:07:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 2744 ms returned sat
[2024-05-31 06:07:50] [INFO ] Deduced a trap composed of 444 places in 682 ms of which 1 ms to minimize.
[2024-05-31 06:07:50] [INFO ] Deduced a trap composed of 462 places in 597 ms of which 1 ms to minimize.
[2024-05-31 06:07:51] [INFO ] Deduced a trap composed of 474 places in 608 ms of which 1 ms to minimize.
[2024-05-31 06:07:52] [INFO ] Deduced a trap composed of 462 places in 542 ms of which 1 ms to minimize.
[2024-05-31 06:07:52] [INFO ] Deduced a trap composed of 448 places in 567 ms of which 1 ms to minimize.
[2024-05-31 06:07:53] [INFO ] Deduced a trap composed of 448 places in 553 ms of which 1 ms to minimize.
[2024-05-31 06:07:54] [INFO ] Deduced a trap composed of 436 places in 538 ms of which 1 ms to minimize.
[2024-05-31 06:07:54] [INFO ] Deduced a trap composed of 452 places in 582 ms of which 1 ms to minimize.
[2024-05-31 06:07:55] [INFO ] Deduced a trap composed of 456 places in 535 ms of which 1 ms to minimize.
[2024-05-31 06:07:56] [INFO ] Deduced a trap composed of 462 places in 535 ms of which 1 ms to minimize.
[2024-05-31 06:07:56] [INFO ] Deduced a trap composed of 448 places in 557 ms of which 1 ms to minimize.
[2024-05-31 06:07:57] [INFO ] Deduced a trap composed of 432 places in 533 ms of which 2 ms to minimize.
[2024-05-31 06:07:57] [INFO ] Deduced a trap composed of 448 places in 567 ms of which 1 ms to minimize.
[2024-05-31 06:07:58] [INFO ] Deduced a trap composed of 474 places in 668 ms of which 2 ms to minimize.
[2024-05-31 06:08:01] [INFO ] Trap strengthening (SAT) tested/added 14/14 trap constraints in 12334 ms
Current structural bounds on expressions (after SMT) : [10, 10, 136, 4] Max seen :[4, 4, 3, 3]
Support contains 3 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 60 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 60 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 58 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2024-05-31 06:08:01] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 06:08:01] [INFO ] Invariant cache hit.
[2024-05-31 06:08:03] [INFO ] Implicit Places using invariants in 1957 ms returned []
[2024-05-31 06:08:03] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 06:08:03] [INFO ] Invariant cache hit.
[2024-05-31 06:08:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:08:31] [INFO ] Implicit Places using invariants and state equation in 27787 ms returned []
Implicit Place search using SMT with State Equation took 29747 ms to find 0 implicit places.
[2024-05-31 06:08:31] [INFO ] Redundant transitions in 189 ms returned []
[2024-05-31 06:08:31] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 06:08:31] [INFO ] Invariant cache hit.
[2024-05-31 06:08:33] [INFO ] Dead Transitions using invariants and state equation in 1620 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31625 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-01
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:08:33] [INFO ] Computed 142 invariants in 62 ms
Incomplete random walk after 10000 steps, including 723 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :4
[2024-05-31 06:08:33] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:08:33] [INFO ] Computed 142 invariants in 48 ms
[2024-05-31 06:08:33] [INFO ] [Real]Absence check using 122 positive place invariants in 32 ms returned sat
[2024-05-31 06:08:33] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 32 ms returned sat
[2024-05-31 06:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:08:37] [INFO ] [Real]Absence check using state equation in 3596 ms returned sat
[2024-05-31 06:08:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:08:37] [INFO ] [Nat]Absence check using 122 positive place invariants in 28 ms returned sat
[2024-05-31 06:08:37] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 25 ms returned sat
[2024-05-31 06:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:08:42] [INFO ] [Nat]Absence check using state equation in 4808 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2061
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2061
Applied a total of 2 rules in 124 ms. Remains 1090 /1091 variables (removed 1) and now considering 2061/2062 (removed 1) transitions.
[2024-05-31 06:08:42] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 06:08:42] [INFO ] Computed 142 invariants in 74 ms
[2024-05-31 06:08:44] [INFO ] Dead Transitions using invariants and state equation in 1816 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1942 ms. Remains : 1090/1091 places, 2061/2062 transitions.
Normalized transition count is 2052 out of 2061 initially.
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 06:08:44] [INFO ] Computed 142 invariants in 55 ms
Incomplete random walk after 1000000 steps, including 72554 resets, run finished after 11249 ms. (steps per millisecond=88 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 5948 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 1) seen :4
[2024-05-31 06:08:57] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 06:08:57] [INFO ] Computed 142 invariants in 73 ms
[2024-05-31 06:08:58] [INFO ] [Real]Absence check using 121 positive place invariants in 30 ms returned sat
[2024-05-31 06:08:58] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 32 ms returned sat
[2024-05-31 06:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:08:58] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2024-05-31 06:08:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:08:59] [INFO ] [Nat]Absence check using 121 positive place invariants in 27 ms returned sat
[2024-05-31 06:08:59] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 32 ms returned sat
[2024-05-31 06:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:09:05] [INFO ] [Nat]Absence check using state equation in 6675 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 150 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 97 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2024-05-31 06:09:06] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 06:09:06] [INFO ] Invariant cache hit.
[2024-05-31 06:09:07] [INFO ] Implicit Places using invariants in 1889 ms returned []
[2024-05-31 06:09:07] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 06:09:07] [INFO ] Invariant cache hit.
[2024-05-31 06:09:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:09:24] [INFO ] Implicit Places using invariants and state equation in 16666 ms returned []
Implicit Place search using SMT with State Equation took 18560 ms to find 0 implicit places.
[2024-05-31 06:09:24] [INFO ] Redundant transitions in 80 ms returned []
[2024-05-31 06:09:24] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 06:09:24] [INFO ] Invariant cache hit.
[2024-05-31 06:09:26] [INFO ] Dead Transitions using invariants and state equation in 1722 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20499 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-01 in 52943 ms.
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-10
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:09:26] [INFO ] Computed 142 invariants in 65 ms
Incomplete random walk after 10000 steps, including 717 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :4
[2024-05-31 06:09:26] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:09:26] [INFO ] Computed 142 invariants in 43 ms
[2024-05-31 06:09:26] [INFO ] [Real]Absence check using 122 positive place invariants in 35 ms returned sat
[2024-05-31 06:09:27] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 34 ms returned sat
[2024-05-31 06:09:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:09:31] [INFO ] [Real]Absence check using state equation in 4087 ms returned sat
[2024-05-31 06:09:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:09:31] [INFO ] [Nat]Absence check using 122 positive place invariants in 41 ms returned sat
[2024-05-31 06:09:31] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 32 ms returned sat
[2024-05-31 06:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:09:36] [INFO ] [Nat]Absence check using state equation in 4789 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2062/2062 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2061
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2061
Applied a total of 2 rules in 141 ms. Remains 1090 /1091 variables (removed 1) and now considering 2061/2062 (removed 1) transitions.
[2024-05-31 06:09:36] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 06:09:36] [INFO ] Computed 142 invariants in 33 ms
[2024-05-31 06:09:38] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1902 ms. Remains : 1090/1091 places, 2061/2062 transitions.
Normalized transition count is 2052 out of 2061 initially.
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 06:09:38] [INFO ] Computed 142 invariants in 34 ms
Incomplete random walk after 1000000 steps, including 72606 resets, run finished after 11005 ms. (steps per millisecond=90 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 6081 resets, run finished after 2073 ms. (steps per millisecond=482 ) properties (out of 1) seen :4
[2024-05-31 06:09:51] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 06:09:51] [INFO ] Computed 142 invariants in 59 ms
[2024-05-31 06:09:51] [INFO ] [Real]Absence check using 121 positive place invariants in 28 ms returned sat
[2024-05-31 06:09:51] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 33 ms returned sat
[2024-05-31 06:09:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:09:52] [INFO ] [Real]Absence check using state equation in 764 ms returned sat
[2024-05-31 06:09:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:09:52] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-31 06:09:52] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 46 ms returned sat
[2024-05-31 06:09:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:09:59] [INFO ] [Nat]Absence check using state equation in 6717 ms returned unknown
Current structural bounds on expressions (after SMT) : [10] Max seen :[4]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 96 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 69 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2024-05-31 06:09:59] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 06:09:59] [INFO ] Invariant cache hit.
[2024-05-31 06:10:01] [INFO ] Implicit Places using invariants in 1790 ms returned []
[2024-05-31 06:10:01] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 06:10:01] [INFO ] Invariant cache hit.
[2024-05-31 06:10:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:10:18] [INFO ] Implicit Places using invariants and state equation in 16825 ms returned []
Implicit Place search using SMT with State Equation took 18617 ms to find 0 implicit places.
[2024-05-31 06:10:18] [INFO ] Redundant transitions in 143 ms returned []
[2024-05-31 06:10:18] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 06:10:18] [INFO ] Invariant cache hit.
[2024-05-31 06:10:22] [INFO ] Dead Transitions using invariants and state equation in 4527 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23411 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-10 in 56318 ms.
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-12
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:10:22] [INFO ] Computed 142 invariants in 36 ms
Incomplete random walk after 10000 steps, including 666 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :3
[2024-05-31 06:10:22] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:10:23] [INFO ] Computed 142 invariants in 76 ms
[2024-05-31 06:10:23] [INFO ] [Real]Absence check using 122 positive place invariants in 53 ms returned sat
[2024-05-31 06:10:23] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 45 ms returned sat
[2024-05-31 06:10:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:10:24] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2024-05-31 06:10:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:10:24] [INFO ] [Nat]Absence check using 122 positive place invariants in 36 ms returned sat
[2024-05-31 06:10:24] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 44 ms returned sat
[2024-05-31 06:10:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:10:26] [INFO ] [Nat]Absence check using state equation in 2221 ms returned sat
[2024-05-31 06:10:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:10:29] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 06:10:29] [INFO ] [Nat]Added 1 Read/Feed constraints in 2533 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 100 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2024-05-31 06:10:29] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 06:10:29] [INFO ] Invariant cache hit.
[2024-05-31 06:10:30] [INFO ] Dead Transitions using invariants and state equation in 1650 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1765 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:10:31] [INFO ] Computed 142 invariants in 34 ms
Incomplete random walk after 1000000 steps, including 70409 resets, run finished after 10269 ms. (steps per millisecond=97 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7354 resets, run finished after 2003 ms. (steps per millisecond=499 ) properties (out of 1) seen :3
[2024-05-31 06:10:43] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:10:43] [INFO ] Computed 142 invariants in 40 ms
[2024-05-31 06:10:43] [INFO ] [Real]Absence check using 122 positive place invariants in 32 ms returned sat
[2024-05-31 06:10:43] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 28 ms returned sat
[2024-05-31 06:10:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:10:44] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2024-05-31 06:10:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:10:44] [INFO ] [Nat]Absence check using 122 positive place invariants in 27 ms returned sat
[2024-05-31 06:10:44] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 24 ms returned sat
[2024-05-31 06:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:10:46] [INFO ] [Nat]Absence check using state equation in 2319 ms returned sat
[2024-05-31 06:10:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:10:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 2764 ms returned sat
[2024-05-31 06:10:50] [INFO ] Deduced a trap composed of 458 places in 563 ms of which 1 ms to minimize.
[2024-05-31 06:10:50] [INFO ] Deduced a trap composed of 446 places in 522 ms of which 0 ms to minimize.
[2024-05-31 06:10:51] [INFO ] Deduced a trap composed of 442 places in 592 ms of which 1 ms to minimize.
[2024-05-31 06:10:52] [INFO ] Deduced a trap composed of 438 places in 531 ms of which 1 ms to minimize.
[2024-05-31 06:10:52] [INFO ] Deduced a trap composed of 464 places in 581 ms of which 2 ms to minimize.
[2024-05-31 06:10:53] [INFO ] Deduced a trap composed of 458 places in 490 ms of which 1 ms to minimize.
[2024-05-31 06:10:54] [INFO ] Deduced a trap composed of 436 places in 539 ms of which 1 ms to minimize.
[2024-05-31 06:10:54] [INFO ] Deduced a trap composed of 465 places in 617 ms of which 1 ms to minimize.
[2024-05-31 06:10:55] [INFO ] Deduced a trap composed of 438 places in 692 ms of which 1 ms to minimize.
[2024-05-31 06:10:56] [INFO ] Deduced a trap composed of 446 places in 655 ms of which 1 ms to minimize.
[2024-05-31 06:10:57] [INFO ] Deduced a trap composed of 442 places in 654 ms of which 1 ms to minimize.
[2024-05-31 06:10:57] [INFO ] Deduced a trap composed of 452 places in 669 ms of which 1 ms to minimize.
[2024-05-31 06:10:58] [INFO ] Deduced a trap composed of 459 places in 520 ms of which 1 ms to minimize.
[2024-05-31 06:11:00] [INFO ] Deduced a trap composed of 447 places in 654 ms of which 1 ms to minimize.
[2024-05-31 06:11:01] [INFO ] Deduced a trap composed of 460 places in 664 ms of which 1 ms to minimize.
[2024-05-31 06:11:03] [INFO ] Deduced a trap composed of 443 places in 687 ms of which 1 ms to minimize.
[2024-05-31 06:11:03] [INFO ] Deduced a trap composed of 457 places in 613 ms of which 1 ms to minimize.
[2024-05-31 06:11:04] [INFO ] Deduced a trap composed of 447 places in 667 ms of which 2 ms to minimize.
[2024-05-31 06:11:05] [INFO ] Deduced a trap composed of 463 places in 538 ms of which 1 ms to minimize.
[2024-05-31 06:11:06] [INFO ] Deduced a trap composed of 464 places in 685 ms of which 2 ms to minimize.
[2024-05-31 06:11:06] [INFO ] Deduced a trap composed of 439 places in 544 ms of which 1 ms to minimize.
[2024-05-31 06:11:07] [INFO ] Deduced a trap composed of 449 places in 567 ms of which 1 ms to minimize.
[2024-05-31 06:11:08] [INFO ] Deduced a trap composed of 436 places in 619 ms of which 1 ms to minimize.
[2024-05-31 06:11:09] [INFO ] Deduced a trap composed of 443 places in 563 ms of which 1 ms to minimize.
[2024-05-31 06:11:10] [INFO ] Deduced a trap composed of 444 places in 592 ms of which 1 ms to minimize.
[2024-05-31 06:11:10] [INFO ] Deduced a trap composed of 436 places in 560 ms of which 1 ms to minimize.
[2024-05-31 06:11:11] [INFO ] Deduced a trap composed of 471 places in 519 ms of which 1 ms to minimize.
[2024-05-31 06:11:12] [INFO ] Deduced a trap composed of 466 places in 524 ms of which 1 ms to minimize.
[2024-05-31 06:11:13] [INFO ] Deduced a trap composed of 438 places in 588 ms of which 1 ms to minimize.
[2024-05-31 06:11:14] [INFO ] Deduced a trap composed of 453 places in 599 ms of which 1 ms to minimize.
[2024-05-31 06:11:14] [INFO ] Deduced a trap composed of 448 places in 609 ms of which 1 ms to minimize.
[2024-05-31 06:11:15] [INFO ] Deduced a trap composed of 442 places in 567 ms of which 1 ms to minimize.
[2024-05-31 06:11:16] [INFO ] Deduced a trap composed of 461 places in 562 ms of which 1 ms to minimize.
[2024-05-31 06:11:17] [INFO ] Deduced a trap composed of 432 places in 599 ms of which 1 ms to minimize.
[2024-05-31 06:11:17] [INFO ] Deduced a trap composed of 473 places in 665 ms of which 1 ms to minimize.
[2024-05-31 06:11:18] [INFO ] Deduced a trap composed of 450 places in 586 ms of which 0 ms to minimize.
[2024-05-31 06:11:19] [INFO ] Deduced a trap composed of 474 places in 576 ms of which 1 ms to minimize.
[2024-05-31 06:11:20] [INFO ] Deduced a trap composed of 448 places in 602 ms of which 1 ms to minimize.
[2024-05-31 06:11:21] [INFO ] Deduced a trap composed of 469 places in 683 ms of which 1 ms to minimize.
[2024-05-31 06:11:22] [INFO ] Deduced a trap composed of 452 places in 665 ms of which 1 ms to minimize.
[2024-05-31 06:11:22] [INFO ] Deduced a trap composed of 443 places in 675 ms of which 1 ms to minimize.
[2024-05-31 06:11:25] [INFO ] Trap strengthening (SAT) tested/added 41/41 trap constraints in 36173 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 67 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 69 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 64 ms. Remains 1091 /1091 variables (removed 0) and now considering 2062/2062 (removed 0) transitions.
[2024-05-31 06:11:25] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 06:11:25] [INFO ] Invariant cache hit.
[2024-05-31 06:11:27] [INFO ] Implicit Places using invariants in 2000 ms returned []
[2024-05-31 06:11:27] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 06:11:27] [INFO ] Invariant cache hit.
[2024-05-31 06:11:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:11:55] [INFO ] Implicit Places using invariants and state equation in 27594 ms returned []
Implicit Place search using SMT with State Equation took 29600 ms to find 0 implicit places.
[2024-05-31 06:11:55] [INFO ] Redundant transitions in 133 ms returned []
[2024-05-31 06:11:55] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
[2024-05-31 06:11:55] [INFO ] Invariant cache hit.
[2024-05-31 06:11:57] [INFO ] Dead Transitions using invariants and state equation in 1778 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31617 ms. Remains : 1091/1091 places, 2062/2062 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-12 in 94732 ms.
Starting property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-15
Normalized transition count is 2053 out of 2062 initially.
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:11:57] [INFO ] Computed 142 invariants in 32 ms
Incomplete random walk after 10000 steps, including 697 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :3
[2024-05-31 06:11:57] [INFO ] Flow matrix only has 2053 transitions (discarded 9 similar events)
// Phase 1: matrix 2053 rows 1091 cols
[2024-05-31 06:11:57] [INFO ] Computed 142 invariants in 73 ms
[2024-05-31 06:11:57] [INFO ] [Real]Absence check using 122 positive place invariants in 31 ms returned sat
[2024-05-31 06:11:57] [INFO ] [Real]Absence check using 122 positive and 20 generalized place invariants in 32 ms returned sat
[2024-05-31 06:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:11:59] [INFO ] [Real]Absence check using state equation in 1732 ms returned sat
[2024-05-31 06:11:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:12:00] [INFO ] [Nat]Absence check using 122 positive place invariants in 35 ms returned sat
[2024-05-31 06:12:00] [INFO ] [Nat]Absence check using 122 positive and 20 generalized place invariants in 32 ms returned sat
[2024-05-31 06:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:12:00] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2024-05-31 06:12:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:12:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2436 ms returned sat
[2024-05-31 06:12:03] [INFO ] Deduced a trap composed of 444 places in 692 ms of which 1 ms to minimize.
[2024-05-31 06:12:04] [INFO ] Deduced a trap composed of 462 places in 698 ms of which 1 ms to minimize.
[2024-05-31 06:12:05] [INFO ] Deduced a trap composed of 474 places in 638 ms of which 1 ms to minimize.
[2024-05-31 06:12:05] [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) : [4] 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.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1091 transition count 2061
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1090 transition count 2061
Applied a total of 2 rules in 85 ms. Remains 1090 /1091 variables (removed 1) and now considering 2061/2062 (removed 1) transitions.
[2024-05-31 06:12:05] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 06:12:05] [INFO ] Computed 142 invariants in 41 ms
[2024-05-31 06:12:07] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1672 ms. Remains : 1090/1091 places, 2061/2062 transitions.
Normalized transition count is 2052 out of 2061 initially.
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 06:12:07] [INFO ] Computed 142 invariants in 35 ms
Incomplete random walk after 1000000 steps, including 72795 resets, run finished after 10576 ms. (steps per millisecond=94 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 7252 resets, run finished after 2347 ms. (steps per millisecond=426 ) properties (out of 1) seen :3
[2024-05-31 06:12:20] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
// Phase 1: matrix 2052 rows 1090 cols
[2024-05-31 06:12:20] [INFO ] Computed 142 invariants in 74 ms
[2024-05-31 06:12:20] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-31 06:12:20] [INFO ] [Real]Absence check using 121 positive and 21 generalized place invariants in 42 ms returned sat
[2024-05-31 06:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 06:12:22] [INFO ] [Real]Absence check using state equation in 1636 ms returned sat
[2024-05-31 06:12:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 06:12:22] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2024-05-31 06:12:22] [INFO ] [Nat]Absence check using 121 positive and 21 generalized place invariants in 44 ms returned sat
[2024-05-31 06:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 06:12:23] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2024-05-31 06:12:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:12:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2080 ms returned sat
[2024-05-31 06:12:25] [INFO ] Deduced a trap composed of 456 places in 675 ms of which 1 ms to minimize.
[2024-05-31 06:12:26] [INFO ] Deduced a trap composed of 432 places in 659 ms of which 1 ms to minimize.
[2024-05-31 06:12:27] [INFO ] Deduced a trap composed of 441 places in 703 ms of which 1 ms to minimize.
[2024-05-31 06:12:28] [INFO ] Deduced a trap composed of 461 places in 651 ms of which 1 ms to minimize.
[2024-05-31 06:12:28] [INFO ] Deduced a trap composed of 434 places in 662 ms of which 1 ms to minimize.
[2024-05-31 06:12:29] [INFO ] Deduced a trap composed of 444 places in 653 ms of which 1 ms to minimize.
[2024-05-31 06:12:30] [INFO ] Deduced a trap composed of 458 places in 589 ms of which 1 ms to minimize.
[2024-05-31 06:12:30] [INFO ] Deduced a trap composed of 436 places in 569 ms of which 1 ms to minimize.
[2024-05-31 06:12:31] [INFO ] Deduced a trap composed of 460 places in 545 ms of which 1 ms to minimize.
[2024-05-31 06:12:32] [INFO ] Deduced a trap composed of 442 places in 506 ms of which 1 ms to minimize.
[2024-05-31 06:12:32] [INFO ] Deduced a trap composed of 434 places in 536 ms of which 1 ms to minimize.
[2024-05-31 06:12:33] [INFO ] Deduced a trap composed of 450 places in 532 ms of which 1 ms to minimize.
[2024-05-31 06:12:34] [INFO ] Deduced a trap composed of 443 places in 589 ms of which 0 ms to minimize.
[2024-05-31 06:12:35] [INFO ] Deduced a trap composed of 452 places in 635 ms of which 1 ms to minimize.
[2024-05-31 06:12:35] [INFO ] Deduced a trap composed of 452 places in 594 ms of which 1 ms to minimize.
[2024-05-31 06:12:36] [INFO ] Deduced a trap composed of 441 places in 700 ms of which 1 ms to minimize.
[2024-05-31 06:12:37] [INFO ] Deduced a trap composed of 443 places in 675 ms of which 1 ms to minimize.
[2024-05-31 06:12:38] [INFO ] Deduced a trap composed of 437 places in 678 ms of which 1 ms to minimize.
[2024-05-31 06:12:39] [INFO ] Deduced a trap composed of 438 places in 641 ms of which 1 ms to minimize.
[2024-05-31 06:12:40] [INFO ] Deduced a trap composed of 448 places in 669 ms of which 1 ms to minimize.
[2024-05-31 06:12:41] [INFO ] Deduced a trap composed of 440 places in 679 ms of which 1 ms to minimize.
[2024-05-31 06:12:42] [INFO ] Deduced a trap composed of 440 places in 670 ms of which 1 ms to minimize.
[2024-05-31 06:12:42] [INFO ] Deduced a trap composed of 432 places in 557 ms of which 1 ms to minimize.
[2024-05-31 06:12:44] [INFO ] Deduced a trap composed of 438 places in 661 ms of which 1 ms to minimize.
[2024-05-31 06:12:45] [INFO ] Deduced a trap composed of 434 places in 665 ms of which 1 ms to minimize.
[2024-05-31 06:12:46] [INFO ] Deduced a trap composed of 438 places in 670 ms of which 1 ms to minimize.
[2024-05-31 06:12:47] [INFO ] Deduced a trap composed of 434 places in 880 ms of which 1 ms to minimize.
[2024-05-31 06:12:48] [INFO ] Deduced a trap composed of 449 places in 654 ms of which 1 ms to minimize.
[2024-05-31 06:12:49] [INFO ] Deduced a trap composed of 435 places in 626 ms of which 1 ms to minimize.
[2024-05-31 06:12:50] [INFO ] Deduced a trap composed of 448 places in 612 ms of which 1 ms to minimize.
[2024-05-31 06:12:50] [INFO ] Deduced a trap composed of 445 places in 562 ms of which 1 ms to minimize.
[2024-05-31 06:12:51] [INFO ] Deduced a trap composed of 458 places in 560 ms of which 0 ms to minimize.
[2024-05-31 06:12:52] [INFO ] Deduced a trap composed of 438 places in 566 ms of which 1 ms to minimize.
[2024-05-31 06:12:53] [INFO ] Deduced a trap composed of 438 places in 612 ms of which 1 ms to minimize.
[2024-05-31 06:12:54] [INFO ] Deduced a trap composed of 438 places in 613 ms of which 1 ms to minimize.
[2024-05-31 06:12:54] [INFO ] Deduced a trap composed of 440 places in 565 ms of which 0 ms to minimize.
[2024-05-31 06:12:56] [INFO ] Deduced a trap composed of 419 places in 687 ms of which 1 ms to minimize.
[2024-05-31 06:12:56] [INFO ] Deduced a trap composed of 431 places in 598 ms of which 1 ms to minimize.
[2024-05-31 06:12:57] [INFO ] Deduced a trap composed of 426 places in 477 ms of which 1 ms to minimize.
[2024-05-31 06:12:59] [INFO ] Deduced a trap composed of 440 places in 605 ms of which 3 ms to minimize.
[2024-05-31 06:13:02] [INFO ] Trap strengthening (SAT) tested/added 40/40 trap constraints in 37074 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 81 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 2061/2061 transitions.
Applied a total of 0 rules in 76 ms. Remains 1090 /1090 variables (removed 0) and now considering 2061/2061 (removed 0) transitions.
[2024-05-31 06:13:02] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 06:13:02] [INFO ] Invariant cache hit.
[2024-05-31 06:13:04] [INFO ] Implicit Places using invariants in 1806 ms returned []
[2024-05-31 06:13:04] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 06:13:04] [INFO ] Invariant cache hit.
[2024-05-31 06:13:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 06:13:21] [INFO ] Implicit Places using invariants and state equation in 17027 ms returned []
Implicit Place search using SMT with State Equation took 18850 ms to find 0 implicit places.
[2024-05-31 06:13:21] [INFO ] Redundant transitions in 124 ms returned []
[2024-05-31 06:13:21] [INFO ] Flow matrix only has 2052 transitions (discarded 9 similar events)
[2024-05-31 06:13:21] [INFO ] Invariant cache hit.
[2024-05-31 06:13:23] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20991 ms. Remains : 1090/1090 places, 2061/2061 transitions.
Ending property specific reduction for PolyORBNT-PT-S10J60-UpperBounds-15 in 85762 ms.
[2024-05-31 06:13:23] [INFO ] Flatten gal took : 316 ms
[2024-05-31 06:13:23] [INFO ] Applying decomposition
[2024-05-31 06:13:24] [INFO ] Flatten gal took : 177 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/graph13128286168471262725.txt' '-o' '/tmp/graph13128286168471262725.bin' '-w' '/tmp/graph13128286168471262725.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13128286168471262725.bin' '-l' '-1' '-v' '-w' '/tmp/graph13128286168471262725.weights' '-q' '0' '-e' '0.001'
[2024-05-31 06:13:24] [INFO ] Decomposing Gal with order
[2024-05-31 06:13:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 06:13:25] [INFO ] Removed a total of 4061 redundant transitions.
[2024-05-31 06:13:25] [INFO ] Flatten gal took : 570 ms
[2024-05-31 06:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 564 labels/synchronizations in 90 ms.
[2024-05-31 06:13:25] [INFO ] Time to serialize gal into /tmp/UpperBounds18231015077073931707.gal : 35 ms
[2024-05-31 06:13:25] [INFO ] Time to serialize properties into /tmp/UpperBounds16993052727204323086.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18231015077073931707.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16993052727204323086.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 ...285
Loading property file /tmp/UpperBounds16993052727204323086.prop.
Detected timeout of ITS tools.
[2024-05-31 06:37:18] [INFO ] Flatten gal took : 2746 ms
[2024-05-31 06:37:19] [INFO ] Time to serialize gal into /tmp/UpperBounds1431952467716533814.gal : 60 ms
[2024-05-31 06:37:19] [INFO ] Time to serialize properties into /tmp/UpperBounds16894003924785785282.prop : 2 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/UpperBounds1431952467716533814.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16894003924785785282.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/UpperBounds16894003924785785282.prop.
Detected timeout of ITS tools.
[2024-05-31 07:01:08] [INFO ] Flatten gal took : 1021 ms
[2024-05-31 07:01:09] [INFO ] Input system was already deterministic with 2062 transitions.
[2024-05-31 07:01:10] [INFO ] Transformed 1091 places.
[2024-05-31 07:01:10] [INFO ] Transformed 2062 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 07:01:40] [INFO ] Time to serialize gal into /tmp/UpperBounds598566401753898609.gal : 35 ms
[2024-05-31 07:01:40] [INFO ] Time to serialize properties into /tmp/UpperBounds17296032499506150649.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds598566401753898609.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17296032499506150649.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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17296032499506150649.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 15340412 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16247832 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-S10J60"
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-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 r307-tajo-171654460900316"
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 ;