Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863541200637.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Peterson-PT-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863541200637
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 204K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 847K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 215K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 986K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 124K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 364K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 288K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 402K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 839K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 877K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679217681463

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 09:21:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-19 09:21:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 09:21:25] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2023-03-19 09:21:25] [INFO ] Transformed 1330 places.
[2023-03-19 09:21:25] [INFO ] Transformed 2030 transitions.
[2023-03-19 09:21:25] [INFO ] Found NUPN structural information;
[2023-03-19 09:21:25] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2023-03-19 09:21:25] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 497 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 29 ms.
FORMULA Peterson-PT-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1820 out of 2030 initially.
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-19 09:21:26] [INFO ] Computed 27 place invariants in 60 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 11) seen :29
FORMULA Peterson-PT-6-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 6) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 6) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :20
[2023-03-19 09:21:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-19 09:21:27] [INFO ] Computed 27 place invariants in 18 ms
[2023-03-19 09:21:28] [INFO ] [Real]Absence check using 20 positive place invariants in 60 ms returned sat
[2023-03-19 09:21:28] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-19 09:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:21:28] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2023-03-19 09:21:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:21:29] [INFO ] [Nat]Absence check using 20 positive place invariants in 43 ms returned sat
[2023-03-19 09:21:29] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-19 09:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:21:30] [INFO ] [Nat]Absence check using state equation in 999 ms returned sat
[2023-03-19 09:21:30] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:21:31] [INFO ] [Nat]Added 330 Read/Feed constraints in 573 ms returned sat
[2023-03-19 09:21:32] [INFO ] Deduced a trap composed of 154 places in 923 ms of which 5 ms to minimize.
[2023-03-19 09:21:33] [INFO ] Deduced a trap composed of 29 places in 1028 ms of which 2 ms to minimize.
[2023-03-19 09:21:34] [INFO ] Deduced a trap composed of 29 places in 1146 ms of which 3 ms to minimize.
[2023-03-19 09:21:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 09:21:35] [INFO ] [Real]Absence check using 20 positive place invariants in 58 ms returned sat
[2023-03-19 09:21:35] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-19 09:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:21:36] [INFO ] [Real]Absence check using state equation in 1024 ms returned sat
[2023-03-19 09:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:21:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 46 ms returned sat
[2023-03-19 09:21:36] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-19 09:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:21:37] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2023-03-19 09:21:37] [INFO ] [Nat]Added 330 Read/Feed constraints in 200 ms returned sat
[2023-03-19 09:21:39] [INFO ] Deduced a trap composed of 24 places in 1251 ms of which 2 ms to minimize.
[2023-03-19 09:21:40] [INFO ] Deduced a trap composed of 24 places in 1095 ms of which 2 ms to minimize.
[2023-03-19 09:21:41] [INFO ] Deduced a trap composed of 23 places in 985 ms of which 2 ms to minimize.
[2023-03-19 09:21:42] [INFO ] Deduced a trap composed of 16 places in 1204 ms of which 2 ms to minimize.
[2023-03-19 09:21:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 09:21:43] [INFO ] [Real]Absence check using 20 positive place invariants in 42 ms returned unsat
[2023-03-19 09:21:43] [INFO ] [Real]Absence check using 20 positive place invariants in 65 ms returned unsat
[2023-03-19 09:21:44] [INFO ] [Real]Absence check using 20 positive place invariants in 59 ms returned unsat
[2023-03-19 09:21:44] [INFO ] [Real]Absence check using 20 positive place invariants in 63 ms returned sat
[2023-03-19 09:21:44] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-19 09:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:21:45] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2023-03-19 09:21:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:21:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 39 ms returned sat
[2023-03-19 09:21:46] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-19 09:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:21:47] [INFO ] [Nat]Absence check using state equation in 881 ms returned sat
[2023-03-19 09:21:47] [INFO ] [Nat]Added 330 Read/Feed constraints in 118 ms returned sat
[2023-03-19 09:21:47] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 216 ms.
[2023-03-19 09:21:50] [INFO ] Added : 90 causal constraints over 18 iterations in 3447 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [294, 42, 7, 7, 7, 1] Max seen :[3, 6, 7, 7, 7, 0]
FORMULA Peterson-PT-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 336 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 252 Post agglomeration using F-continuation condition.Transition count delta: 252
Iterating post reduction 1 with 504 rules applied. Total rules applied 756 place count 1078 transition count 1526
Reduce places removed 252 places and 0 transitions.
Iterating post reduction 2 with 252 rules applied. Total rules applied 1008 place count 826 transition count 1526
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 1008 place count 826 transition count 1484
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1092 place count 784 transition count 1484
Applied a total of 1092 rules in 434 ms. Remains 784 /1330 variables (removed 546) and now considering 1484/2030 (removed 546) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 784/1330 places, 1484/2030 transitions.
Normalized transition count is 1274 out of 1484 initially.
// Phase 1: matrix 1274 rows 784 cols
[2023-03-19 09:21:51] [INFO ] Computed 27 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 9114 ms. (steps per millisecond=109 ) properties (out of 3) seen :10
Interrupted Best-First random walk after 774706 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=154 ) properties seen 4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2199 ms. (steps per millisecond=454 ) properties (out of 3) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1465 ms. (steps per millisecond=682 ) properties (out of 3) seen :10
[2023-03-19 09:22:09] [INFO ] Flow matrix only has 1274 transitions (discarded 210 similar events)
// Phase 1: matrix 1274 rows 784 cols
[2023-03-19 09:22:09] [INFO ] Computed 27 place invariants in 11 ms
[2023-03-19 09:22:09] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned sat
[2023-03-19 09:22:09] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 09:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:22:10] [INFO ] [Real]Absence check using state equation in 489 ms returned sat
[2023-03-19 09:22:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:22:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 38 ms returned sat
[2023-03-19 09:22:10] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-19 09:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:22:11] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2023-03-19 09:22:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:22:11] [INFO ] [Nat]Added 330 Read/Feed constraints in 501 ms returned sat
[2023-03-19 09:22:12] [INFO ] Deduced a trap composed of 78 places in 871 ms of which 3 ms to minimize.
[2023-03-19 09:22:13] [INFO ] Deduced a trap composed of 78 places in 924 ms of which 1 ms to minimize.
[2023-03-19 09:22:14] [INFO ] Deduced a trap composed of 29 places in 965 ms of which 1 ms to minimize.
[2023-03-19 09:22:15] [INFO ] Deduced a trap composed of 12 places in 692 ms of which 1 ms to minimize.
[2023-03-19 09:22:16] [INFO ] Deduced a trap composed of 44 places in 834 ms of which 2 ms to minimize.
[2023-03-19 09:22:17] [INFO ] Deduced a trap composed of 12 places in 908 ms of which 2 ms to minimize.
[2023-03-19 09:22:18] [INFO ] Deduced a trap composed of 78 places in 829 ms of which 1 ms to minimize.
[2023-03-19 09:22:19] [INFO ] Deduced a trap composed of 28 places in 768 ms of which 1 ms to minimize.
[2023-03-19 09:22:20] [INFO ] Deduced a trap composed of 75 places in 909 ms of which 2 ms to minimize.
[2023-03-19 09:22:21] [INFO ] Deduced a trap composed of 70 places in 1012 ms of which 2 ms to minimize.
[2023-03-19 09:22:22] [INFO ] Deduced a trap composed of 12 places in 817 ms of which 1 ms to minimize.
[2023-03-19 09:22:22] [INFO ] Deduced a trap composed of 39 places in 772 ms of which 1 ms to minimize.
[2023-03-19 09:22:23] [INFO ] Deduced a trap composed of 12 places in 921 ms of which 2 ms to minimize.
[2023-03-19 09:22:24] [INFO ] Deduced a trap composed of 12 places in 927 ms of which 1 ms to minimize.
[2023-03-19 09:22:25] [INFO ] Deduced a trap composed of 56 places in 844 ms of which 2 ms to minimize.
[2023-03-19 09:22:26] [INFO ] Deduced a trap composed of 32 places in 921 ms of which 2 ms to minimize.
[2023-03-19 09:22:27] [INFO ] Deduced a trap composed of 32 places in 915 ms of which 2 ms to minimize.
[2023-03-19 09:22:28] [INFO ] Deduced a trap composed of 67 places in 881 ms of which 1 ms to minimize.
[2023-03-19 09:22:29] [INFO ] Deduced a trap composed of 10 places in 830 ms of which 2 ms to minimize.
[2023-03-19 09:22:30] [INFO ] Deduced a trap composed of 12 places in 913 ms of which 1 ms to minimize.
[2023-03-19 09:22:31] [INFO ] Deduced a trap composed of 35 places in 932 ms of which 1 ms to minimize.
[2023-03-19 09:22:32] [INFO ] Deduced a trap composed of 110 places in 827 ms of which 2 ms to minimize.
[2023-03-19 09:22:33] [INFO ] Deduced a trap composed of 74 places in 719 ms of which 1 ms to minimize.
[2023-03-19 09:22:34] [INFO ] Deduced a trap composed of 91 places in 749 ms of which 1 ms to minimize.
[2023-03-19 09:22:35] [INFO ] Deduced a trap composed of 76 places in 526 ms of which 1 ms to minimize.
[2023-03-19 09:22:35] [INFO ] Deduced a trap composed of 40 places in 617 ms of which 2 ms to minimize.
[2023-03-19 09:22:36] [INFO ] Deduced a trap composed of 40 places in 725 ms of which 2 ms to minimize.
[2023-03-19 09:22:37] [INFO ] Deduced a trap composed of 76 places in 572 ms of which 5 ms to minimize.
[2023-03-19 09:22:37] [INFO ] Deduced a trap composed of 114 places in 735 ms of which 2 ms to minimize.
[2023-03-19 09:22:38] [INFO ] Deduced a trap composed of 59 places in 782 ms of which 2 ms to minimize.
[2023-03-19 09:22:39] [INFO ] Deduced a trap composed of 39 places in 824 ms of which 1 ms to minimize.
[2023-03-19 09:22:40] [INFO ] Deduced a trap composed of 39 places in 720 ms of which 0 ms to minimize.
[2023-03-19 09:22:41] [INFO ] Deduced a trap composed of 112 places in 551 ms of which 1 ms to minimize.
[2023-03-19 09:22:42] [INFO ] Deduced a trap composed of 112 places in 626 ms of which 1 ms to minimize.
[2023-03-19 09:22:42] [INFO ] Deduced a trap composed of 162 places in 561 ms of which 1 ms to minimize.
[2023-03-19 09:22:43] [INFO ] Deduced a trap composed of 33 places in 610 ms of which 2 ms to minimize.
[2023-03-19 09:22:44] [INFO ] Deduced a trap composed of 98 places in 767 ms of which 1 ms to minimize.
[2023-03-19 09:22:45] [INFO ] Deduced a trap composed of 98 places in 591 ms of which 1 ms to minimize.
[2023-03-19 09:22:45] [INFO ] Deduced a trap composed of 98 places in 504 ms of which 1 ms to minimize.
[2023-03-19 09:22:46] [INFO ] Deduced a trap composed of 33 places in 582 ms of which 1 ms to minimize.
[2023-03-19 09:22:47] [INFO ] Deduced a trap composed of 62 places in 594 ms of which 1 ms to minimize.
[2023-03-19 09:22:47] [INFO ] Deduced a trap composed of 92 places in 483 ms of which 1 ms to minimize.
[2023-03-19 09:22:48] [INFO ] Deduced a trap composed of 46 places in 636 ms of which 1 ms to minimize.
[2023-03-19 09:22:48] [INFO ] Deduced a trap composed of 63 places in 510 ms of which 3 ms to minimize.
[2023-03-19 09:22:49] [INFO ] Deduced a trap composed of 69 places in 444 ms of which 1 ms to minimize.
[2023-03-19 09:22:50] [INFO ] Deduced a trap composed of 50 places in 635 ms of which 2 ms to minimize.
[2023-03-19 09:22:50] [INFO ] Deduced a trap composed of 52 places in 612 ms of which 1 ms to minimize.
[2023-03-19 09:22:51] [INFO ] Deduced a trap composed of 80 places in 457 ms of which 1 ms to minimize.
[2023-03-19 09:22:52] [INFO ] Deduced a trap composed of 63 places in 632 ms of which 1 ms to minimize.
[2023-03-19 09:22:52] [INFO ] Deduced a trap composed of 46 places in 510 ms of which 5 ms to minimize.
[2023-03-19 09:22:53] [INFO ] Deduced a trap composed of 84 places in 588 ms of which 1 ms to minimize.
[2023-03-19 09:22:54] [INFO ] Deduced a trap composed of 50 places in 536 ms of which 2 ms to minimize.
[2023-03-19 09:22:54] [INFO ] Deduced a trap composed of 81 places in 522 ms of which 1 ms to minimize.
[2023-03-19 09:22:55] [INFO ] Deduced a trap composed of 97 places in 541 ms of which 1 ms to minimize.
[2023-03-19 09:22:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 09:22:55] [INFO ] [Real]Absence check using 20 positive place invariants in 37 ms returned sat
[2023-03-19 09:22:55] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-19 09:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:22:56] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2023-03-19 09:22:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:22:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 34 ms returned sat
[2023-03-19 09:22:56] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-19 09:22:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:22:57] [INFO ] [Nat]Absence check using state equation in 519 ms returned sat
[2023-03-19 09:22:57] [INFO ] [Nat]Added 330 Read/Feed constraints in 119 ms returned sat
[2023-03-19 09:22:58] [INFO ] Deduced a trap composed of 18 places in 777 ms of which 2 ms to minimize.
[2023-03-19 09:22:58] [INFO ] Deduced a trap composed of 10 places in 787 ms of which 1 ms to minimize.
[2023-03-19 09:22:59] [INFO ] Deduced a trap composed of 10 places in 774 ms of which 2 ms to minimize.
[2023-03-19 09:23:00] [INFO ] Deduced a trap composed of 18 places in 857 ms of which 2 ms to minimize.
[2023-03-19 09:23:01] [INFO ] Deduced a trap composed of 16 places in 772 ms of which 2 ms to minimize.
[2023-03-19 09:23:02] [INFO ] Deduced a trap composed of 10 places in 814 ms of which 4 ms to minimize.
[2023-03-19 09:23:03] [INFO ] Deduced a trap composed of 16 places in 783 ms of which 3 ms to minimize.
[2023-03-19 09:23:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 6079 ms
[2023-03-19 09:23:03] [INFO ] [Real]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-19 09:23:03] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-19 09:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:23:04] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2023-03-19 09:23:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:23:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 40 ms returned sat
[2023-03-19 09:23:04] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-19 09:23:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:23:05] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2023-03-19 09:23:05] [INFO ] [Nat]Added 330 Read/Feed constraints in 75 ms returned sat
[2023-03-19 09:23:05] [INFO ] Computed and/alt/rep : 1183/2996/1183 causal constraints (skipped 84 transitions) in 114 ms.
[2023-03-19 09:23:20] [INFO ] Deduced a trap composed of 10 places in 746 ms of which 3 ms to minimize.
[2023-03-19 09:23:21] [INFO ] Deduced a trap composed of 26 places in 714 ms of which 1 ms to minimize.
[2023-03-19 09:23:22] [INFO ] Deduced a trap composed of 10 places in 695 ms of which 1 ms to minimize.
[2023-03-19 09:23:23] [INFO ] Deduced a trap composed of 29 places in 658 ms of which 1 ms to minimize.
[2023-03-19 09:23:23] [INFO ] Deduced a trap composed of 35 places in 652 ms of which 1 ms to minimize.
[2023-03-19 09:23:24] [INFO ] Deduced a trap composed of 122 places in 517 ms of which 2 ms to minimize.
[2023-03-19 09:23:25] [INFO ] Deduced a trap composed of 122 places in 567 ms of which 1 ms to minimize.
[2023-03-19 09:23:25] [INFO ] Deduced a trap composed of 46 places in 558 ms of which 1 ms to minimize.
[2023-03-19 09:23:26] [INFO ] Deduced a trap composed of 56 places in 544 ms of which 1 ms to minimize.
[2023-03-19 09:23:27] [INFO ] Deduced a trap composed of 56 places in 569 ms of which 1 ms to minimize.
[2023-03-19 09:23:28] [INFO ] Deduced a trap composed of 46 places in 543 ms of which 1 ms to minimize.
[2023-03-19 09:23:28] [INFO ] Deduced a trap composed of 33 places in 668 ms of which 1 ms to minimize.
[2023-03-19 09:23:29] [INFO ] Deduced a trap composed of 62 places in 483 ms of which 1 ms to minimize.
[2023-03-19 09:23:30] [INFO ] Deduced a trap composed of 62 places in 481 ms of which 1 ms to minimize.
[2023-03-19 09:23:30] [INFO ] Deduced a trap composed of 40 places in 568 ms of which 1 ms to minimize.
[2023-03-19 09:23:31] [INFO ] Deduced a trap composed of 75 places in 678 ms of which 1 ms to minimize.
[2023-03-19 09:23:32] [INFO ] Deduced a trap composed of 40 places in 565 ms of which 1 ms to minimize.
[2023-03-19 09:23:33] [INFO ] Deduced a trap composed of 80 places in 526 ms of which 1 ms to minimize.
[2023-03-19 09:23:33] [INFO ] Deduced a trap composed of 18 places in 739 ms of which 2 ms to minimize.
[2023-03-19 09:23:34] [INFO ] Deduced a trap composed of 27 places in 607 ms of which 1 ms to minimize.
[2023-03-19 09:23:35] [INFO ] Deduced a trap composed of 54 places in 540 ms of which 1 ms to minimize.
[2023-03-19 09:23:36] [INFO ] Deduced a trap composed of 54 places in 540 ms of which 2 ms to minimize.
[2023-03-19 09:23:36] [INFO ] Deduced a trap composed of 46 places in 566 ms of which 1 ms to minimize.
[2023-03-19 09:23:37] [INFO ] Deduced a trap composed of 58 places in 770 ms of which 1 ms to minimize.
[2023-03-19 09:23:38] [INFO ] Deduced a trap composed of 77 places in 676 ms of which 2 ms to minimize.
[2023-03-19 09:23:39] [INFO ] Deduced a trap composed of 33 places in 642 ms of which 1 ms to minimize.
[2023-03-19 09:23:40] [INFO ] Deduced a trap composed of 43 places in 625 ms of which 1 ms to minimize.
[2023-03-19 09:23:40] [INFO ] Deduced a trap composed of 61 places in 381 ms of which 1 ms to minimize.
[2023-03-19 09:23:41] [INFO ] Deduced a trap composed of 57 places in 702 ms of which 1 ms to minimize.
[2023-03-19 09:23:42] [INFO ] Deduced a trap composed of 59 places in 525 ms of which 1 ms to minimize.
[2023-03-19 09:23:42] [INFO ] Deduced a trap composed of 40 places in 527 ms of which 1 ms to minimize.
[2023-03-19 09:23:43] [INFO ] Deduced a trap composed of 71 places in 616 ms of which 0 ms to minimize.
[2023-03-19 09:23:43] [INFO ] Deduced a trap composed of 69 places in 262 ms of which 0 ms to minimize.
[2023-03-19 09:23:43] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 24248 ms
[2023-03-19 09:23:44] [INFO ] Added : 478 causal constraints over 97 iterations in 38688 ms.(timeout) Result :sat
Minimization took 727 ms.
Current structural bounds on expressions (after SMT) : [294, 6, 1] Max seen :[6, 6, 0]
FORMULA Peterson-PT-6-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 294 out of 784 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 784/784 places, 1484/1484 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 784 transition count 1442
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 742 transition count 1442
Applied a total of 84 rules in 62 ms. Remains 742 /784 variables (removed 42) and now considering 1442/1484 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 742/784 places, 1442/1484 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 742 cols
[2023-03-19 09:23:47] [INFO ] Computed 27 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8293 ms. (steps per millisecond=120 ) properties (out of 1) seen :6
Finished Best-First random walk after 690362 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=138 )
[2023-03-19 09:24:00] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2023-03-19 09:24:00] [INFO ] Computed 27 place invariants in 14 ms
[2023-03-19 09:24:00] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2023-03-19 09:24:00] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-19 09:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:24:01] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-19 09:24:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:24:01] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2023-03-19 09:24:01] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-19 09:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:24:01] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2023-03-19 09:24:01] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:24:02] [INFO ] [Nat]Added 330 Read/Feed constraints in 305 ms returned sat
[2023-03-19 09:24:02] [INFO ] Deduced a trap composed of 41 places in 684 ms of which 1 ms to minimize.
[2023-03-19 09:24:03] [INFO ] Deduced a trap composed of 49 places in 610 ms of which 1 ms to minimize.
[2023-03-19 09:24:04] [INFO ] Deduced a trap composed of 27 places in 722 ms of which 1 ms to minimize.
[2023-03-19 09:24:05] [INFO ] Deduced a trap composed of 12 places in 544 ms of which 1 ms to minimize.
[2023-03-19 09:24:05] [INFO ] Deduced a trap composed of 28 places in 544 ms of which 1 ms to minimize.
[2023-03-19 09:24:06] [INFO ] Deduced a trap composed of 26 places in 534 ms of which 0 ms to minimize.
[2023-03-19 09:24:06] [INFO ] Deduced a trap composed of 34 places in 663 ms of which 1 ms to minimize.
[2023-03-19 09:24:07] [INFO ] Deduced a trap composed of 76 places in 573 ms of which 1 ms to minimize.
[2023-03-19 09:24:08] [INFO ] Deduced a trap composed of 26 places in 906 ms of which 6 ms to minimize.
[2023-03-19 09:24:09] [INFO ] Deduced a trap composed of 129 places in 879 ms of which 2 ms to minimize.
[2023-03-19 09:24:10] [INFO ] Deduced a trap composed of 20 places in 925 ms of which 1 ms to minimize.
[2023-03-19 09:24:11] [INFO ] Deduced a trap composed of 10 places in 806 ms of which 1 ms to minimize.
[2023-03-19 09:24:12] [INFO ] Deduced a trap composed of 10 places in 700 ms of which 1 ms to minimize.
[2023-03-19 09:24:13] [INFO ] Deduced a trap composed of 58 places in 870 ms of which 1 ms to minimize.
[2023-03-19 09:24:14] [INFO ] Deduced a trap composed of 18 places in 894 ms of which 2 ms to minimize.
[2023-03-19 09:24:15] [INFO ] Deduced a trap composed of 18 places in 781 ms of which 1 ms to minimize.
[2023-03-19 09:24:15] [INFO ] Deduced a trap composed of 18 places in 825 ms of which 2 ms to minimize.
[2023-03-19 09:24:16] [INFO ] Deduced a trap composed of 16 places in 872 ms of which 1 ms to minimize.
[2023-03-19 09:24:17] [INFO ] Deduced a trap composed of 30 places in 785 ms of which 2 ms to minimize.
[2023-03-19 09:24:18] [INFO ] Deduced a trap composed of 30 places in 776 ms of which 1 ms to minimize.
[2023-03-19 09:24:19] [INFO ] Deduced a trap composed of 30 places in 758 ms of which 1 ms to minimize.
[2023-03-19 09:24:20] [INFO ] Deduced a trap composed of 28 places in 710 ms of which 1 ms to minimize.
[2023-03-19 09:24:20] [INFO ] Deduced a trap composed of 44 places in 634 ms of which 1 ms to minimize.
[2023-03-19 09:24:21] [INFO ] Deduced a trap composed of 28 places in 841 ms of which 1 ms to minimize.
[2023-03-19 09:24:22] [INFO ] Deduced a trap composed of 103 places in 811 ms of which 2 ms to minimize.
[2023-03-19 09:24:23] [INFO ] Deduced a trap composed of 78 places in 745 ms of which 1 ms to minimize.
[2023-03-19 09:24:24] [INFO ] Deduced a trap composed of 62 places in 721 ms of which 2 ms to minimize.
[2023-03-19 09:24:24] [INFO ] Deduced a trap composed of 32 places in 513 ms of which 1 ms to minimize.
[2023-03-19 09:24:25] [INFO ] Deduced a trap composed of 50 places in 515 ms of which 1 ms to minimize.
[2023-03-19 09:24:26] [INFO ] Deduced a trap composed of 111 places in 687 ms of which 1 ms to minimize.
[2023-03-19 09:24:27] [INFO ] Deduced a trap composed of 46 places in 690 ms of which 1 ms to minimize.
[2023-03-19 09:24:27] [INFO ] Deduced a trap composed of 46 places in 683 ms of which 1 ms to minimize.
[2023-03-19 09:24:28] [INFO ] Deduced a trap composed of 82 places in 624 ms of which 1 ms to minimize.
[2023-03-19 09:24:29] [INFO ] Deduced a trap composed of 48 places in 624 ms of which 2 ms to minimize.
[2023-03-19 09:24:29] [INFO ] Deduced a trap composed of 50 places in 617 ms of which 1 ms to minimize.
[2023-03-19 09:24:30] [INFO ] Deduced a trap composed of 52 places in 625 ms of which 1 ms to minimize.
[2023-03-19 09:24:31] [INFO ] Deduced a trap composed of 78 places in 593 ms of which 1 ms to minimize.
[2023-03-19 09:24:31] [INFO ] Deduced a trap composed of 78 places in 556 ms of which 1 ms to minimize.
[2023-03-19 09:24:32] [INFO ] Deduced a trap composed of 124 places in 648 ms of which 1 ms to minimize.
[2023-03-19 09:24:33] [INFO ] Deduced a trap composed of 78 places in 739 ms of which 2 ms to minimize.
[2023-03-19 09:24:34] [INFO ] Deduced a trap composed of 62 places in 725 ms of which 1 ms to minimize.
[2023-03-19 09:24:35] [INFO ] Deduced a trap composed of 64 places in 740 ms of which 2 ms to minimize.
[2023-03-19 09:24:35] [INFO ] Deduced a trap composed of 62 places in 723 ms of which 1 ms to minimize.
[2023-03-19 09:24:36] [INFO ] Deduced a trap composed of 76 places in 595 ms of which 2 ms to minimize.
[2023-03-19 09:24:37] [INFO ] Deduced a trap composed of 64 places in 583 ms of which 1 ms to minimize.
[2023-03-19 09:24:38] [INFO ] Deduced a trap composed of 60 places in 587 ms of which 2 ms to minimize.
[2023-03-19 09:24:39] [INFO ] Deduced a trap composed of 70 places in 671 ms of which 1 ms to minimize.
[2023-03-19 09:24:40] [INFO ] Deduced a trap composed of 60 places in 681 ms of which 1 ms to minimize.
[2023-03-19 09:24:40] [INFO ] Deduced a trap composed of 44 places in 586 ms of which 1 ms to minimize.
[2023-03-19 09:24:41] [INFO ] Deduced a trap composed of 62 places in 672 ms of which 1 ms to minimize.
[2023-03-19 09:24:42] [INFO ] Deduced a trap composed of 62 places in 655 ms of which 1 ms to minimize.
[2023-03-19 09:24:43] [INFO ] Deduced a trap composed of 92 places in 434 ms of which 1 ms to minimize.
[2023-03-19 09:24:43] [INFO ] Deduced a trap composed of 38 places in 587 ms of which 2 ms to minimize.
[2023-03-19 09:24:44] [INFO ] Deduced a trap composed of 80 places in 388 ms of which 1 ms to minimize.
[2023-03-19 09:24:44] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 42031 ms
[2023-03-19 09:24:44] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 147 ms.
[2023-03-19 09:24:46] [INFO ] Added : 65 causal constraints over 13 iterations in 1841 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 742 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 63 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 742/742 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 70 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-19 09:24:46] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:24:46] [INFO ] Invariant cache hit.
[2023-03-19 09:24:47] [INFO ] Implicit Places using invariants in 932 ms returned [714, 715, 717, 734, 735, 736, 737]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 939 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 735/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 48 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1059 ms. Remains : 735/742 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-19 09:24:47] [INFO ] Computed 20 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8852 ms. (steps per millisecond=112 ) properties (out of 1) seen :6
Finished Best-First random walk after 743050 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=148 )
[2023-03-19 09:25:01] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-19 09:25:01] [INFO ] Computed 20 place invariants in 8 ms
[2023-03-19 09:25:01] [INFO ] [Real]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-19 09:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:25:02] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2023-03-19 09:25:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:25:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-19 09:25:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:25:03] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2023-03-19 09:25:03] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:25:03] [INFO ] [Nat]Added 330 Read/Feed constraints in 345 ms returned sat
[2023-03-19 09:25:04] [INFO ] Deduced a trap composed of 37 places in 778 ms of which 1 ms to minimize.
[2023-03-19 09:25:05] [INFO ] Deduced a trap composed of 44 places in 799 ms of which 2 ms to minimize.
[2023-03-19 09:25:05] [INFO ] Deduced a trap composed of 16 places in 777 ms of which 1 ms to minimize.
[2023-03-19 09:25:06] [INFO ] Deduced a trap composed of 18 places in 865 ms of which 2 ms to minimize.
[2023-03-19 09:25:07] [INFO ] Deduced a trap composed of 12 places in 766 ms of which 2 ms to minimize.
[2023-03-19 09:25:08] [INFO ] Deduced a trap composed of 12 places in 781 ms of which 2 ms to minimize.
[2023-03-19 09:25:09] [INFO ] Deduced a trap composed of 18 places in 816 ms of which 1 ms to minimize.
[2023-03-19 09:25:10] [INFO ] Deduced a trap composed of 12 places in 789 ms of which 2 ms to minimize.
[2023-03-19 09:25:11] [INFO ] Deduced a trap composed of 18 places in 796 ms of which 1 ms to minimize.
[2023-03-19 09:25:12] [INFO ] Deduced a trap composed of 52 places in 849 ms of which 1 ms to minimize.
[2023-03-19 09:25:13] [INFO ] Deduced a trap composed of 40 places in 738 ms of which 1 ms to minimize.
[2023-03-19 09:25:13] [INFO ] Deduced a trap composed of 34 places in 771 ms of which 2 ms to minimize.
[2023-03-19 09:25:14] [INFO ] Deduced a trap composed of 76 places in 777 ms of which 1 ms to minimize.
[2023-03-19 09:25:15] [INFO ] Deduced a trap composed of 48 places in 792 ms of which 1 ms to minimize.
[2023-03-19 09:25:16] [INFO ] Deduced a trap composed of 32 places in 759 ms of which 1 ms to minimize.
[2023-03-19 09:25:17] [INFO ] Deduced a trap composed of 32 places in 776 ms of which 2 ms to minimize.
[2023-03-19 09:25:18] [INFO ] Deduced a trap composed of 91 places in 795 ms of which 2 ms to minimize.
[2023-03-19 09:25:18] [INFO ] Deduced a trap composed of 34 places in 754 ms of which 2 ms to minimize.
[2023-03-19 09:25:19] [INFO ] Deduced a trap composed of 34 places in 758 ms of which 1 ms to minimize.
[2023-03-19 09:25:20] [INFO ] Deduced a trap composed of 34 places in 738 ms of which 1 ms to minimize.
[2023-03-19 09:25:21] [INFO ] Deduced a trap composed of 55 places in 786 ms of which 2 ms to minimize.
[2023-03-19 09:25:22] [INFO ] Deduced a trap composed of 68 places in 771 ms of which 2 ms to minimize.
[2023-03-19 09:25:23] [INFO ] Deduced a trap composed of 60 places in 772 ms of which 2 ms to minimize.
[2023-03-19 09:25:24] [INFO ] Deduced a trap composed of 38 places in 760 ms of which 1 ms to minimize.
[2023-03-19 09:25:25] [INFO ] Deduced a trap composed of 74 places in 765 ms of which 2 ms to minimize.
[2023-03-19 09:25:25] [INFO ] Deduced a trap composed of 30 places in 756 ms of which 2 ms to minimize.
[2023-03-19 09:25:26] [INFO ] Deduced a trap composed of 64 places in 653 ms of which 2 ms to minimize.
[2023-03-19 09:25:27] [INFO ] Deduced a trap composed of 48 places in 638 ms of which 1 ms to minimize.
[2023-03-19 09:25:28] [INFO ] Deduced a trap composed of 91 places in 701 ms of which 2 ms to minimize.
[2023-03-19 09:25:28] [INFO ] Deduced a trap composed of 42 places in 488 ms of which 1 ms to minimize.
[2023-03-19 09:25:29] [INFO ] Deduced a trap composed of 46 places in 695 ms of which 1 ms to minimize.
[2023-03-19 09:25:30] [INFO ] Deduced a trap composed of 111 places in 720 ms of which 1 ms to minimize.
[2023-03-19 09:25:30] [INFO ] Deduced a trap composed of 44 places in 658 ms of which 2 ms to minimize.
[2023-03-19 09:25:31] [INFO ] Deduced a trap composed of 92 places in 591 ms of which 1 ms to minimize.
[2023-03-19 09:25:32] [INFO ] Deduced a trap composed of 92 places in 526 ms of which 1 ms to minimize.
[2023-03-19 09:25:32] [INFO ] Deduced a trap composed of 60 places in 453 ms of which 1 ms to minimize.
[2023-03-19 09:25:33] [INFO ] Deduced a trap composed of 64 places in 466 ms of which 1 ms to minimize.
[2023-03-19 09:25:33] [INFO ] Deduced a trap composed of 112 places in 467 ms of which 1 ms to minimize.
[2023-03-19 09:25:34] [INFO ] Deduced a trap composed of 60 places in 470 ms of which 2 ms to minimize.
[2023-03-19 09:25:34] [INFO ] Deduced a trap composed of 92 places in 381 ms of which 1 ms to minimize.
[2023-03-19 09:25:35] [INFO ] Deduced a trap composed of 80 places in 386 ms of which 1 ms to minimize.
[2023-03-19 09:25:35] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 32075 ms
[2023-03-19 09:25:35] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 147 ms.
[2023-03-19 09:25:47] [INFO ] Deduced a trap composed of 76 places in 499 ms of which 1 ms to minimize.
[2023-03-19 09:25:47] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 48 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 45 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-19 09:25:47] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:25:47] [INFO ] Invariant cache hit.
[2023-03-19 09:25:48] [INFO ] Implicit Places using invariants in 828 ms returned []
[2023-03-19 09:25:48] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:25:48] [INFO ] Invariant cache hit.
[2023-03-19 09:25:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:25:54] [INFO ] Implicit Places using invariants and state equation in 5727 ms returned []
Implicit Place search using SMT with State Equation took 6558 ms to find 0 implicit places.
[2023-03-19 09:25:54] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-19 09:25:54] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:25:54] [INFO ] Invariant cache hit.
[2023-03-19 09:25:55] [INFO ] Dead Transitions using invariants and state equation in 1514 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8292 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting property specific reduction for Peterson-PT-6-UpperBounds-00
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-19 09:25:55] [INFO ] Computed 20 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 1) seen :1
[2023-03-19 09:25:55] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-19 09:25:55] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-19 09:25:56] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned sat
[2023-03-19 09:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:25:56] [INFO ] [Real]Absence check using state equation in 594 ms returned sat
[2023-03-19 09:25:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:25:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 34 ms returned sat
[2023-03-19 09:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:25:57] [INFO ] [Nat]Absence check using state equation in 524 ms returned sat
[2023-03-19 09:25:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:25:57] [INFO ] [Nat]Added 330 Read/Feed constraints in 251 ms returned sat
[2023-03-19 09:25:58] [INFO ] Deduced a trap composed of 47 places in 584 ms of which 1 ms to minimize.
[2023-03-19 09:25:59] [INFO ] Deduced a trap composed of 38 places in 735 ms of which 2 ms to minimize.
[2023-03-19 09:26:00] [INFO ] Deduced a trap composed of 28 places in 553 ms of which 1 ms to minimize.
[2023-03-19 09:26:00] [INFO ] Deduced a trap composed of 63 places in 656 ms of which 1 ms to minimize.
[2023-03-19 09:26:01] [INFO ] Deduced a trap composed of 12 places in 753 ms of which 1 ms to minimize.
[2023-03-19 09:26:02] [INFO ] Deduced a trap composed of 48 places in 805 ms of which 1 ms to minimize.
[2023-03-19 09:26:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [294] Max seen :[4]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 25 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-19 09:26:02] [INFO ] Computed 20 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8037 ms. (steps per millisecond=124 ) properties (out of 1) seen :6
Finished Best-First random walk after 765930 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=153 )
[2023-03-19 09:26:15] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-19 09:26:15] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-19 09:26:15] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2023-03-19 09:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:26:16] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2023-03-19 09:26:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:26:16] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2023-03-19 09:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:26:17] [INFO ] [Nat]Absence check using state equation in 521 ms returned sat
[2023-03-19 09:26:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:26:17] [INFO ] [Nat]Added 330 Read/Feed constraints in 322 ms returned sat
[2023-03-19 09:26:18] [INFO ] Deduced a trap composed of 37 places in 791 ms of which 1 ms to minimize.
[2023-03-19 09:26:19] [INFO ] Deduced a trap composed of 44 places in 762 ms of which 1 ms to minimize.
[2023-03-19 09:26:19] [INFO ] Deduced a trap composed of 16 places in 647 ms of which 2 ms to minimize.
[2023-03-19 09:26:20] [INFO ] Deduced a trap composed of 18 places in 696 ms of which 1 ms to minimize.
[2023-03-19 09:26:21] [INFO ] Deduced a trap composed of 12 places in 608 ms of which 2 ms to minimize.
[2023-03-19 09:26:21] [INFO ] Deduced a trap composed of 12 places in 707 ms of which 1 ms to minimize.
[2023-03-19 09:26:22] [INFO ] Deduced a trap composed of 18 places in 635 ms of which 1 ms to minimize.
[2023-03-19 09:26:23] [INFO ] Deduced a trap composed of 12 places in 634 ms of which 2 ms to minimize.
[2023-03-19 09:26:23] [INFO ] Deduced a trap composed of 18 places in 651 ms of which 1 ms to minimize.
[2023-03-19 09:26:24] [INFO ] Deduced a trap composed of 52 places in 824 ms of which 1 ms to minimize.
[2023-03-19 09:26:25] [INFO ] Deduced a trap composed of 40 places in 622 ms of which 2 ms to minimize.
[2023-03-19 09:26:26] [INFO ] Deduced a trap composed of 34 places in 755 ms of which 1 ms to minimize.
[2023-03-19 09:26:27] [INFO ] Deduced a trap composed of 76 places in 734 ms of which 1 ms to minimize.
[2023-03-19 09:26:27] [INFO ] Deduced a trap composed of 48 places in 690 ms of which 1 ms to minimize.
[2023-03-19 09:26:28] [INFO ] Deduced a trap composed of 32 places in 587 ms of which 1 ms to minimize.
[2023-03-19 09:26:29] [INFO ] Deduced a trap composed of 32 places in 753 ms of which 2 ms to minimize.
[2023-03-19 09:26:30] [INFO ] Deduced a trap composed of 91 places in 726 ms of which 2 ms to minimize.
[2023-03-19 09:26:30] [INFO ] Deduced a trap composed of 34 places in 604 ms of which 1 ms to minimize.
[2023-03-19 09:26:31] [INFO ] Deduced a trap composed of 34 places in 616 ms of which 1 ms to minimize.
[2023-03-19 09:26:31] [INFO ] Deduced a trap composed of 34 places in 460 ms of which 0 ms to minimize.
[2023-03-19 09:26:32] [INFO ] Deduced a trap composed of 55 places in 452 ms of which 1 ms to minimize.
[2023-03-19 09:26:33] [INFO ] Deduced a trap composed of 68 places in 471 ms of which 1 ms to minimize.
[2023-03-19 09:26:33] [INFO ] Deduced a trap composed of 60 places in 556 ms of which 1 ms to minimize.
[2023-03-19 09:26:34] [INFO ] Deduced a trap composed of 38 places in 541 ms of which 1 ms to minimize.
[2023-03-19 09:26:35] [INFO ] Deduced a trap composed of 74 places in 745 ms of which 1 ms to minimize.
[2023-03-19 09:26:35] [INFO ] Deduced a trap composed of 30 places in 571 ms of which 1 ms to minimize.
[2023-03-19 09:26:36] [INFO ] Deduced a trap composed of 64 places in 555 ms of which 1 ms to minimize.
[2023-03-19 09:26:37] [INFO ] Deduced a trap composed of 48 places in 705 ms of which 2 ms to minimize.
[2023-03-19 09:26:37] [INFO ] Deduced a trap composed of 91 places in 460 ms of which 2 ms to minimize.
[2023-03-19 09:26:38] [INFO ] Deduced a trap composed of 42 places in 412 ms of which 0 ms to minimize.
[2023-03-19 09:26:38] [INFO ] Deduced a trap composed of 46 places in 504 ms of which 1 ms to minimize.
[2023-03-19 09:26:39] [INFO ] Deduced a trap composed of 111 places in 467 ms of which 1 ms to minimize.
[2023-03-19 09:26:40] [INFO ] Deduced a trap composed of 44 places in 607 ms of which 1 ms to minimize.
[2023-03-19 09:26:40] [INFO ] Deduced a trap composed of 92 places in 550 ms of which 1 ms to minimize.
[2023-03-19 09:26:41] [INFO ] Deduced a trap composed of 92 places in 542 ms of which 2 ms to minimize.
[2023-03-19 09:26:41] [INFO ] Deduced a trap composed of 60 places in 442 ms of which 1 ms to minimize.
[2023-03-19 09:26:42] [INFO ] Deduced a trap composed of 64 places in 437 ms of which 1 ms to minimize.
[2023-03-19 09:26:42] [INFO ] Deduced a trap composed of 112 places in 523 ms of which 1 ms to minimize.
[2023-03-19 09:26:43] [INFO ] Deduced a trap composed of 60 places in 514 ms of which 1 ms to minimize.
[2023-03-19 09:26:43] [INFO ] Deduced a trap composed of 92 places in 375 ms of which 1 ms to minimize.
[2023-03-19 09:26:44] [INFO ] Deduced a trap composed of 80 places in 351 ms of which 1 ms to minimize.
[2023-03-19 09:26:44] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 27033 ms
[2023-03-19 09:26:44] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 81 ms.
[2023-03-19 09:26:53] [INFO ] Deduced a trap composed of 76 places in 453 ms of which 1 ms to minimize.
[2023-03-19 09:26:53] [INFO ] Deduced a trap composed of 80 places in 357 ms of which 1 ms to minimize.
[2023-03-19 09:26:54] [INFO ] Deduced a trap composed of 76 places in 343 ms of which 1 ms to minimize.
[2023-03-19 09:26:54] [INFO ] Deduced a trap composed of 76 places in 352 ms of which 1 ms to minimize.
[2023-03-19 09:26:56] [INFO ] Deduced a trap composed of 60 places in 567 ms of which 4 ms to minimize.
[2023-03-19 09:26:56] [INFO ] Deduced a trap composed of 92 places in 360 ms of which 2 ms to minimize.
[2023-03-19 09:26:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4356 ms
[2023-03-19 09:26:57] [INFO ] Added : 319 causal constraints over 65 iterations in 12881 ms. Result :sat
Minimization took 727 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 24 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 23 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-19 09:26:58] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:26:58] [INFO ] Invariant cache hit.
[2023-03-19 09:26:59] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-19 09:26:59] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:26:59] [INFO ] Invariant cache hit.
[2023-03-19 09:27:00] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:27:04] [INFO ] Implicit Places using invariants and state equation in 4540 ms returned []
Implicit Place search using SMT with State Equation took 5209 ms to find 0 implicit places.
[2023-03-19 09:27:04] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-19 09:27:04] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:27:04] [INFO ] Invariant cache hit.
[2023-03-19 09:27:05] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6586 ms. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2023-03-19 09:27:05] [INFO ] Computed 20 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 8330 ms. (steps per millisecond=120 ) properties (out of 1) seen :6
Finished Best-First random walk after 792258 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=158 )
[2023-03-19 09:27:18] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2023-03-19 09:27:18] [INFO ] Computed 20 place invariants in 17 ms
[2023-03-19 09:27:19] [INFO ] [Real]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-19 09:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 09:27:19] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2023-03-19 09:27:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 09:27:19] [INFO ] [Nat]Absence check using 20 positive place invariants in 21 ms returned sat
[2023-03-19 09:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 09:27:20] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2023-03-19 09:27:20] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:27:20] [INFO ] [Nat]Added 330 Read/Feed constraints in 500 ms returned sat
[2023-03-19 09:27:21] [INFO ] Deduced a trap composed of 37 places in 498 ms of which 2 ms to minimize.
[2023-03-19 09:27:21] [INFO ] Deduced a trap composed of 44 places in 531 ms of which 1 ms to minimize.
[2023-03-19 09:27:22] [INFO ] Deduced a trap composed of 16 places in 516 ms of which 1 ms to minimize.
[2023-03-19 09:27:23] [INFO ] Deduced a trap composed of 18 places in 532 ms of which 1 ms to minimize.
[2023-03-19 09:27:23] [INFO ] Deduced a trap composed of 12 places in 742 ms of which 2 ms to minimize.
[2023-03-19 09:27:24] [INFO ] Deduced a trap composed of 12 places in 539 ms of which 1 ms to minimize.
[2023-03-19 09:27:25] [INFO ] Deduced a trap composed of 18 places in 537 ms of which 1 ms to minimize.
[2023-03-19 09:27:25] [INFO ] Deduced a trap composed of 12 places in 493 ms of which 1 ms to minimize.
[2023-03-19 09:27:26] [INFO ] Deduced a trap composed of 18 places in 727 ms of which 1 ms to minimize.
[2023-03-19 09:27:27] [INFO ] Deduced a trap composed of 52 places in 526 ms of which 1 ms to minimize.
[2023-03-19 09:27:27] [INFO ] Deduced a trap composed of 40 places in 504 ms of which 1 ms to minimize.
[2023-03-19 09:27:28] [INFO ] Deduced a trap composed of 34 places in 501 ms of which 1 ms to minimize.
[2023-03-19 09:27:28] [INFO ] Deduced a trap composed of 76 places in 506 ms of which 1 ms to minimize.
[2023-03-19 09:27:29] [INFO ] Deduced a trap composed of 48 places in 503 ms of which 1 ms to minimize.
[2023-03-19 09:27:29] [INFO ] Deduced a trap composed of 32 places in 496 ms of which 1 ms to minimize.
[2023-03-19 09:27:30] [INFO ] Deduced a trap composed of 32 places in 511 ms of which 1 ms to minimize.
[2023-03-19 09:27:31] [INFO ] Deduced a trap composed of 91 places in 501 ms of which 0 ms to minimize.
[2023-03-19 09:27:31] [INFO ] Deduced a trap composed of 34 places in 668 ms of which 2 ms to minimize.
[2023-03-19 09:27:32] [INFO ] Deduced a trap composed of 34 places in 650 ms of which 1 ms to minimize.
[2023-03-19 09:27:33] [INFO ] Deduced a trap composed of 34 places in 664 ms of which 1 ms to minimize.
[2023-03-19 09:27:34] [INFO ] Deduced a trap composed of 55 places in 633 ms of which 1 ms to minimize.
[2023-03-19 09:27:34] [INFO ] Deduced a trap composed of 68 places in 530 ms of which 1 ms to minimize.
[2023-03-19 09:27:35] [INFO ] Deduced a trap composed of 60 places in 650 ms of which 1 ms to minimize.
[2023-03-19 09:27:35] [INFO ] Deduced a trap composed of 38 places in 642 ms of which 1 ms to minimize.
[2023-03-19 09:27:36] [INFO ] Deduced a trap composed of 74 places in 570 ms of which 1 ms to minimize.
[2023-03-19 09:27:37] [INFO ] Deduced a trap composed of 30 places in 699 ms of which 1 ms to minimize.
[2023-03-19 09:27:37] [INFO ] Deduced a trap composed of 64 places in 454 ms of which 3 ms to minimize.
[2023-03-19 09:27:38] [INFO ] Deduced a trap composed of 48 places in 663 ms of which 1 ms to minimize.
[2023-03-19 09:27:39] [INFO ] Deduced a trap composed of 91 places in 629 ms of which 2 ms to minimize.
[2023-03-19 09:27:39] [INFO ] Deduced a trap composed of 42 places in 603 ms of which 1 ms to minimize.
[2023-03-19 09:27:40] [INFO ] Deduced a trap composed of 46 places in 495 ms of which 1 ms to minimize.
[2023-03-19 09:27:41] [INFO ] Deduced a trap composed of 111 places in 642 ms of which 1 ms to minimize.
[2023-03-19 09:27:41] [INFO ] Deduced a trap composed of 44 places in 622 ms of which 1 ms to minimize.
[2023-03-19 09:27:42] [INFO ] Deduced a trap composed of 92 places in 515 ms of which 1 ms to minimize.
[2023-03-19 09:27:43] [INFO ] Deduced a trap composed of 92 places in 476 ms of which 1 ms to minimize.
[2023-03-19 09:27:43] [INFO ] Deduced a trap composed of 60 places in 378 ms of which 1 ms to minimize.
[2023-03-19 09:27:43] [INFO ] Deduced a trap composed of 64 places in 443 ms of which 1 ms to minimize.
[2023-03-19 09:27:44] [INFO ] Deduced a trap composed of 112 places in 445 ms of which 1 ms to minimize.
[2023-03-19 09:27:44] [INFO ] Deduced a trap composed of 60 places in 445 ms of which 1 ms to minimize.
[2023-03-19 09:27:45] [INFO ] Deduced a trap composed of 92 places in 375 ms of which 1 ms to minimize.
[2023-03-19 09:27:45] [INFO ] Deduced a trap composed of 80 places in 290 ms of which 1 ms to minimize.
[2023-03-19 09:27:45] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 25037 ms
[2023-03-19 09:27:45] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 116 ms.
[2023-03-19 09:27:54] [INFO ] Deduced a trap composed of 76 places in 458 ms of which 1 ms to minimize.
[2023-03-19 09:27:55] [INFO ] Deduced a trap composed of 80 places in 323 ms of which 1 ms to minimize.
[2023-03-19 09:27:55] [INFO ] Deduced a trap composed of 76 places in 359 ms of which 1 ms to minimize.
[2023-03-19 09:27:55] [INFO ] Deduced a trap composed of 76 places in 366 ms of which 2 ms to minimize.
[2023-03-19 09:27:57] [INFO ] Deduced a trap composed of 60 places in 450 ms of which 1 ms to minimize.
[2023-03-19 09:27:57] [INFO ] Deduced a trap composed of 92 places in 229 ms of which 1 ms to minimize.
[2023-03-19 09:27:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4161 ms
[2023-03-19 09:27:58] [INFO ] Added : 319 causal constraints over 65 iterations in 12470 ms. Result :sat
Minimization took 741 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 21 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 20 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2023-03-19 09:28:00] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:28:00] [INFO ] Invariant cache hit.
[2023-03-19 09:28:00] [INFO ] Implicit Places using invariants in 593 ms returned []
[2023-03-19 09:28:00] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:28:00] [INFO ] Invariant cache hit.
[2023-03-19 09:28:01] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-19 09:28:05] [INFO ] Implicit Places using invariants and state equation in 4380 ms returned []
Implicit Place search using SMT with State Equation took 4974 ms to find 0 implicit places.
[2023-03-19 09:28:05] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-19 09:28:05] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
[2023-03-19 09:28:05] [INFO ] Invariant cache hit.
[2023-03-19 09:28:06] [INFO ] Dead Transitions using invariants and state equation in 1666 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6727 ms. Remains : 735/735 places, 1442/1442 transitions.
Ending property specific reduction for Peterson-PT-6-UpperBounds-00 in 131255 ms.
[2023-03-19 09:28:07] [INFO ] Flatten gal took : 205 ms
[2023-03-19 09:28:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2023-03-19 09:28:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 735 places, 1442 transitions and 5082 arcs took 9 ms.
Total runtime 402216 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Peterson_PT_6
(NrP: 735 NrTr: 1442 NrArc: 5082)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.235sec

net check time: 0m 0.001sec

init dd package: 0m 3.549sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9992676 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16088692 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.013sec

430733 682123 891415

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="Peterson-PT-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Peterson-PT-6, 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 r266-smll-167863541200637"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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