Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 292K
-rw-r--r-- 1 mcc users 8.1K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 46K May 10 09:34 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-COL-6-UpperBounds-00
FORMULA_NAME Peterson-COL-6-UpperBounds-01
FORMULA_NAME Peterson-COL-6-UpperBounds-02
FORMULA_NAME Peterson-COL-6-UpperBounds-03
FORMULA_NAME Peterson-COL-6-UpperBounds-04
FORMULA_NAME Peterson-COL-6-UpperBounds-05
FORMULA_NAME Peterson-COL-6-UpperBounds-06
FORMULA_NAME Peterson-COL-6-UpperBounds-07
FORMULA_NAME Peterson-COL-6-UpperBounds-08
FORMULA_NAME Peterson-COL-6-UpperBounds-09
FORMULA_NAME Peterson-COL-6-UpperBounds-10
FORMULA_NAME Peterson-COL-6-UpperBounds-11
FORMULA_NAME Peterson-COL-6-UpperBounds-12
FORMULA_NAME Peterson-COL-6-UpperBounds-13
FORMULA_NAME Peterson-COL-6-UpperBounds-14
FORMULA_NAME Peterson-COL-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652775449763

Running Version 202205111006
[2022-05-17 08:17:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 08:17:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 08:17:31] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 08:17:31] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 08:17:31] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 582 ms
[2022-05-17 08:17:31] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2022-05-17 08:17:31] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2022-05-17 08:17:31] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 08:17:31] [INFO ] Computed 1 place invariants in 23 ms
FORMULA Peterson-COL-6-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-11 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-10 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 14 rows 9 cols
[2022-05-17 08:17:31] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-17 08:17:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 08:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 08:17:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-17 08:17:31] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 08:17:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 08:17:31] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-17 08:17:31] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Minimization took 3 ms.
[2022-05-17 08:17:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-17 08:17:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-17 08:17:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 08:17:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:17:32] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 08:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-17 08:17:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-17 08:17:32] [INFO ] Added : 11 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 08:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2022-05-17 08:17:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-17 08:17:32] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-17 08:17:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-17 08:17:32] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-17 08:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-17 08:17:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 08:17:32] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 08:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2022-05-17 08:17:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:17:32] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-17 08:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-17 08:17:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-17 08:17:32] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 4 ms.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-17 08:17:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-17 08:17:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-17 08:17:32] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-17 08:17:32] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7, 7, 7, 7, 7, 7, 7]
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2022-05-17 08:17:32] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 44 ms.
[2022-05-17 08:17:32] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Deduced a syphon composed of 42 places in 16 ms
Reduce places removed 42 places and 84 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 10) seen :49
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :26
FORMULA Peterson-COL-6-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :22
FORMULA Peterson-COL-6-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :23
FORMULA Peterson-COL-6-UpperBounds-15 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-14 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-6-UpperBounds-08 7 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2022-05-17 08:17:33] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 08:17:33] [INFO ] Computed 27 place invariants in 30 ms
[2022-05-17 08:17:33] [INFO ] [Real]Absence check using 20 positive place invariants in 31 ms returned sat
[2022-05-17 08:17:33] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 13 ms returned sat
[2022-05-17 08:17:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:34] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2022-05-17 08:17:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:17:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-05-17 08:17:34] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-05-17 08:17:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:34] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2022-05-17 08:17:34] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:17:34] [INFO ] [Nat]Added 330 Read/Feed constraints in 87 ms returned sat
[2022-05-17 08:17:35] [INFO ] Deduced a trap composed of 54 places in 540 ms of which 3 ms to minimize.
[2022-05-17 08:17:36] [INFO ] Deduced a trap composed of 12 places in 616 ms of which 2 ms to minimize.
[2022-05-17 08:17:36] [INFO ] Deduced a trap composed of 50 places in 453 ms of which 2 ms to minimize.
[2022-05-17 08:17:37] [INFO ] Deduced a trap composed of 31 places in 446 ms of which 2 ms to minimize.
[2022-05-17 08:17:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2553 ms
[2022-05-17 08:17:37] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 148 ms.
[2022-05-17 08:17:39] [INFO ] Added : 60 causal constraints over 12 iterations in 1670 ms. Result :unknown
[2022-05-17 08:17:39] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2022-05-17 08:17:39] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 9 ms returned sat
[2022-05-17 08:17:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:39] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2022-05-17 08:17:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:17:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2022-05-17 08:17:40] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 08:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:17:40] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
[2022-05-17 08:17:40] [INFO ] [Nat]Added 330 Read/Feed constraints in 82 ms returned sat
[2022-05-17 08:17:41] [INFO ] Deduced a trap composed of 54 places in 509 ms of which 1 ms to minimize.
[2022-05-17 08:17:41] [INFO ] Deduced a trap composed of 12 places in 434 ms of which 1 ms to minimize.
[2022-05-17 08:17:42] [INFO ] Deduced a trap composed of 50 places in 434 ms of which 1 ms to minimize.
[2022-05-17 08:17:42] [INFO ] Deduced a trap composed of 31 places in 459 ms of which 1 ms to minimize.
[2022-05-17 08:17:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2286 ms
[2022-05-17 08:17:42] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 112 ms.
[2022-05-17 08:17:45] [INFO ] Deduced a trap composed of 2 places in 639 ms of which 1 ms to minimize.
[2022-05-17 08:17:45] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
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) : [7, 7] Max seen :[2, 2]
Support contains 294 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1008 place count 826 transition count 1442
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1176 place count 742 transition count 1442
Applied a total of 1176 rules in 374 ms. Remains 742 /1330 variables (removed 588) and now considering 1442/2030 (removed 588) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/1330 places, 1442/2030 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 08:17:46] [INFO ] Computed 27 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 10132 ms. (steps per millisecond=98 ) properties (out of 2) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4643 ms. (steps per millisecond=215 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4968 ms. (steps per millisecond=201 ) properties (out of 2) seen :2
[2022-05-17 08:18:06] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 08:18:06] [INFO ] Computed 27 place invariants in 10 ms
[2022-05-17 08:18:06] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 08:18:06] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2022-05-17 08:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:06] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-17 08:18:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:18:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-05-17 08:18:06] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-17 08:18:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:07] [INFO ] [Nat]Absence check using state equation in 239 ms returned sat
[2022-05-17 08:18:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:18:07] [INFO ] [Nat]Added 330 Read/Feed constraints in 63 ms returned sat
[2022-05-17 08:18:07] [INFO ] Deduced a trap composed of 133 places in 249 ms of which 0 ms to minimize.
[2022-05-17 08:18:07] [INFO ] Deduced a trap composed of 88 places in 261 ms of which 0 ms to minimize.
[2022-05-17 08:18:08] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 1 ms to minimize.
[2022-05-17 08:18:08] [INFO ] Deduced a trap composed of 148 places in 240 ms of which 1 ms to minimize.
[2022-05-17 08:18:08] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 0 ms to minimize.
[2022-05-17 08:18:09] [INFO ] Deduced a trap composed of 60 places in 255 ms of which 1 ms to minimize.
[2022-05-17 08:18:09] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 0 ms to minimize.
[2022-05-17 08:18:09] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 1 ms to minimize.
[2022-05-17 08:18:10] [INFO ] Deduced a trap composed of 59 places in 244 ms of which 1 ms to minimize.
[2022-05-17 08:18:10] [INFO ] Deduced a trap composed of 111 places in 250 ms of which 1 ms to minimize.
[2022-05-17 08:18:10] [INFO ] Deduced a trap composed of 127 places in 247 ms of which 1 ms to minimize.
[2022-05-17 08:18:10] [INFO ] Deduced a trap composed of 72 places in 251 ms of which 0 ms to minimize.
[2022-05-17 08:18:11] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 1 ms to minimize.
[2022-05-17 08:18:11] [INFO ] Deduced a trap composed of 18 places in 249 ms of which 1 ms to minimize.
[2022-05-17 08:18:11] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 2 ms to minimize.
[2022-05-17 08:18:12] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 0 ms to minimize.
[2022-05-17 08:18:12] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 1 ms to minimize.
[2022-05-17 08:18:12] [INFO ] Deduced a trap composed of 54 places in 255 ms of which 0 ms to minimize.
[2022-05-17 08:18:12] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5481 ms
[2022-05-17 08:18:12] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 83 ms.
[2022-05-17 08:18:14] [INFO ] Added : 137 causal constraints over 28 iterations in 1952 ms. Result :sat
Minimization took 291 ms.
[2022-05-17 08:18:15] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-05-17 08:18:15] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2022-05-17 08:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:15] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-05-17 08:18:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:18:15] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 08:18:15] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 5 ms returned sat
[2022-05-17 08:18:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:15] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-05-17 08:18:15] [INFO ] [Nat]Added 330 Read/Feed constraints in 63 ms returned sat
[2022-05-17 08:18:16] [INFO ] Deduced a trap composed of 133 places in 248 ms of which 1 ms to minimize.
[2022-05-17 08:18:16] [INFO ] Deduced a trap composed of 88 places in 249 ms of which 0 ms to minimize.
[2022-05-17 08:18:16] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 1 ms to minimize.
[2022-05-17 08:18:17] [INFO ] Deduced a trap composed of 148 places in 238 ms of which 1 ms to minimize.
[2022-05-17 08:18:17] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 1 ms to minimize.
[2022-05-17 08:18:17] [INFO ] Deduced a trap composed of 60 places in 244 ms of which 0 ms to minimize.
[2022-05-17 08:18:17] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 1 ms to minimize.
[2022-05-17 08:18:18] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 0 ms to minimize.
[2022-05-17 08:18:18] [INFO ] Deduced a trap composed of 59 places in 259 ms of which 0 ms to minimize.
[2022-05-17 08:18:18] [INFO ] Deduced a trap composed of 111 places in 255 ms of which 0 ms to minimize.
[2022-05-17 08:18:19] [INFO ] Deduced a trap composed of 127 places in 254 ms of which 1 ms to minimize.
[2022-05-17 08:18:19] [INFO ] Deduced a trap composed of 72 places in 251 ms of which 1 ms to minimize.
[2022-05-17 08:18:19] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 1 ms to minimize.
[2022-05-17 08:18:20] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 0 ms to minimize.
[2022-05-17 08:18:20] [INFO ] Deduced a trap composed of 37 places in 254 ms of which 1 ms to minimize.
[2022-05-17 08:18:20] [INFO ] Deduced a trap composed of 55 places in 253 ms of which 1 ms to minimize.
[2022-05-17 08:18:20] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 1 ms to minimize.
[2022-05-17 08:18:21] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 1 ms to minimize.
[2022-05-17 08:18:21] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 5459 ms
[2022-05-17 08:18:21] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 79 ms.
[2022-05-17 08:18:23] [INFO ] Added : 137 causal constraints over 28 iterations in 1933 ms. Result :sat
Minimization took 286 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[6, 6]
Support contains 294 out of 742 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 34 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/742 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 31 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 08:18:24] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-05-17 08:18:24] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 08:18:24] [INFO ] Implicit Places using invariants in 287 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 296 ms to find 7 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 735/742 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.
Finished structural reductions, in 2 iterations. Remains : 735/742 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:18:24] [INFO ] Computed 20 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11187 ms. (steps per millisecond=89 ) properties (out of 2) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4234 ms. (steps per millisecond=236 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4212 ms. (steps per millisecond=237 ) properties (out of 2) seen :2
[2022-05-17 08:18:44] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:18:44] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 08:18:44] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 08:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:44] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2022-05-17 08:18:44] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:18:44] [INFO ] [Real]Added 330 Read/Feed constraints in 42 ms returned sat
[2022-05-17 08:18:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:18:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-05-17 08:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:45] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2022-05-17 08:18:45] [INFO ] [Nat]Added 330 Read/Feed constraints in 56 ms returned sat
[2022-05-17 08:18:45] [INFO ] Deduced a trap composed of 37 places in 263 ms of which 1 ms to minimize.
[2022-05-17 08:18:45] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 0 ms to minimize.
[2022-05-17 08:18:46] [INFO ] Deduced a trap composed of 47 places in 260 ms of which 0 ms to minimize.
[2022-05-17 08:18:46] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 0 ms to minimize.
[2022-05-17 08:18:46] [INFO ] Deduced a trap composed of 136 places in 257 ms of which 1 ms to minimize.
[2022-05-17 08:18:46] [INFO ] Deduced a trap composed of 101 places in 265 ms of which 2 ms to minimize.
[2022-05-17 08:18:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1848 ms
[2022-05-17 08:18:47] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 62 ms.
[2022-05-17 08:18:47] [INFO ] Added : 44 causal constraints over 9 iterations in 754 ms. Result :sat
Minimization took 163 ms.
[2022-05-17 08:18:48] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 08:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:48] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2022-05-17 08:18:48] [INFO ] [Real]Added 330 Read/Feed constraints in 41 ms returned sat
[2022-05-17 08:18:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:18:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-17 08:18:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:48] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2022-05-17 08:18:48] [INFO ] [Nat]Added 330 Read/Feed constraints in 57 ms returned sat
[2022-05-17 08:18:49] [INFO ] Deduced a trap composed of 37 places in 256 ms of which 0 ms to minimize.
[2022-05-17 08:18:49] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 1 ms to minimize.
[2022-05-17 08:18:49] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 0 ms to minimize.
[2022-05-17 08:18:50] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 0 ms to minimize.
[2022-05-17 08:18:50] [INFO ] Deduced a trap composed of 136 places in 242 ms of which 0 ms to minimize.
[2022-05-17 08:18:50] [INFO ] Deduced a trap composed of 101 places in 246 ms of which 0 ms to minimize.
[2022-05-17 08:18:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1825 ms
[2022-05-17 08:18:50] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 61 ms.
[2022-05-17 08:18:51] [INFO ] Added : 44 causal constraints over 9 iterations in 674 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [7, 7] Max seen :[6, 6]
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 19 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 08:18:52] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:18:52] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 08:18:52] [INFO ] Implicit Places using invariants in 367 ms returned []
[2022-05-17 08:18:52] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:18:52] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 08:18:52] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:18:54] [INFO ] Implicit Places using invariants and state equation in 2403 ms returned []
Implicit Place search using SMT with State Equation took 2792 ms to find 0 implicit places.
[2022-05-17 08:18:54] [INFO ] Redundant transitions in 94 ms returned []
[2022-05-17 08:18:54] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:18:54] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 08:18:55] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting property specific reduction for Peterson-COL-6-UpperBounds-03
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:18:55] [INFO ] Computed 20 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :2
[2022-05-17 08:18:55] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:18:55] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 08:18:55] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2022-05-17 08:18:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:55] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2022-05-17 08:18:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:18:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 08:18:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:18:56] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-05-17 08:18:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:18:56] [INFO ] [Nat]Added 330 Read/Feed constraints in 53 ms returned sat
[2022-05-17 08:18:56] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 1 ms to minimize.
[2022-05-17 08:18:56] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 0 ms to minimize.
[2022-05-17 08:18:57] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 0 ms to minimize.
[2022-05-17 08:18:57] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 1 ms to minimize.
[2022-05-17 08:18:57] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 0 ms to minimize.
[2022-05-17 08:18:57] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 0 ms to minimize.
[2022-05-17 08:18:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1728 ms
[2022-05-17 08:18:58] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 66 ms.
[2022-05-17 08:18:58] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 1 ms to minimize.
[2022-05-17 08:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 330 ms
[2022-05-17 08:18:59] [INFO ] Added : 40 causal constraints over 9 iterations in 1068 ms. Result :sat
Minimization took 266 ms.
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 SAFETY 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 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:18:59] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6393 ms. (steps per millisecond=156 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3761 ms. (steps per millisecond=265 ) properties (out of 1) seen :4
[2022-05-17 08:19:09] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:09] [INFO ] Computed 20 place invariants in 12 ms
[2022-05-17 08:19:09] [INFO ] [Real]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-17 08:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:19:10] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2022-05-17 08:19:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:19:10] [INFO ] [Real]Added 330 Read/Feed constraints in 39 ms returned sat
[2022-05-17 08:19:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:19:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-17 08:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:19:10] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2022-05-17 08:19:10] [INFO ] [Nat]Added 330 Read/Feed constraints in 56 ms returned sat
[2022-05-17 08:19:10] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 1 ms to minimize.
[2022-05-17 08:19:11] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 2 ms to minimize.
[2022-05-17 08:19:11] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 2 ms to minimize.
[2022-05-17 08:19:11] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 5 ms to minimize.
[2022-05-17 08:19:12] [INFO ] Deduced a trap composed of 136 places in 289 ms of which 1 ms to minimize.
[2022-05-17 08:19:12] [INFO ] Deduced a trap composed of 101 places in 250 ms of which 1 ms to minimize.
[2022-05-17 08:19:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1914 ms
[2022-05-17 08:19:12] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 58 ms.
[2022-05-17 08:19:13] [INFO ] Added : 44 causal constraints over 9 iterations in 681 ms. Result :sat
Minimization took 145 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 SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 29 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 16 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 08:19:13] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:13] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 08:19:13] [INFO ] Implicit Places using invariants in 267 ms returned []
[2022-05-17 08:19:13] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:13] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 08:19:14] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:19:16] [INFO ] Implicit Places using invariants and state equation in 2397 ms returned []
Implicit Place search using SMT with State Equation took 2686 ms to find 0 implicit places.
[2022-05-17 08:19:16] [INFO ] Redundant transitions in 18 ms returned []
[2022-05-17 08:19:16] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:16] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 08:19:16] [INFO ] Dead Transitions using invariants and state equation in 535 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Ending property specific reduction for Peterson-COL-6-UpperBounds-03 in 21476 ms.
Starting property specific reduction for Peterson-COL-6-UpperBounds-13
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:16] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :1
[2022-05-17 08:19:17] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:17] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 08:19:17] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 08:19:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:19:17] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2022-05-17 08:19:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:19:17] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-17 08:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:19:17] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2022-05-17 08:19:17] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:19:17] [INFO ] [Nat]Added 330 Read/Feed constraints in 52 ms returned sat
[2022-05-17 08:19:18] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 0 ms to minimize.
[2022-05-17 08:19:18] [INFO ] Deduced a trap composed of 14 places in 249 ms of which 1 ms to minimize.
[2022-05-17 08:19:18] [INFO ] Deduced a trap composed of 41 places in 258 ms of which 0 ms to minimize.
[2022-05-17 08:19:19] [INFO ] Deduced a trap composed of 18 places in 255 ms of which 0 ms to minimize.
[2022-05-17 08:19:19] [INFO ] Deduced a trap composed of 45 places in 244 ms of which 1 ms to minimize.
[2022-05-17 08:19:19] [INFO ] Deduced a trap composed of 50 places in 209 ms of which 0 ms to minimize.
[2022-05-17 08:19:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1739 ms
[2022-05-17 08:19:19] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 59 ms.
[2022-05-17 08:19:20] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 0 ms to minimize.
[2022-05-17 08:19:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 325 ms
[2022-05-17 08:19:20] [INFO ] Added : 40 causal constraints over 9 iterations in 1003 ms. Result :sat
Minimization took 246 ms.
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 SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 16 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:21] [INFO ] Computed 20 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6096 ms. (steps per millisecond=164 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3687 ms. (steps per millisecond=271 ) properties (out of 1) seen :3
[2022-05-17 08:19:30] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:30] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-17 08:19:30] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 08:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 08:19:31] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2022-05-17 08:19:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:19:31] [INFO ] [Real]Added 330 Read/Feed constraints in 38 ms returned sat
[2022-05-17 08:19:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 08:19:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 11 ms returned sat
[2022-05-17 08:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 08:19:31] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2022-05-17 08:19:31] [INFO ] [Nat]Added 330 Read/Feed constraints in 60 ms returned sat
[2022-05-17 08:19:32] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 0 ms to minimize.
[2022-05-17 08:19:32] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2022-05-17 08:19:32] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 0 ms to minimize.
[2022-05-17 08:19:32] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 1 ms to minimize.
[2022-05-17 08:19:33] [INFO ] Deduced a trap composed of 136 places in 245 ms of which 0 ms to minimize.
[2022-05-17 08:19:33] [INFO ] Deduced a trap composed of 101 places in 242 ms of which 1 ms to minimize.
[2022-05-17 08:19:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1796 ms
[2022-05-17 08:19:33] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 67 ms.
[2022-05-17 08:19:34] [INFO ] Added : 44 causal constraints over 9 iterations in 705 ms. Result :sat
Minimization took 158 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 SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 15 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 19 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 08:19:34] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:34] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 08:19:34] [INFO ] Implicit Places using invariants in 257 ms returned []
[2022-05-17 08:19:34] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:34] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 08:19:35] [INFO ] State equation strengthened by 330 read => feed constraints.
[2022-05-17 08:19:37] [INFO ] Implicit Places using invariants and state equation in 2390 ms returned []
Implicit Place search using SMT with State Equation took 2648 ms to find 0 implicit places.
[2022-05-17 08:19:37] [INFO ] Redundant transitions in 89 ms returned []
[2022-05-17 08:19:37] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 08:19:37] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-17 08:19:37] [INFO ] Dead Transitions using invariants and state equation in 478 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Ending property specific reduction for Peterson-COL-6-UpperBounds-13 in 20952 ms.
[2022-05-17 08:19:38] [INFO ] Flatten gal took : 115 ms
[2022-05-17 08:19:38] [INFO ] Applying decomposition
[2022-05-17 08:19:38] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17923160700418962188.txt' '-o' '/tmp/graph17923160700418962188.bin' '-w' '/tmp/graph17923160700418962188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17923160700418962188.bin' '-l' '-1' '-v' '-w' '/tmp/graph17923160700418962188.weights' '-q' '0' '-e' '0.001'
[2022-05-17 08:19:38] [INFO ] Decomposing Gal with order
[2022-05-17 08:19:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:19:38] [INFO ] Removed a total of 2000 redundant transitions.
[2022-05-17 08:19:38] [INFO ] Flatten gal took : 136 ms
[2022-05-17 08:19:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 50 ms.
[2022-05-17 08:19:38] [INFO ] Time to serialize gal into /tmp/UpperBounds2326400408691509834.gal : 21 ms
[2022-05-17 08:19:38] [INFO ] Time to serialize properties into /tmp/UpperBounds10021357258423321466.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds2326400408691509834.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10021357258423321466.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds10021357258423321466.prop.
Detected timeout of ITS tools.
[2022-05-17 08:41:09] [INFO ] Applying decomposition
[2022-05-17 08:41:09] [INFO ] Flatten gal took : 334 ms
[2022-05-17 08:41:09] [INFO ] Decomposing Gal with order
[2022-05-17 08:41:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 08:41:10] [INFO ] Removed a total of 2121 redundant transitions.
[2022-05-17 08:41:10] [INFO ] Flatten gal took : 392 ms
[2022-05-17 08:41:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 47 ms.
[2022-05-17 08:41:10] [INFO ] Time to serialize gal into /tmp/UpperBounds13968394528662506644.gal : 44 ms
[2022-05-17 08:41:10] [INFO ] Time to serialize properties into /tmp/UpperBounds226377744643493630.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13968394528662506644.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds226377744643493630.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds226377744643493630.prop.
Detected timeout of ITS tools.
[2022-05-17 09:02:20] [INFO ] Flatten gal took : 406 ms
[2022-05-17 09:02:22] [INFO ] Input system was already deterministic with 1442 transitions.
[2022-05-17 09:02:31] [INFO ] Transformed 735 places.
[2022-05-17 09:02:31] [INFO ] Transformed 1442 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 09:02:33] [INFO ] Time to serialize gal into /tmp/UpperBounds524667280857335784.gal : 66 ms
[2022-05-17 09:02:33] [INFO ] Time to serialize properties into /tmp/UpperBounds13535007896205626105.prop : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds524667280857335784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13535007896205626105.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13535007896205626105.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-COL-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 r168-tall-165277016100037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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