About the Execution of 2021-gold for FamilyReunion-COL-L03000M0300G150P150G075
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16248.239 | 3600000.00 | 1230980.00 | 1967267.70 | [undef] | Time out reached |
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.r089-tall-165260117900256.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 FamilyReunion-COL-L03000M0300G150P150G075, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-tall-165260117900256
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.5K Apr 30 08:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 08:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 30 08:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 08:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 9 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 24 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 330K May 10 09:33 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 FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-00
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-01
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-02
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-03
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-04
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-05
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-06
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-07
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-08
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-09
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-10
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-11
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-12
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-13
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-14
FORMULA_NAME FamilyReunion-COL-L03000M0300G150P150G075-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652727893387
Running Version 0
[2022-05-16 19:04:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 19:04:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:04:56] [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.
[2022-05-16 19:04:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 19:04:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 836 ms
[2022-05-16 19:04:57] [INFO ] Detected 5 constant HL places corresponding to 756 PT places.
[2022-05-16 19:04:57] [INFO ] Imported 104 HL places and 66 HL transitions for a total of 28410109 PT places and 2.721622E7 transition bindings in 132 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
[2022-05-16 19:04:57] [INFO ] Built PT skeleton of HLPN with 104 places and 66 transitions in 22 ms.
[2022-05-16 19:04:57] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_14011381025182009886.dot
Reduce places removed 5 places and 0 transitions.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 19:04:58] [INFO ] Computed 33 place invariants in 15 ms
[2022-05-16 19:12:19] [INFO ] Unfolded HLPN to a Petri net with 28410109 places and 27213219 transitions in 440998 ms.
[2022-05-16 19:12:19] [INFO ] Unfolded HLPN properties in 181 ms.
// Phase 1: matrix 66 rows 99 cols
[2022-05-16 19:12:19] [INFO ] Computed 33 place invariants in 12 ms
[2022-05-16 19:12:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:546)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.treatSkeleton(UpperBoundsSolver.java:85)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:416)
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)
[2022-05-16 19:12:28] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2022-05-16 19:12:28] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 10 ms returned sat
[2022-05-16 19:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:28] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-16 19:12:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:28] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:28] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 7 ms returned sat
[2022-05-16 19:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:28] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 19:12:28] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 19:12:28] [INFO ] Added : 23 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 10 ms.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 19:12:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 19:12:29] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 19:12:29] [INFO ] Added : 29 causal constraints over 6 iterations in 54 ms. Result :sat
Minimization took 13 ms.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 19:12:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-05-16 19:12:29] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 19:12:29] [INFO ] Added : 56 causal constraints over 12 iterations in 91 ms. Result :sat
Minimization took 23 ms.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 19:12:29] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 19:12:29] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2022-05-16 19:12:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 19:12:29] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 19:12:29] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 9 ms.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 19:12:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 19:12:29] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 19:12:29] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 19:12:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:29] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 19:12:29] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 19:12:29] [INFO ] Added : 31 causal constraints over 7 iterations in 55 ms. Result :sat
Minimization took 16 ms.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 19:12:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 19:12:30] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 19:12:30] [INFO ] Added : 65 causal constraints over 13 iterations in 89 ms. Result :sat
Minimization took 15 ms.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 19:12:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 19:12:30] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 19:12:30] [INFO ] Added : 10 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 19:12:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 19:12:30] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 19:12:30] [INFO ] Added : 36 causal constraints over 8 iterations in 58 ms. Result :sat
Minimization took 14 ms.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 19:12:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 19:12:30] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 19:12:30] [INFO ] Added : 34 causal constraints over 7 iterations in 41 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 19:12:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 19:12:30] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 19:12:30] [INFO ] Added : 32 causal constraints over 7 iterations in 44 ms. Result :sat
Minimization took 11 ms.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 8 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 19:12:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 19:12:30] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 19:12:30] [INFO ] Added : 22 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 8 ms.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 4 ms returned sat
[2022-05-16 19:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:30] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 19:12:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 5 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:31] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 19:12:31] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 19:12:31] [INFO ] Added : 65 causal constraints over 13 iterations in 114 ms. Result :sat
Minimization took 16 ms.
[2022-05-16 19:12:31] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 21 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:31] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 19:12:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 9 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:31] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 19:12:31] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 19:12:31] [INFO ] Added : 45 causal constraints over 9 iterations in 51 ms. Result :sat
Minimization took 13 ms.
[2022-05-16 19:12:31] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Real]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 19:12:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:12:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Nat]Absence check using 4 positive and 29 generalized place invariants in 6 ms returned sat
[2022-05-16 19:12:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:12:31] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-05-16 19:12:31] [INFO ] Computed and/alt/rep : 65/89/65 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 19:12:31] [INFO ] Added : 49 causal constraints over 10 iterations in 94 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [3001, 15005, 3001, 3001, 3001, 3001, 24008, 3001, 3001, 3001, 3001, 3001, 3001, 76, 6002, 3001]
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="FamilyReunion-COL-L03000M0300G150P150G075"
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 FamilyReunion-COL-L03000M0300G150P150G075, 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 r089-tall-165260117900256"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-COL-L03000M0300G150P150G075.tgz
mv FamilyReunion-COL-L03000M0300G150P150G075 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 ;