About the Execution of 2022-gold for Peterson-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16208.644 | 3600000.00 | 3112692.00 | 185483.50 | 6 5 6 ? 6 6 6 6 6 6 6 6 6 5 6 6 | normal |
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.r287-smll-167863553800073.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 gold2022
Input is Peterson-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-167863553800073
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.9K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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 4.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 45K 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-COL-5-UpperBounds-00
FORMULA_NAME Peterson-COL-5-UpperBounds-01
FORMULA_NAME Peterson-COL-5-UpperBounds-02
FORMULA_NAME Peterson-COL-5-UpperBounds-03
FORMULA_NAME Peterson-COL-5-UpperBounds-04
FORMULA_NAME Peterson-COL-5-UpperBounds-05
FORMULA_NAME Peterson-COL-5-UpperBounds-06
FORMULA_NAME Peterson-COL-5-UpperBounds-07
FORMULA_NAME Peterson-COL-5-UpperBounds-08
FORMULA_NAME Peterson-COL-5-UpperBounds-09
FORMULA_NAME Peterson-COL-5-UpperBounds-10
FORMULA_NAME Peterson-COL-5-UpperBounds-11
FORMULA_NAME Peterson-COL-5-UpperBounds-12
FORMULA_NAME Peterson-COL-5-UpperBounds-13
FORMULA_NAME Peterson-COL-5-UpperBounds-14
FORMULA_NAME Peterson-COL-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678918436133
Running Version 202205111006
[2023-03-15 22:13:58] [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]
[2023-03-15 22:13:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:13:59] [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.
[2023-03-15 22:13:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 22:14:00] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1531 ms
[2023-03-15 22:14:00] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 34 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
[2023-03-15 22:14:00] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 9 ms.
[2023-03-15 22:14:00] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2023-03-15 22:14:00] [INFO ] Computed 1 place invariants in 9 ms
FORMULA Peterson-COL-5-UpperBounds-14 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 14 rows 9 cols
[2023-03-15 22:14:00] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-15 22:14:00] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-15 22:14:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:00] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-15 22:14:00] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-15 22:14:01] [INFO ] Added : 0 causal constraints over 0 iterations in 25 ms. Result :sat
Minimization took 11 ms.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-15 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-15 22:14:01] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-15 22:14:01] [INFO ] Added : 11 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-15 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-15 22:14:01] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 22:14:01] [INFO ] Added : 11 causal constraints over 4 iterations in 31 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-15 22:14:01] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 22:14:01] [INFO ] Added : 11 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 22:14:01] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 22:14:01] [INFO ] Added : 11 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-15 22:14:01] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 22:14:01] [INFO ] Added : 11 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 22:14:01] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 22:14:01] [INFO ] Added : 11 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:14:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-15 22:14:02] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 22:14:02] [INFO ] Added : 11 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 8 ms.
[2023-03-15 22:14:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-15 22:14:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:14:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 22:14:02] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-15 22:14:02] [INFO ] Added : 11 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 22:14:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:02] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-15 22:14:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:14:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-15 22:14:02] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-15 22:14:02] [INFO ] Added : 11 causal constraints over 4 iterations in 29 ms. Result :sat
Minimization took 10 ms.
[2023-03-15 22:14:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-15 22:14:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:14:02] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-15 22:14:02] [INFO ] Added : 11 causal constraints over 4 iterations in 20 ms. Result :sat
Minimization took 9 ms.
[2023-03-15 22:14:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 22:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-15 22:14:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-15 22:14:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:02] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-15 22:14:02] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-15 22:14:02] [INFO ] Added : 11 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6]
Domain [Process(6), Tour(5), Process(6)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 5)]] 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.
[2023-03-15 22:14:02] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions 4068 arcs in 83 ms.
[2023-03-15 22:14:02] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Deduced a syphon composed of 30 places in 29 ms
Reduce places removed 30 places and 60 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 12) seen :59
FORMULA Peterson-COL-5-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :11
FORMULA Peterson-COL-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :32
FORMULA Peterson-COL-5-UpperBounds-10 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-09 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-15 22:14:03] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 22:14:03] [INFO ] Computed 23 place invariants in 29 ms
[2023-03-15 22:14:03] [INFO ] [Real]Absence check using 17 positive place invariants in 33 ms returned sat
[2023-03-15 22:14:03] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2023-03-15 22:14:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:04] [INFO ] [Real]Absence check using state equation in 756 ms returned sat
[2023-03-15 22:14:04] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 22:14:04] [INFO ] [Real]Added 205 Read/Feed constraints in 55 ms returned sat
[2023-03-15 22:14:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 36 ms returned sat
[2023-03-15 22:14:04] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 13 ms returned sat
[2023-03-15 22:14:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:05] [INFO ] [Nat]Absence check using state equation in 688 ms returned sat
[2023-03-15 22:14:05] [INFO ] [Nat]Added 205 Read/Feed constraints in 84 ms returned sat
[2023-03-15 22:14:06] [INFO ] Deduced a trap composed of 74 places in 694 ms of which 7 ms to minimize.
[2023-03-15 22:14:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 948 ms
[2023-03-15 22:14:06] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 209 ms.
[2023-03-15 22:14:09] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
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)
[2023-03-15 22:14:09] [INFO ] [Real]Absence check using 17 positive place invariants in 35 ms returned sat
[2023-03-15 22:14:09] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2023-03-15 22:14:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:10] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2023-03-15 22:14:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2023-03-15 22:14:10] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-15 22:14:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:11] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2023-03-15 22:14:11] [INFO ] [Nat]Added 205 Read/Feed constraints in 113 ms returned sat
[2023-03-15 22:14:12] [INFO ] Deduced a trap composed of 19 places in 752 ms of which 3 ms to minimize.
[2023-03-15 22:14:13] [INFO ] Deduced a trap composed of 19 places in 820 ms of which 3 ms to minimize.
[2023-03-15 22:14:14] [INFO ] Deduced a trap composed of 22 places in 819 ms of which 2 ms to minimize.
[2023-03-15 22:14:14] [INFO ] Deduced a trap composed of 18 places in 798 ms of which 2 ms to minimize.
[2023-03-15 22:14:15] [INFO ] Deduced a trap composed of 51 places in 761 ms of which 2 ms to minimize.
[2023-03-15 22:14:15] [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.verifyPossible(DeadlockTester.java:918)
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) : [6, 6] Max seen :[2, 3]
Support contains 210 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 150 transitions
Trivial Post-agglo rules discarded 150 transitions
Performed 150 trivial Post agglomeration. Transition count delta: 150
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 834 transition count 1092
Reduce places removed 150 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 300 rules applied. Total rules applied 450 place count 684 transition count 942
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 600 place count 534 transition count 942
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 600 place count 534 transition count 912
Deduced a syphon composed of 30 places in 4 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 660 place count 504 transition count 912
Applied a total of 660 rules in 238 ms. Remains 504 /834 variables (removed 330) and now considering 912/1242 (removed 330) transitions.
Finished structural reductions, in 1 iterations. Remains : 504/834 places, 912/1242 transitions.
Normalized transition count is 792 out of 912 initially.
// Phase 1: matrix 792 rows 504 cols
[2023-03-15 22:14:16] [INFO ] Computed 23 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6158 ms. (steps per millisecond=162 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3825 ms. (steps per millisecond=261 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1424 ms. (steps per millisecond=702 ) properties (out of 2) seen :6
[2023-03-15 22:14:27] [INFO ] Flow matrix only has 792 transitions (discarded 120 similar events)
// Phase 1: matrix 792 rows 504 cols
[2023-03-15 22:14:27] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 22:14:27] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-03-15 22:14:27] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-15 22:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:27] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2023-03-15 22:14:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 22:14:28] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-15 22:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:28] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-15 22:14:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 22:14:28] [INFO ] [Nat]Added 205 Read/Feed constraints in 58 ms returned sat
[2023-03-15 22:14:28] [INFO ] Deduced a trap composed of 11 places in 421 ms of which 1 ms to minimize.
[2023-03-15 22:14:29] [INFO ] Deduced a trap composed of 9 places in 419 ms of which 3 ms to minimize.
[2023-03-15 22:14:29] [INFO ] Deduced a trap composed of 88 places in 340 ms of which 1 ms to minimize.
[2023-03-15 22:14:30] [INFO ] Deduced a trap composed of 84 places in 437 ms of which 1 ms to minimize.
[2023-03-15 22:14:30] [INFO ] Deduced a trap composed of 52 places in 491 ms of which 2 ms to minimize.
[2023-03-15 22:14:31] [INFO ] Deduced a trap composed of 38 places in 503 ms of which 3 ms to minimize.
[2023-03-15 22:14:31] [INFO ] Deduced a trap composed of 76 places in 485 ms of which 1 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Deduced a trap composed of 95 places in 466 ms of which 1 ms to minimize.
[2023-03-15 22:14:32] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4019 ms
[2023-03-15 22:14:32] [INFO ] Computed and/alt/rep : 726/1662/726 causal constraints (skipped 60 transitions) in 110 ms.
[2023-03-15 22:14:35] [INFO ] Deduced a trap composed of 15 places in 496 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 38 places in 499 ms of which 1 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Deduced a trap composed of 9 places in 488 ms of which 2 ms to minimize.
[2023-03-15 22:14:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1781 ms
[2023-03-15 22:14:37] [INFO ] Added : 143 causal constraints over 29 iterations in 4619 ms. Result :sat
Minimization took 359 ms.
[2023-03-15 22:14:37] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-15 22:14:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-15 22:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:38] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2023-03-15 22:14:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-15 22:14:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-15 22:14:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:38] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2023-03-15 22:14:38] [INFO ] [Nat]Added 205 Read/Feed constraints in 100 ms returned sat
[2023-03-15 22:14:39] [INFO ] Deduced a trap composed of 11 places in 427 ms of which 2 ms to minimize.
[2023-03-15 22:14:39] [INFO ] Deduced a trap composed of 11 places in 435 ms of which 2 ms to minimize.
[2023-03-15 22:14:40] [INFO ] Deduced a trap composed of 15 places in 481 ms of which 1 ms to minimize.
[2023-03-15 22:14:40] [INFO ] Deduced a trap composed of 11 places in 459 ms of which 1 ms to minimize.
[2023-03-15 22:14:41] [INFO ] Deduced a trap composed of 12 places in 406 ms of which 1 ms to minimize.
[2023-03-15 22:14:41] [INFO ] Deduced a trap composed of 11 places in 457 ms of which 1 ms to minimize.
[2023-03-15 22:14:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 2961 ms
Current structural bounds on expressions (after SMT) : [6, 5] Max seen :[5, 5]
FORMULA Peterson-COL-5-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 180 out of 504 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 504/504 places, 912/912 transitions.
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 30 Pre rules applied. Total rules applied 0 place count 504 transition count 882
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 474 transition count 882
Applied a total of 60 rules in 81 ms. Remains 474 /504 variables (removed 30) and now considering 882/912 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/504 places, 882/912 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 474 cols
[2023-03-15 22:14:42] [INFO ] Computed 23 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5420 ms. (steps per millisecond=184 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3418 ms. (steps per millisecond=292 ) properties (out of 1) seen :2
[2023-03-15 22:14:51] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 474 cols
[2023-03-15 22:14:51] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-15 22:14:51] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-03-15 22:14:51] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-15 22:14:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:51] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2023-03-15 22:14:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:14:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-15 22:14:51] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-15 22:14:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:14:52] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2023-03-15 22:14:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 22:14:52] [INFO ] [Nat]Added 205 Read/Feed constraints in 84 ms returned sat
[2023-03-15 22:14:52] [INFO ] Deduced a trap composed of 19 places in 406 ms of which 1 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 9 places in 441 ms of which 1 ms to minimize.
[2023-03-15 22:14:53] [INFO ] Deduced a trap composed of 21 places in 446 ms of which 1 ms to minimize.
[2023-03-15 22:14:54] [INFO ] Deduced a trap composed of 11 places in 527 ms of which 1 ms to minimize.
[2023-03-15 22:14:54] [INFO ] Deduced a trap composed of 49 places in 526 ms of which 1 ms to minimize.
[2023-03-15 22:14:55] [INFO ] Deduced a trap composed of 54 places in 509 ms of which 1 ms to minimize.
[2023-03-15 22:14:56] [INFO ] Deduced a trap composed of 51 places in 487 ms of which 1 ms to minimize.
[2023-03-15 22:14:56] [INFO ] Deduced a trap composed of 35 places in 494 ms of which 1 ms to minimize.
[2023-03-15 22:14:57] [INFO ] Deduced a trap composed of 43 places in 485 ms of which 1 ms to minimize.
[2023-03-15 22:14:57] [INFO ] Deduced a trap composed of 61 places in 475 ms of which 1 ms to minimize.
[2023-03-15 22:14:58] [INFO ] Deduced a trap composed of 58 places in 478 ms of which 1 ms to minimize.
[2023-03-15 22:14:58] [INFO ] Deduced a trap composed of 157 places in 419 ms of which 1 ms to minimize.
[2023-03-15 22:14:59] [INFO ] Deduced a trap composed of 156 places in 469 ms of which 1 ms to minimize.
[2023-03-15 22:14:59] [INFO ] Deduced a trap composed of 14 places in 506 ms of which 1 ms to minimize.
[2023-03-15 22:15:00] [INFO ] Deduced a trap composed of 95 places in 477 ms of which 2 ms to minimize.
[2023-03-15 22:15:00] [INFO ] Deduced a trap composed of 92 places in 473 ms of which 1 ms to minimize.
[2023-03-15 22:15:01] [INFO ] Deduced a trap composed of 99 places in 471 ms of which 2 ms to minimize.
[2023-03-15 22:15:01] [INFO ] Deduced a trap composed of 74 places in 483 ms of which 1 ms to minimize.
[2023-03-15 22:15:02] [INFO ] Deduced a trap composed of 55 places in 319 ms of which 1 ms to minimize.
[2023-03-15 22:15:02] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 9934 ms
[2023-03-15 22:15:02] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 109 ms.
[2023-03-15 22:15:04] [INFO ] Deduced a trap composed of 30 places in 529 ms of which 1 ms to minimize.
[2023-03-15 22:15:05] [INFO ] Deduced a trap composed of 118 places in 449 ms of which 2 ms to minimize.
[2023-03-15 22:15:05] [INFO ] Deduced a trap composed of 54 places in 429 ms of which 1 ms to minimize.
[2023-03-15 22:15:06] [INFO ] Deduced a trap composed of 82 places in 483 ms of which 1 ms to minimize.
[2023-03-15 22:15:06] [INFO ] Deduced a trap composed of 106 places in 484 ms of which 1 ms to minimize.
[2023-03-15 22:15:07] [INFO ] Deduced a trap composed of 94 places in 473 ms of which 1 ms to minimize.
[2023-03-15 22:15:08] [INFO ] Deduced a trap composed of 78 places in 479 ms of which 1 ms to minimize.
[2023-03-15 22:15:08] [INFO ] Deduced a trap composed of 53 places in 410 ms of which 1 ms to minimize.
[2023-03-15 22:15:09] [INFO ] Deduced a trap composed of 24 places in 454 ms of which 1 ms to minimize.
[2023-03-15 22:15:09] [INFO ] Deduced a trap composed of 111 places in 476 ms of which 2 ms to minimize.
[2023-03-15 22:15:10] [INFO ] Deduced a trap composed of 35 places in 483 ms of which 2 ms to minimize.
[2023-03-15 22:15:10] [INFO ] Deduced a trap composed of 13 places in 434 ms of which 1 ms to minimize.
[2023-03-15 22:15:11] [INFO ] Deduced a trap composed of 61 places in 394 ms of which 1 ms to minimize.
[2023-03-15 22:15:11] [INFO ] Deduced a trap composed of 83 places in 329 ms of which 1 ms to minimize.
[2023-03-15 22:15:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 7626 ms
[2023-03-15 22:15:12] [INFO ] Added : 136 causal constraints over 28 iterations in 10162 ms. Result :sat
Minimization took 429 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 180 out of 474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 882/882 transitions.
Applied a total of 0 rules in 46 ms. Remains 474 /474 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 474/474 places, 882/882 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 474/474 places, 882/882 transitions.
Applied a total of 0 rules in 39 ms. Remains 474 /474 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2023-03-15 22:15:13] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 474 cols
[2023-03-15 22:15:13] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 22:15:13] [INFO ] Implicit Places using invariants in 418 ms returned [0, 1, 2, 3, 4, 5]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 425 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 468/474 places, 882/882 transitions.
Applied a total of 0 rules in 36 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 468/474 places, 882/882 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:15:13] [INFO ] Computed 17 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5848 ms. (steps per millisecond=170 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3617 ms. (steps per millisecond=276 ) properties (out of 1) seen :1
[2023-03-15 22:15:23] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:15:23] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 22:15:23] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-03-15 22:15:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:23] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-15 22:15:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:15:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-03-15 22:15:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:24] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2023-03-15 22:15:24] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 22:15:24] [INFO ] [Nat]Added 205 Read/Feed constraints in 118 ms returned sat
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 44 places in 339 ms of which 1 ms to minimize.
[2023-03-15 22:15:24] [INFO ] Deduced a trap composed of 29 places in 324 ms of which 1 ms to minimize.
[2023-03-15 22:15:25] [INFO ] Deduced a trap composed of 33 places in 290 ms of which 0 ms to minimize.
[2023-03-15 22:15:25] [INFO ] Deduced a trap composed of 13 places in 486 ms of which 1 ms to minimize.
[2023-03-15 22:15:26] [INFO ] Deduced a trap composed of 92 places in 457 ms of which 2 ms to minimize.
[2023-03-15 22:15:26] [INFO ] Deduced a trap composed of 19 places in 476 ms of which 1 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 59 places in 495 ms of which 2 ms to minimize.
[2023-03-15 22:15:27] [INFO ] Deduced a trap composed of 52 places in 490 ms of which 1 ms to minimize.
[2023-03-15 22:15:28] [INFO ] Deduced a trap composed of 64 places in 481 ms of which 1 ms to minimize.
[2023-03-15 22:15:28] [INFO ] Deduced a trap composed of 35 places in 500 ms of which 3 ms to minimize.
[2023-03-15 22:15:29] [INFO ] Deduced a trap composed of 38 places in 482 ms of which 1 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 65 places in 485 ms of which 1 ms to minimize.
[2023-03-15 22:15:30] [INFO ] Deduced a trap composed of 46 places in 481 ms of which 1 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 11 places in 448 ms of which 1 ms to minimize.
[2023-03-15 22:15:31] [INFO ] Deduced a trap composed of 11 places in 442 ms of which 1 ms to minimize.
[2023-03-15 22:15:32] [INFO ] Deduced a trap composed of 35 places in 439 ms of which 1 ms to minimize.
[2023-03-15 22:15:32] [INFO ] Deduced a trap composed of 70 places in 458 ms of which 1 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 65 places in 453 ms of which 1 ms to minimize.
[2023-03-15 22:15:33] [INFO ] Deduced a trap composed of 65 places in 387 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 51 places in 428 ms of which 1 ms to minimize.
[2023-03-15 22:15:34] [INFO ] Deduced a trap composed of 21 places in 448 ms of which 1 ms to minimize.
[2023-03-15 22:15:35] [INFO ] Deduced a trap composed of 11 places in 436 ms of which 1 ms to minimize.
[2023-03-15 22:15:35] [INFO ] Deduced a trap composed of 20 places in 429 ms of which 2 ms to minimize.
[2023-03-15 22:15:36] [INFO ] Deduced a trap composed of 33 places in 426 ms of which 1 ms to minimize.
[2023-03-15 22:15:36] [INFO ] Deduced a trap composed of 59 places in 456 ms of which 1 ms to minimize.
[2023-03-15 22:15:37] [INFO ] Deduced a trap composed of 79 places in 246 ms of which 1 ms to minimize.
[2023-03-15 22:15:37] [INFO ] Deduced a trap composed of 45 places in 359 ms of which 1 ms to minimize.
[2023-03-15 22:15:37] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 0 ms to minimize.
[2023-03-15 22:15:38] [INFO ] Deduced a trap composed of 78 places in 224 ms of which 1 ms to minimize.
[2023-03-15 22:15:38] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 1 ms to minimize.
[2023-03-15 22:15:38] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 14593 ms
[2023-03-15 22:15:38] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 110 ms.
[2023-03-15 22:15:41] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 0 ms to minimize.
[2023-03-15 22:15:41] [INFO ] Deduced a trap composed of 27 places in 283 ms of which 1 ms to minimize.
[2023-03-15 22:15:41] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 1 ms to minimize.
[2023-03-15 22:15:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 905 ms
[2023-03-15 22:15:42] [INFO ] Added : 160 causal constraints over 33 iterations in 3476 ms. Result :sat
Minimization took 437 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[5]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 23 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 20 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2023-03-15 22:15:42] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:15:42] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 22:15:43] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-15 22:15:43] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:15:43] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 22:15:43] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 22:15:45] [INFO ] Implicit Places using invariants and state equation in 2171 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
[2023-03-15 22:15:45] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-15 22:15:45] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:15:45] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 22:15:46] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Starting property specific reduction for Peterson-COL-5-UpperBounds-03
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:15:46] [INFO ] Computed 17 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 1) seen :2
[2023-03-15 22:15:46] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:15:46] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-15 22:15:46] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-03-15 22:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:47] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2023-03-15 22:15:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:15:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2023-03-15 22:15:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:47] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2023-03-15 22:15:47] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 22:15:47] [INFO ] [Nat]Added 205 Read/Feed constraints in 78 ms returned sat
[2023-03-15 22:15:48] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 96 ms.
[2023-03-15 22:15:49] [INFO ] Deduced a trap composed of 13 places in 445 ms of which 1 ms to minimize.
[2023-03-15 22:15:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 573 ms
[2023-03-15 22:15:49] [INFO ] Added : 38 causal constraints over 9 iterations in 1531 ms. Result :sat
Minimization took 276 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[4]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 34 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:15:50] [INFO ] Computed 17 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5558 ms. (steps per millisecond=179 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3662 ms. (steps per millisecond=273 ) properties (out of 1) seen :2
[2023-03-15 22:15:59] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:15:59] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 22:15:59] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 22:15:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:15:59] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2023-03-15 22:15:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:15:59] [INFO ] [Nat]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-03-15 22:15:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:16:00] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-15 22:16:00] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 22:16:00] [INFO ] [Nat]Added 205 Read/Feed constraints in 103 ms returned sat
[2023-03-15 22:16:00] [INFO ] Deduced a trap composed of 44 places in 371 ms of which 2 ms to minimize.
[2023-03-15 22:16:01] [INFO ] Deduced a trap composed of 29 places in 313 ms of which 1 ms to minimize.
[2023-03-15 22:16:01] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 1 ms to minimize.
[2023-03-15 22:16:02] [INFO ] Deduced a trap composed of 13 places in 479 ms of which 2 ms to minimize.
[2023-03-15 22:16:02] [INFO ] Deduced a trap composed of 92 places in 437 ms of which 1 ms to minimize.
[2023-03-15 22:16:02] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 2 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 59 places in 343 ms of which 1 ms to minimize.
[2023-03-15 22:16:03] [INFO ] Deduced a trap composed of 52 places in 393 ms of which 1 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 64 places in 484 ms of which 1 ms to minimize.
[2023-03-15 22:16:04] [INFO ] Deduced a trap composed of 35 places in 484 ms of which 1 ms to minimize.
[2023-03-15 22:16:05] [INFO ] Deduced a trap composed of 38 places in 472 ms of which 1 ms to minimize.
[2023-03-15 22:16:05] [INFO ] Deduced a trap composed of 65 places in 493 ms of which 1 ms to minimize.
[2023-03-15 22:16:06] [INFO ] Deduced a trap composed of 46 places in 414 ms of which 1 ms to minimize.
[2023-03-15 22:16:06] [INFO ] Deduced a trap composed of 11 places in 441 ms of which 2 ms to minimize.
[2023-03-15 22:16:07] [INFO ] Deduced a trap composed of 11 places in 454 ms of which 1 ms to minimize.
[2023-03-15 22:16:07] [INFO ] Deduced a trap composed of 35 places in 399 ms of which 1 ms to minimize.
[2023-03-15 22:16:08] [INFO ] Deduced a trap composed of 70 places in 422 ms of which 1 ms to minimize.
[2023-03-15 22:16:08] [INFO ] Deduced a trap composed of 65 places in 433 ms of which 1 ms to minimize.
[2023-03-15 22:16:09] [INFO ] Deduced a trap composed of 65 places in 433 ms of which 1 ms to minimize.
[2023-03-15 22:16:09] [INFO ] Deduced a trap composed of 51 places in 468 ms of which 1 ms to minimize.
[2023-03-15 22:16:10] [INFO ] Deduced a trap composed of 21 places in 390 ms of which 2 ms to minimize.
[2023-03-15 22:16:10] [INFO ] Deduced a trap composed of 11 places in 415 ms of which 1 ms to minimize.
[2023-03-15 22:16:11] [INFO ] Deduced a trap composed of 20 places in 383 ms of which 1 ms to minimize.
[2023-03-15 22:16:11] [INFO ] Deduced a trap composed of 33 places in 382 ms of which 1 ms to minimize.
[2023-03-15 22:16:12] [INFO ] Deduced a trap composed of 59 places in 379 ms of which 1 ms to minimize.
[2023-03-15 22:16:12] [INFO ] Deduced a trap composed of 79 places in 347 ms of which 1 ms to minimize.
[2023-03-15 22:16:13] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 1 ms to minimize.
[2023-03-15 22:16:13] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 1 ms to minimize.
[2023-03-15 22:16:13] [INFO ] Deduced a trap composed of 78 places in 251 ms of which 1 ms to minimize.
[2023-03-15 22:16:14] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 1 ms to minimize.
[2023-03-15 22:16:14] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 13883 ms
[2023-03-15 22:16:14] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 93 ms.
[2023-03-15 22:16:16] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 1 ms to minimize.
[2023-03-15 22:16:17] [INFO ] Deduced a trap composed of 27 places in 300 ms of which 1 ms to minimize.
[2023-03-15 22:16:17] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2023-03-15 22:16:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 903 ms
[2023-03-15 22:16:17] [INFO ] Added : 160 causal constraints over 33 iterations in 3304 ms. Result :sat
Minimization took 441 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[5]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 17 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 16 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2023-03-15 22:16:18] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:16:18] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 22:16:18] [INFO ] Implicit Places using invariants in 336 ms returned []
[2023-03-15 22:16:18] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:16:18] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 22:16:19] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 22:16:20] [INFO ] Implicit Places using invariants and state equation in 1871 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
[2023-03-15 22:16:20] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 22:16:20] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 22:16:20] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 22:16:21] [INFO ] Dead Transitions using invariants and state equation in 786 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Ending property specific reduction for Peterson-COL-5-UpperBounds-03 in 34707 ms.
[2023-03-15 22:16:21] [INFO ] Flatten gal took : 220 ms
[2023-03-15 22:16:21] [INFO ] Applying decomposition
[2023-03-15 22:16:21] [INFO ] Flatten gal took : 143 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/graph12450839006277286128.txt' '-o' '/tmp/graph12450839006277286128.bin' '-w' '/tmp/graph12450839006277286128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12450839006277286128.bin' '-l' '-1' '-v' '-w' '/tmp/graph12450839006277286128.weights' '-q' '0' '-e' '0.001'
[2023-03-15 22:16:22] [INFO ] Decomposing Gal with order
[2023-03-15 22:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 22:16:22] [INFO ] Removed a total of 1156 redundant transitions.
[2023-03-15 22:16:22] [INFO ] Flatten gal took : 179 ms
[2023-03-15 22:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 39 ms.
[2023-03-15 22:16:22] [INFO ] Time to serialize gal into /tmp/UpperBounds11707962682220806046.gal : 20 ms
[2023-03-15 22:16:22] [INFO ] Time to serialize properties into /tmp/UpperBounds14955174223926102951.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/UpperBounds11707962682220806046.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14955174223926102951.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...297
Loading property file /tmp/UpperBounds14955174223926102951.prop.
Detected timeout of ITS tools.
[2023-03-15 22:37:16] [INFO ] Applying decomposition
[2023-03-15 22:37:17] [INFO ] Flatten gal took : 761 ms
[2023-03-15 22:37:17] [INFO ] Decomposing Gal with order
[2023-03-15 22:37:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 22:37:18] [INFO ] Removed a total of 1242 redundant transitions.
[2023-03-15 22:37:19] [INFO ] Flatten gal took : 611 ms
[2023-03-15 22:37:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 113 ms.
[2023-03-15 22:37:19] [INFO ] Time to serialize gal into /tmp/UpperBounds3564618608066771564.gal : 92 ms
[2023-03-15 22:37:19] [INFO ] Time to serialize properties into /tmp/UpperBounds5055750568369641659.prop : 5 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/UpperBounds3564618608066771564.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5055750568369641659.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/UpperBounds5055750568369641659.prop.
Detected timeout of ITS tools.
[2023-03-15 22:58:10] [INFO ] Flatten gal took : 1050 ms
[2023-03-15 22:58:15] [INFO ] Input system was already deterministic with 882 transitions.
[2023-03-15 22:58:15] [INFO ] Transformed 468 places.
[2023-03-15 22:58:15] [INFO ] Transformed 882 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
[2023-03-15 22:58:16] [INFO ] Time to serialize gal into /tmp/UpperBounds5394893993899183545.gal : 98 ms
[2023-03-15 22:58:16] [INFO ] Time to serialize properties into /tmp/UpperBounds5869122360383353651.prop : 11 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/UpperBounds5394893993899183545.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5869122360383353651.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/UpperBounds5869122360383353651.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-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is Peterson-COL-5, 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 r287-smll-167863553800073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-5.tgz
mv Peterson-COL-5 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 '
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 ;