Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r544-tall-167987257700256.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is PGCD-COL-D04N025, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-tall-167987257700256
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.3K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 23 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 16K Mar 26 22:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1679951165267

Running Version 202205111006
[2023-03-27 21:06:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -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, 1800]
[2023-03-27 21:06:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-27 21:06:06] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-27 21:06:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-27 21:06:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 594 ms
[2023-03-27 21:06:07] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 15 PT places and 15.0 transition bindings in 18 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 1 ms.
Working with output stream class java.io.PrintStream
[2023-03-27 21:06:07] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2023-03-27 21:06:07] [INFO ] Skeletonized 1 HLPN properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Arc [0:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2023-03-27 21:06:07] [INFO ] Unfolded HLPN to a Petri net with 15 places and 15 transitions 70 arcs in 5 ms.
[2023-03-27 21:06:07] [INFO ] Unfolded 1 HLPN properties in 0 ms.
Built sparse matrix representations for Structural reductions in 0 ms.17453KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 15/15 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 8 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 15 cols
[2023-03-27 21:06:07] [INFO ] Computed 6 place invariants in 8 ms
[2023-03-27 21:06:07] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 15/15 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 15/15 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 5 ms. Remains 15 /15 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 15 cols
[2023-03-27 21:06:07] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-27 21:06:07] [INFO ] Implicit Places using invariants in 52 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 56 ms to find 5 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 1 : 10/15 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 15/15 transitions.
Random walk for 1250003 steps, including 0 resets, run took 254 ms (no deadlock found). (steps per millisecond=4921 )
Random directed walk for 1250009 steps, including 0 resets, run took 216 ms (no deadlock found). (steps per millisecond=5787 )
// Phase 1: matrix 15 rows 10 cols
[2023-03-27 21:06:07] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-27 21:06:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 21:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-27 21:06:07] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-27 21:06:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-27 21:06:07] [INFO ] [Real]Added 5 Read/Feed constraints in 5 ms returned sat
[2023-03-27 21:06:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-27 21:06:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 21:06:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-27 21:06:07] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-27 21:06:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-27 21:06:07] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-03-27 21:06:07] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
[2023-03-27 21:06:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-27 21:06:07] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-27 21:06:07] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Parikh directed walk for 5200 steps, including 127 resets, run took 10 ms. (steps per millisecond=520 )
Random directed walk for 500015 steps, including 0 resets, run took 73 ms (no deadlock found). (steps per millisecond=6849 )
Random walk for 500008 steps, including 0 resets, run took 75 ms (no deadlock found). (steps per millisecond=6666 )
Random directed walk for 500011 steps, including 0 resets, run took 74 ms (no deadlock found). (steps per millisecond=6756 )
Random walk for 500011 steps, including 0 resets, run took 76 ms (no deadlock found). (steps per millisecond=6579 )
Starting structural reductions in DEADLOCKS mode, iteration 0 : 10/10 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 15/15 (removed 0) transitions.
// Phase 1: matrix 15 rows 10 cols
[2023-03-27 21:06:08] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-27 21:06:08] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-03-27 21:06:08] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-27 21:06:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-27 21:06:08] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-27 21:06:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 10 cols
[2023-03-27 21:06:08] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-27 21:06:08] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10 places, 15/15 transitions.
Random walk for 1250003 steps, including 0 resets, run took 185 ms (no deadlock found). (steps per millisecond=6756 )
Random directed walk for 1250018 steps, including 0 resets, run took 179 ms (no deadlock found). (steps per millisecond=6983 )
// Phase 1: matrix 15 rows 10 cols
[2023-03-27 21:06:08] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-27 21:06:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 21:06:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-27 21:06:08] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-27 21:06:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-27 21:06:08] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2023-03-27 21:06:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-27 21:06:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-27 21:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-27 21:06:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-27 21:06:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-27 21:06:08] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2023-03-27 21:06:08] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2023-03-27 21:06:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-27 21:06:08] [INFO ] Computed and/alt/rep : 5/10/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-27 21:06:08] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
Parikh directed walk for 5200 steps, including 122 resets, run took 8 ms. (steps per millisecond=650 )
Random directed walk for 500029 steps, including 0 resets, run took 70 ms (no deadlock found). (steps per millisecond=7143 )
Random walk for 500014 steps, including 0 resets, run took 74 ms (no deadlock found). (steps per millisecond=6756 )
Random directed walk for 500013 steps, including 0 resets, run took 74 ms (no deadlock found). (steps per millisecond=6756 )
Random walk for 500003 steps, including 0 resets, run took 74 ms (no deadlock found). (steps per millisecond=6756 )
[2023-03-27 21:06:09] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4727747501434944001
[2023-03-27 21:06:09] [INFO ] Applying decomposition
[2023-03-27 21:06:09] [INFO ] Flatten gal took : 3 ms
[2023-03-27 21:06:09] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2023-03-27 21:06:09] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-27 21:06:09] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2023-03-27 21:06:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-27 21:06:09] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2023-03-27 21:06:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-27 21:06:09] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4727747501434944001
Running compilation step : cd /tmp/ltsmin4727747501434944001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17424318533278505256.txt' '-o' '/tmp/graph17424318533278505256.bin' '-w' '/tmp/graph17424318533278505256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17424318533278505256.bin' '-l' '-1' '-v' '-w' '/tmp/graph17424318533278505256.weights' '-q' '0' '-e' '0.001'
[2023-03-27 21:06:09] [INFO ] Decomposing Gal with order
[2023-03-27 21:06:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-27 21:06:09] [INFO ] Flatten gal took : 20 ms
[2023-03-27 21:06:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-27 21:06:09] [INFO ] Time to serialize gal into /tmp/ReachabilityDeadlock344997301085102566.gal : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityDeadlock344997301085102566.gal' '-t' 'CGAL' '-ctl' 'DEADLOCK'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/R...224
No direction supplied, using forward translation only.
Compilation finished in 221 ms.
Running link step : cd /tmp/ltsmin4727747501434944001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4727747501434944001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 15, guards 15
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: There are 15 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.010: State length is 15, there are 15 groups
pins2lts-mc-linux64( 0/ 8), 0.010: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.010: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.010: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.010: Visible groups: 0 / 15, labels: 0 / 15
pins2lts-mc-linux64( 0/ 8), 0.010: POR cycle proviso: none
pins2lts-mc-linux64( 0/ 8), 0.010: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.026: ~4 levels ~960 states ~5912 transitions
pins2lts-mc-linux64( 0/ 8), 0.087: ~5 levels ~1920 states ~11536 transitions
pins2lts-mc-linux64( 4/ 8), 0.134: ~2 levels ~3840 states ~17776 transitions
pins2lts-mc-linux64( 1/ 8), 0.188: ~2 levels ~7680 states ~29312 transitions
pins2lts-mc-linux64( 1/ 8), 0.263: ~3 levels ~15360 states ~57480 transitions
pins2lts-mc-linux64( 1/ 8), 0.441: ~5 levels ~30720 states ~109624 transitions
pins2lts-mc-linux64( 1/ 8), 0.682: ~6 levels ~61440 states ~206768 transitions
pins2lts-mc-linux64( 4/ 8), 1.040: ~9 levels ~122880 states ~419256 transitions
pins2lts-mc-linux64( 2/ 8), 1.576: ~9 levels ~245760 states ~867496 transitions
pins2lts-mc-linux64( 1/ 8), 2.196: ~11 levels ~491520 states ~1616808 transitions
pins2lts-mc-linux64( 2/ 8), 2.963: ~13 levels ~983040 states ~3313496 transitions
pins2lts-mc-linux64( 6/ 8), 4.239: ~14 levels ~1966080 states ~6442336 transitions
pins2lts-mc-linux64( 3/ 8), 6.765: ~18 levels ~3932160 states ~12780032 transitions
pins2lts-mc-linux64( 3/ 8), 11.656: ~20 levels ~7864320 states ~25082568 transitions
pins2lts-mc-linux64( 1/ 8), 21.618: ~23 levels ~15728640 states ~48961808 transitions
pins2lts-mc-linux64( 3/ 8), 41.735: ~26 levels ~31457280 states ~97494672 transitions
pins2lts-mc-linux64( 5/ 8), 61.169: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 61.199:
pins2lts-mc-linux64( 0/ 8), 61.199: mean standard work distribution: 1.1% (states) 1.3% (transitions)
pins2lts-mc-linux64( 0/ 8), 61.199:
pins2lts-mc-linux64( 0/ 8), 61.199: Explored 44124514 states 138153154 transitions, fanout: 3.131
pins2lts-mc-linux64( 0/ 8), 61.199: Total exploration time 61.190 sec (61.160 sec minimum, 61.176 sec on average)
pins2lts-mc-linux64( 0/ 8), 61.199: States per second: 721107, Transitions per second: 2257774
pins2lts-mc-linux64( 0/ 8), 61.199:
pins2lts-mc-linux64( 0/ 8), 61.199: Queue width: 8B, total height: 9601082, memory: 73.25MB
pins2lts-mc-linux64( 0/ 8), 61.199: Tree memory: 665.9MB, 13.0 B/state, compr.: 21.0%
pins2lts-mc-linux64( 0/ 8), 61.199: Tree fill ratio (roots/leafs): 40.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 61.199: Stored 15 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 61.199: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 61.199: Est. total memory use: 739.1MB (~1097.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4727747501434944001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4727747501434944001;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-d'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57364e+12,126.968,767272,1088,4803,713355,42091,36,303148,23,193258,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,21435,134.683,766924,456,134,713355,523968,75,303148,474,1.54234e+06,7943

System contains 21435 deadlocks (shown below if less than --print-limit option) !
FORMULA ReachabilityDeadlock TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ 21435 states ] showing 10 first states
[ u4={[ p1_4=10 ]
} u3={[ p1_3=10 ]
} u2={[ p1_2=106 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u4={[ p1_4=10 ]
} u3={[ p1_3=10 ]
} u2={[ p2_2=2 p0_2=2 ]
} u1={[ p1_1=106 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u4={[ p1_4=10 ]
} u3={[ p1_3=10 ]
} u2={[ p2_2=2 p0_2=2 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p1_0=106 ]
} ]
[ u4={[ p1_4=10 ]
} u3={[ p1_3=26 ]
} u2={[ p1_2=90 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u4={[ p1_4=10 ]
} u3={[ p1_3=26 ]
} u2={[ p2_2=2 p0_2=2 ]
} u1={[ p1_1=90 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u4={[ p1_4=10 ]
} u3={[ p1_3=26 ]
} u2={[ p2_2=2 p0_2=2 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p1_0=90 ]
} ]
[ u4={[ p1_4=10 ]
} u3={[ p1_3=40 ]
} u2={[ p1_2=76 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u4={[ p1_4=10 ]
} u3={[ p1_3=40 ]
} u2={[ p2_2=2 p0_2=2 ]
} u1={[ p1_1=76 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
[ u4={[ p1_4=10 ]
} u3={[ p1_3=40 ]
} u2={[ p2_2=2 p0_2=2 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p1_0=76 ]
} ]
[ u4={[ p1_4=10 ]
} u3={[ ]
} u2={[ p1_2=116 ]
} u1={[ p2_1=2 p0_1=2 ]
} u0={[ p2_0=2 p0_0=2 ]
} ]
Total runtime 171672 ms.

BK_STOP 1679951338094

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PGCD-COL-D04N025"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is PGCD-COL-D04N025, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r544-tall-167987257700256"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D04N025.tgz
mv PGCD-COL-D04N025 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;