fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r323-tall-165472292700133
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for DoubleLock-PT-p3s3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16248.147 3600000.00 3335482.00 209213.40 0 1 1 1 0 1 0 1 0 1 1 1 1 1 ? 1 normal

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.r323-tall-165472292700133.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 gold2021
Input is DoubleLock-PT-p3s3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292700133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.0K Jun 7 16:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Jun 7 16:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Jun 7 16:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 7 16:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 16:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Jun 7 16:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 7 16:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 16:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.4M Jun 6 12:11 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 DoubleLock-PT-p3s3-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p3s3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654751880822

Running Version 0
[2022-06-09 05:18:02] [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-06-09 05:18:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 05:18:02] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2022-06-09 05:18:02] [INFO ] Transformed 306 places.
[2022-06-09 05:18:02] [INFO ] Transformed 3136 transitions.
[2022-06-09 05:18:02] [INFO ] Parsed PT model containing 306 places and 3136 transitions in 321 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 68 places in 18 ms
Reduce places removed 68 places and 128 transitions.
FORMULA DoubleLock-PT-p3s3-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s3-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2121 out of 3008 initially.
// Phase 1: matrix 2121 rows 238 cols
[2022-06-09 05:18:02] [INFO ] Computed 4 place invariants in 57 ms
Incomplete random walk after 10005 steps, including 95 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :17
FORMULA DoubleLock-PT-p3s3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :7
FORMULA DoubleLock-PT-p3s3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :4
FORMULA DoubleLock-PT-p3s3-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :10
[2022-06-09 05:18:02] [INFO ] Flow matrix only has 2121 transitions (discarded 887 similar events)
// Phase 1: matrix 2121 rows 238 cols
[2022-06-09 05:18:03] [INFO ] Computed 4 place invariants in 28 ms
[2022-06-09 05:18:03] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-06-09 05:18:03] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 05:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:03] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2022-06-09 05:18:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:18:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:03] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 05:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:04] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2022-06-09 05:18:04] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:18:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 05:18:07] [INFO ] [Nat]Added 157 Read/Feed constraints in 3114 ms returned sat
[2022-06-09 05:18:07] [INFO ] Deduced a trap composed of 147 places in 251 ms of which 4 ms to minimize.
[2022-06-09 05:18:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 430 ms
[2022-06-09 05:18:08] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 258 ms.
[2022-06-09 05:18:08] [INFO ] Added : 35 causal constraints over 7 iterations in 907 ms. Result :unknown
[2022-06-09 05:18:08] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 05:18:08] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 05:18:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:09] [INFO ] [Real]Absence check using state equation in 356 ms returned sat
[2022-06-09 05:18:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:18:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:09] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 05:18:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:09] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-06-09 05:18:12] [INFO ] [Nat]Added 157 Read/Feed constraints in 2858 ms returned sat
[2022-06-09 05:18:12] [INFO ] Deduced a trap composed of 146 places in 286 ms of which 1 ms to minimize.
[2022-06-09 05:18:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 398 ms
[2022-06-09 05:18:13] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 361 ms.
[2022-06-09 05:18:14] [INFO ] Added : 60 causal constraints over 12 iterations in 1435 ms. Result :unknown
[2022-06-09 05:18:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 05:18:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:14] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-06-09 05:18:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:18:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-06-09 05:18:14] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 05:18:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:14] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2022-06-09 05:18:17] [INFO ] [Nat]Added 157 Read/Feed constraints in 2679 ms returned sat
[2022-06-09 05:18:17] [INFO ] Deduced a trap composed of 159 places in 291 ms of which 0 ms to minimize.
[2022-06-09 05:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2022-06-09 05:18:18] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1860 transitions) in 184 ms.
[2022-06-09 05:18:19] [INFO ] Deduced a trap composed of 12 places in 311 ms of which 2 ms to minimize.
[2022-06-09 05:18:19] [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 2
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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, -1] Max seen :[0, 0, 11]
Incomplete Parikh walk after 339900 steps, including 1002 resets, run finished after 1830 ms. (steps per millisecond=185 ) properties (out of 3) seen :7 could not realise parikh vector
FORMULA DoubleLock-PT-p3s3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DoubleLock-PT-p3s3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 305700 steps, including 1002 resets, run finished after 1679 ms. (steps per millisecond=182 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 238/238 places, 3008/3008 transitions.
Graph (complete) has 5131 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.15 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 235 transition count 2976
Applied a total of 33 rules in 160 ms. Remains 235 /238 variables (removed 3) and now considering 2976/3008 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/238 places, 2976/3008 transitions.
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:23] [INFO ] Computed 3 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 9543 resets, run finished after 2011 ms. (steps per millisecond=497 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 1445 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 1) seen :20
[2022-06-09 05:18:26] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:26] [INFO ] Computed 3 place invariants in 17 ms
[2022-06-09 05:18:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:26] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2022-06-09 05:18:26] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:18:26] [INFO ] [Real]Added 157 Read/Feed constraints in 189 ms returned sat
[2022-06-09 05:18:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:18:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:27] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-06-09 05:18:29] [INFO ] [Nat]Added 157 Read/Feed constraints in 2388 ms returned sat
[2022-06-09 05:18:30] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 220 ms.
[2022-06-09 05:18:31] [INFO ] Deduced a trap composed of 84 places in 291 ms of which 1 ms to minimize.
[2022-06-09 05:18:32] [INFO ] Deduced a trap composed of 105 places in 272 ms of which 0 ms to minimize.
[2022-06-09 05:18:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 781 ms
[2022-06-09 05:18:32] [INFO ] Added : 86 causal constraints over 18 iterations in 2681 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[20]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 61 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 70 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2022-06-09 05:18:35] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:35] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-09 05:18:35] [INFO ] Implicit Places using invariants in 269 ms returned []
[2022-06-09 05:18:35] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:35] [INFO ] Computed 3 place invariants in 13 ms
[2022-06-09 05:18:36] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:18:36] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2022-06-09 05:18:36] [INFO ] Redundant transitions in 198 ms returned []
[2022-06-09 05:18:36] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:36] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-09 05:18:37] [INFO ] Dead Transitions using invariants and state equation in 839 ms returned []
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:37] [INFO ] Computed 3 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 9502 resets, run finished after 2045 ms. (steps per millisecond=488 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 1451 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 1) seen :17
[2022-06-09 05:18:40] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:40] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 05:18:40] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:40] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-06-09 05:18:40] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:18:40] [INFO ] [Real]Added 157 Read/Feed constraints in 183 ms returned sat
[2022-06-09 05:18:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:18:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:41] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-06-09 05:18:43] [INFO ] [Nat]Added 157 Read/Feed constraints in 2313 ms returned sat
[2022-06-09 05:18:43] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 163 ms.
[2022-06-09 05:18:45] [INFO ] Deduced a trap composed of 84 places in 273 ms of which 1 ms to minimize.
[2022-06-09 05:18:45] [INFO ] Deduced a trap composed of 105 places in 267 ms of which 1 ms to minimize.
[2022-06-09 05:18:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 752 ms
[2022-06-09 05:18:46] [INFO ] Added : 86 causal constraints over 18 iterations in 2575 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[20]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 90 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 110 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2022-06-09 05:18:49] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:49] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-09 05:18:49] [INFO ] Implicit Places using invariants in 256 ms returned []
[2022-06-09 05:18:49] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:49] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-09 05:18:50] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:18:50] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
[2022-06-09 05:18:50] [INFO ] Redundant transitions in 185 ms returned []
[2022-06-09 05:18:50] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:50] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-09 05:18:51] [INFO ] Dead Transitions using invariants and state equation in 835 ms returned []
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting property specific reduction for DoubleLock-PT-p3s3-UpperBounds-14
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:51] [INFO ] Computed 3 place invariants in 10 ms
Incomplete random walk after 10001 steps, including 92 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :15
[2022-06-09 05:18:51] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:51] [INFO ] Computed 3 place invariants in 20 ms
[2022-06-09 05:18:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:51] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2022-06-09 05:18:51] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:18:51] [INFO ] [Real]Added 157 Read/Feed constraints in 179 ms returned sat
[2022-06-09 05:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:18:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:52] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2022-06-09 05:18:54] [INFO ] [Nat]Added 157 Read/Feed constraints in 2293 ms returned sat
[2022-06-09 05:18:54] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 177 ms.
[2022-06-09 05:18:56] [INFO ] Deduced a trap composed of 99 places in 253 ms of which 0 ms to minimize.
[2022-06-09 05:18:57] [INFO ] Deduced a trap composed of 98 places in 295 ms of which 1 ms to minimize.
[2022-06-09 05:18:57] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
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:134)
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:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[15]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 51 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:57] [INFO ] Computed 3 place invariants in 14 ms
Incomplete random walk after 1000001 steps, including 9536 resets, run finished after 1789 ms. (steps per millisecond=558 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 1467 resets, run finished after 616 ms. (steps per millisecond=1623 ) properties (out of 1) seen :17
[2022-06-09 05:18:59] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:18:59] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-09 05:18:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:18:59] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2022-06-09 05:18:59] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:19:00] [INFO ] [Real]Added 157 Read/Feed constraints in 176 ms returned sat
[2022-06-09 05:19:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:19:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:19:00] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-06-09 05:19:02] [INFO ] [Nat]Added 157 Read/Feed constraints in 2310 ms returned sat
[2022-06-09 05:19:03] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 158 ms.
[2022-06-09 05:19:04] [INFO ] Deduced a trap composed of 99 places in 250 ms of which 0 ms to minimize.
[2022-06-09 05:19:05] [INFO ] Deduced a trap composed of 98 places in 240 ms of which 0 ms to minimize.
[2022-06-09 05:19:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 702 ms
[2022-06-09 05:19:05] [INFO ] Added : 86 causal constraints over 18 iterations in 2551 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[17]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 54 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 45 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2022-06-09 05:19:08] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:08] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 05:19:08] [INFO ] Implicit Places using invariants in 256 ms returned []
[2022-06-09 05:19:08] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:08] [INFO ] Computed 3 place invariants in 7 ms
[2022-06-09 05:19:09] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:19:09] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
[2022-06-09 05:19:09] [INFO ] Redundant transitions in 70 ms returned []
[2022-06-09 05:19:09] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:09] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-09 05:19:10] [INFO ] Dead Transitions using invariants and state equation in 842 ms returned []
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:10] [INFO ] Computed 3 place invariants in 12 ms
Incomplete random walk after 1000008 steps, including 9515 resets, run finished after 1744 ms. (steps per millisecond=573 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 1469 resets, run finished after 610 ms. (steps per millisecond=1639 ) properties (out of 1) seen :19
[2022-06-09 05:19:12] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:12] [INFO ] Computed 3 place invariants in 12 ms
[2022-06-09 05:19:12] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:19:12] [INFO ] [Real]Absence check using state equation in 286 ms returned sat
[2022-06-09 05:19:12] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:19:13] [INFO ] [Real]Added 157 Read/Feed constraints in 174 ms returned sat
[2022-06-09 05:19:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:19:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:19:13] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2022-06-09 05:19:15] [INFO ] [Nat]Added 157 Read/Feed constraints in 2269 ms returned sat
[2022-06-09 05:19:15] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 156 ms.
[2022-06-09 05:19:17] [INFO ] Deduced a trap composed of 99 places in 242 ms of which 0 ms to minimize.
[2022-06-09 05:19:18] [INFO ] Deduced a trap composed of 98 places in 240 ms of which 1 ms to minimize.
[2022-06-09 05:19:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 699 ms
[2022-06-09 05:19:18] [INFO ] Added : 86 causal constraints over 18 iterations in 2510 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[19]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 47 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 44 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2022-06-09 05:19:21] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:21] [INFO ] Computed 3 place invariants in 13 ms
[2022-06-09 05:19:21] [INFO ] Implicit Places using invariants in 255 ms returned []
[2022-06-09 05:19:21] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:21] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-09 05:19:22] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:19:22] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2022-06-09 05:19:22] [INFO ] Redundant transitions in 72 ms returned []
[2022-06-09 05:19:22] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:22] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-09 05:19:23] [INFO ] Dead Transitions using invariants and state equation in 866 ms returned []
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Normalized transition count is 2089 out of 2976 initially.
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:23] [INFO ] Computed 3 place invariants in 15 ms
Incomplete random walk after 1000003 steps, including 9524 resets, run finished after 1870 ms. (steps per millisecond=534 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 1420 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 1) seen :17
[2022-06-09 05:19:25] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:25] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-09 05:19:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-09 05:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 05:19:25] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-06-09 05:19:26] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:19:26] [INFO ] [Real]Added 157 Read/Feed constraints in 175 ms returned sat
[2022-06-09 05:19:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 05:19:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 05:19:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 05:19:26] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-06-09 05:19:28] [INFO ] [Nat]Added 157 Read/Feed constraints in 2292 ms returned sat
[2022-06-09 05:19:29] [INFO ] Computed and/alt/rep : 259/1539/259 causal constraints (skipped 1828 transitions) in 141 ms.
[2022-06-09 05:19:30] [INFO ] Deduced a trap composed of 99 places in 287 ms of which 0 ms to minimize.
[2022-06-09 05:19:31] [INFO ] Deduced a trap composed of 98 places in 266 ms of which 0 ms to minimize.
[2022-06-09 05:19:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 767 ms
[2022-06-09 05:19:31] [INFO ] Added : 86 causal constraints over 18 iterations in 2526 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[19]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 51 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Starting structural reductions, iteration 0 : 235/235 places, 2976/2976 transitions.
Applied a total of 0 rules in 43 ms. Remains 235 /235 variables (removed 0) and now considering 2976/2976 (removed 0) transitions.
[2022-06-09 05:19:34] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:34] [INFO ] Computed 3 place invariants in 13 ms
[2022-06-09 05:19:34] [INFO ] Implicit Places using invariants in 243 ms returned []
[2022-06-09 05:19:34] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:34] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-09 05:19:35] [INFO ] State equation strengthened by 157 read => feed constraints.
[2022-06-09 05:19:35] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2022-06-09 05:19:35] [INFO ] Redundant transitions in 74 ms returned []
[2022-06-09 05:19:35] [INFO ] Flow matrix only has 2089 transitions (discarded 887 similar events)
// Phase 1: matrix 2089 rows 235 cols
[2022-06-09 05:19:35] [INFO ] Computed 3 place invariants in 13 ms
[2022-06-09 05:19:36] [INFO ] Dead Transitions using invariants and state equation in 834 ms returned []
Finished structural reductions, in 1 iterations. Remains : 235/235 places, 2976/2976 transitions.
Ending property specific reduction for DoubleLock-PT-p3s3-UpperBounds-14 in 44996 ms.
[2022-06-09 05:19:36] [INFO ] Flatten gal took : 244 ms
[2022-06-09 05:19:36] [INFO ] Applying decomposition
[2022-06-09 05:19:36] [INFO ] Flatten gal took : 151 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15848348580766158294.txt, -o, /tmp/graph15848348580766158294.bin, -w, /tmp/graph15848348580766158294.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15848348580766158294.bin, -l, -1, -v, -w, /tmp/graph15848348580766158294.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 05:19:37] [INFO ] Decomposing Gal with order
[2022-06-09 05:19:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 05:19:37] [INFO ] Removed a total of 7121 redundant transitions.
[2022-06-09 05:19:37] [INFO ] Flatten gal took : 347 ms
[2022-06-09 05:19:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 465 labels/synchronizations in 123 ms.
[2022-06-09 05:19:38] [INFO ] Time to serialize gal into /tmp/UpperBounds16955361457539527950.gal : 102 ms
[2022-06-09 05:19:38] [INFO ] Time to serialize properties into /tmp/UpperBounds10053527356737225618.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds16955361457539527950.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10053527356737225618.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds16955361457539527950.gal -t CGAL -reachable-file /tmp/UpperBounds10053527356737225618.prop --nowitness
Loading property file /tmp/UpperBounds10053527356737225618.prop.
Detected timeout of ITS tools.
[2022-06-09 05:40:09] [INFO ] Flatten gal took : 123 ms
[2022-06-09 05:40:09] [INFO ] Time to serialize gal into /tmp/UpperBounds12808928851995256252.gal : 17 ms
[2022-06-09 05:40:09] [INFO ] Time to serialize properties into /tmp/UpperBounds4258932039949441401.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12808928851995256252.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds4258932039949441401.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12808928851995256252.gal -t CGAL -reachable-file /tmp/UpperBounds4258932039949441401.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds4258932039949441401.prop.
Detected timeout of ITS tools.
[2022-06-09 06:00:51] [INFO ] Flatten gal took : 785 ms
[2022-06-09 06:00:54] [INFO ] Input system was already deterministic with 2976 transitions.
[2022-06-09 06:00:54] [INFO ] Transformed 235 places.
[2022-06-09 06:00:55] [INFO ] Transformed 2976 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 06:00:55] [INFO ] Time to serialize gal into /tmp/UpperBounds8554545658726088961.gal : 49 ms
[2022-06-09 06:00:55] [INFO ] Time to serialize properties into /tmp/UpperBounds12071733902575362830.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds8554545658726088961.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12071733902575362830.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds8554545658726088961.gal -t CGAL -reachable-file /tmp/UpperBounds12071733902575362830.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds12071733902575362830.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="DoubleLock-PT-p3s3"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is DoubleLock-PT-p3s3, 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 r323-tall-165472292700133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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