Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620521400040.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is CANConstruction-PT-070, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r087-tall-171620521400040
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 20:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 20:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.3M May 18 16: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

here is the order used to build the result vector(from text file)
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-00
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-01
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-02
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-03
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-04
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-05
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-06
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-07
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-08
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-09
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-10
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-11
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-12
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-13
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-14
FORMULA_NAME CANConstruction-PT-070-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716219635482

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-20 15:40:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-20 15:40:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 15:40:37] [INFO ] Load time of PNML (sax parser for PT used): 413 ms
[2024-05-20 15:40:37] [INFO ] Transformed 10642 places.
[2024-05-20 15:40:37] [INFO ] Transformed 20160 transitions.
[2024-05-20 15:40:37] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 587 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 7 resets, run finished after 709 ms. (steps per millisecond=14 ) properties (out of 16) seen :4
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 20160 rows 10642 cols
[2024-05-20 15:40:39] [INFO ] Computed 141 invariants in 247 ms
[2024-05-20 15:40:42] [INFO ] [Real]Absence check using 71 positive place invariants in 246 ms returned sat
[2024-05-20 15:40:42] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 108 ms returned sat
[2024-05-20 15:41:03] [INFO ] After 23653ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2024-05-20 15:41:05] [INFO ] [Nat]Absence check using 71 positive place invariants in 193 ms returned sat
[2024-05-20 15:41:05] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 91 ms returned sat
[2024-05-20 15:41:28] [INFO ] After 20847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2024-05-20 15:41:28] [INFO ] State equation strengthened by 9730 read => feed constraints.
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2024-05-20 15:41:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-20 15:41:28] [INFO ] After 25328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
Fused 12 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 110 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions removed 374 transitions
Trivial Post-agglo rules discarded 374 transitions
Performed 374 trivial Post agglomeration. Transition count delta: 374
Iterating post reduction 0 with 374 rules applied. Total rules applied 374 place count 10642 transition count 19786
Reduce places removed 374 places and 0 transitions.
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Iterating post reduction 1 with 446 rules applied. Total rules applied 820 place count 10268 transition count 19714
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 892 place count 10196 transition count 19714
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 892 place count 10196 transition count 19697
Deduced a syphon composed of 17 places in 21 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 926 place count 10179 transition count 19697
Discarding 4714 places :
Symmetric choice reduction at 3 with 4714 rule applications. Total rules 5640 place count 5465 transition count 10269
Iterating global reduction 3 with 4714 rules applied. Total rules applied 10354 place count 5465 transition count 10269
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 5 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 10458 place count 5413 transition count 10217
Free-agglomeration rule applied 70 times.
Iterating global reduction 3 with 70 rules applied. Total rules applied 10528 place count 5413 transition count 10147
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 3 with 70 rules applied. Total rules applied 10598 place count 5343 transition count 10147
Partial Free-agglomeration rule applied 86 times.
Drop transitions removed 86 transitions
Iterating global reduction 4 with 86 rules applied. Total rules applied 10684 place count 5343 transition count 10147
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 10691 place count 5343 transition count 10147
Applied a total of 10691 rules in 7410 ms. Remains 5343 /10642 variables (removed 5299) and now considering 10147/20160 (removed 10013) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7413 ms. Remains : 5343/10642 places, 10147/20160 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 12) seen :3
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :1
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 10147 rows 5343 cols
[2024-05-20 15:41:36] [INFO ] Computed 141 invariants in 65 ms
[2024-05-20 15:41:37] [INFO ] [Real]Absence check using 71 positive place invariants in 103 ms returned sat
[2024-05-20 15:41:37] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 53 ms returned sat
[2024-05-20 15:41:43] [INFO ] After 6637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-20 15:41:44] [INFO ] [Nat]Absence check using 71 positive place invariants in 115 ms returned sat
[2024-05-20 15:41:44] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 57 ms returned sat
[2024-05-20 15:41:51] [INFO ] After 6884ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-20 15:41:52] [INFO ] State equation strengthened by 9829 read => feed constraints.
[2024-05-20 15:41:55] [INFO ] After 3973ms SMT Verify possible using 9829 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2024-05-20 15:41:59] [INFO ] After 7548ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 2563 ms.
[2024-05-20 15:42:02] [INFO ] After 18726ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 29 ms.
Support contains 34 out of 5343 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5343/5343 places, 10147/10147 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 5343 transition count 10132
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 5328 transition count 10132
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 5322 transition count 10120
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 5322 transition count 10120
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 106 place count 5290 transition count 10088
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 118 place count 5284 transition count 10088
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 127 place count 5284 transition count 10079
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 136 place count 5275 transition count 10079
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 5275 transition count 10079
Applied a total of 137 rules in 5905 ms. Remains 5275 /5343 variables (removed 68) and now considering 10079/10147 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5905 ms. Remains : 5275/5343 places, 10079/10147 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 6) seen :3
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10079 rows 5275 cols
[2024-05-20 15:42:08] [INFO ] Computed 141 invariants in 63 ms
[2024-05-20 15:42:09] [INFO ] [Real]Absence check using 71 positive place invariants in 95 ms returned sat
[2024-05-20 15:42:09] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 61 ms returned sat
[2024-05-20 15:42:09] [INFO ] After 961ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 15:42:10] [INFO ] [Nat]Absence check using 71 positive place invariants in 96 ms returned sat
[2024-05-20 15:42:10] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 58 ms returned sat
[2024-05-20 15:42:15] [INFO ] After 5204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-20 15:42:15] [INFO ] State equation strengthened by 9864 read => feed constraints.
[2024-05-20 15:42:18] [INFO ] After 2645ms SMT Verify possible using 9864 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-20 15:42:20] [INFO ] After 4469ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1175 ms.
[2024-05-20 15:42:21] [INFO ] After 11922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
Support contains 14 out of 5275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5275/5275 places, 10079/10079 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5275 transition count 10078
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 5274 transition count 10078
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 5273 transition count 10076
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 5273 transition count 10076
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 28 place count 5261 transition count 10064
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 5260 transition count 10064
Applied a total of 30 rules in 3716 ms. Remains 5260 /5275 variables (removed 15) and now considering 10064/10079 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3716 ms. Remains : 5260/5275 places, 10064/10079 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 272 ms. (steps per millisecond=36 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 76105 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76105 steps, saw 61529 distinct states, run finished after 3003 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 10064 rows 5260 cols
[2024-05-20 15:42:28] [INFO ] Computed 141 invariants in 61 ms
[2024-05-20 15:42:29] [INFO ] [Real]Absence check using 71 positive place invariants in 113 ms returned sat
[2024-05-20 15:42:29] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 60 ms returned sat
[2024-05-20 15:42:29] [INFO ] After 881ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-20 15:42:30] [INFO ] [Nat]Absence check using 71 positive place invariants in 115 ms returned sat
[2024-05-20 15:42:30] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 58 ms returned sat
[2024-05-20 15:42:35] [INFO ] After 4944ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-20 15:42:35] [INFO ] State equation strengthened by 9875 read => feed constraints.
[2024-05-20 15:42:37] [INFO ] After 2084ms SMT Verify possible using 9875 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-20 15:42:38] [INFO ] After 3076ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 666 ms.
[2024-05-20 15:42:39] [INFO ] After 9621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
Support contains 13 out of 5260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5260/5260 places, 10064/10064 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 5259 transition count 10063
Applied a total of 2 rules in 1892 ms. Remains 5259 /5260 variables (removed 1) and now considering 10063/10064 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1892 ms. Remains : 5259/5260 places, 10063/10064 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 79929 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 79929 steps, saw 62469 distinct states, run finished after 3001 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 10063 rows 5259 cols
[2024-05-20 15:42:44] [INFO ] Computed 141 invariants in 65 ms
[2024-05-20 15:42:44] [INFO ] [Real]Absence check using 71 positive place invariants in 98 ms returned sat
[2024-05-20 15:42:44] [INFO ] [Real]Absence check using 71 positive and 70 generalized place invariants in 65 ms returned sat
[2024-05-20 15:42:45] [INFO ] After 799ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:42:45] [INFO ] [Nat]Absence check using 71 positive place invariants in 98 ms returned sat
[2024-05-20 15:42:45] [INFO ] [Nat]Absence check using 71 positive and 70 generalized place invariants in 58 ms returned sat
[2024-05-20 15:42:50] [INFO ] After 4674ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 15:42:50] [INFO ] State equation strengthened by 9876 read => feed constraints.
[2024-05-20 15:42:52] [INFO ] After 1794ms SMT Verify possible using 9876 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:42:53] [INFO ] After 2447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 661 ms.
[2024-05-20 15:42:53] [INFO ] After 8674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 13 out of 5259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5259/5259 places, 10063/10063 transitions.
Applied a total of 0 rules in 1064 ms. Remains 5259 /5259 variables (removed 0) and now considering 10063/10063 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1065 ms. Remains : 5259/5259 places, 10063/10063 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5259/5259 places, 10063/10063 transitions.
Applied a total of 0 rules in 1103 ms. Remains 5259 /5259 variables (removed 0) and now considering 10063/10063 (removed 0) transitions.
[2024-05-20 15:42:55] [INFO ] Invariant cache hit.
[2024-05-20 15:42:59] [INFO ] Implicit Places using invariants in 4082 ms returned []
Implicit Place search using SMT only with invariants took 4084 ms to find 0 implicit places.
[2024-05-20 15:42:59] [INFO ] Invariant cache hit.
[2024-05-20 15:43:06] [INFO ] Dead Transitions using invariants and state equation in 6672 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11863 ms. Remains : 5259/5259 places, 10063/10063 transitions.
Graph (trivial) has 9659 edges and 5259 vertex of which 4852 / 5259 are part of one of the 68 SCC in 7 ms
Free SCC test removed 4784 places
Drop transitions removed 9469 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 9479 transitions.
Graph (complete) has 1040 edges and 475 vertex of which 196 are kept as prefixes of interest. Removing 279 places using SCC suffix rule.2 ms
Discarding 279 places :
Also discarding 173 output transitions
Drop transitions removed 173 transitions
Ensure Unique test removed 1 places
Drop transitions removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 195 transition count 193
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 1 with 278 rules applied. Total rules applied 499 place count 53 transition count 57
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 499 place count 53 transition count 50
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 513 place count 46 transition count 50
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 515 place count 44 transition count 48
Iterating global reduction 2 with 2 rules applied. Total rules applied 517 place count 44 transition count 48
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 521 place count 44 transition count 44
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 531 place count 37 transition count 41
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 534 place count 37 transition count 38
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 537 place count 34 transition count 38
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 544 place count 34 transition count 38
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 551 place count 27 transition count 31
Iterating global reduction 4 with 7 rules applied. Total rules applied 558 place count 27 transition count 31
Applied a total of 558 rules in 59 ms. Remains 27 /5259 variables (removed 5232) and now considering 31/10063 (removed 10032) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 27 cols
[2024-05-20 15:43:06] [INFO ] Computed 8 invariants in 0 ms
[2024-05-20 15:43:06] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-20 15:43:06] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 15:43:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-20 15:43:06] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-20 15:43:06] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-20 15:43:06] [INFO ] After 41ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 15:43:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-20 15:43:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5259 places, 10063 transitions and 40298 arcs took 47 ms.
[2024-05-20 15:43:07] [INFO ] Flatten gal took : 516 ms
Total runtime 150390 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-070
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityFireability

FORMULA CANConstruction-PT-070-ReachabilityFireability-2024-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716219797000

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 7 (type EXCL) for 0 CANConstruction-PT-070-ReachabilityFireability-2024-02
lola: time limit : 3592 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 CANConstruction-PT-070-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 CANConstruction-PT-070-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 CANConstruction-PT-070-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-070-ReachabilityFireability-2024-02: EF 0 1 4 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 EF FNDP 0/1796 0/5 CANConstruction-PT-070-ReachabilityFireability-2024-02 --
4 EF STEQ 0/3592 0/5 CANConstruction-PT-070-ReachabilityFireability-2024-02 sara not yet started (preprocessing).
6 EF SRCH 0/3592 1/5 CANConstruction-PT-070-ReachabilityFireability-2024-02 --
7 EF EXCL 0/3592 1/32 CANConstruction-PT-070-ReachabilityFireability-2024-02 --

Time elapsed: 8 secs. Pages in use: 2
# running tasks: 4 of 4 Visible: 1
lola: FINISHED task # 3 (type FNDP) for CANConstruction-PT-070-ReachabilityFireability-2024-02
lola: result : true
lola: fired transitions : 9
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 4 (type EQUN) for CANConstruction-PT-070-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 6 (type SRCH) for CANConstruction-PT-070-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 7 (type EXCL) for CANConstruction-PT-070-ReachabilityFireability-2024-02 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-070-ReachabilityFireability-2024-02: EF true findpath


Time elapsed: 8 secs. Pages in use: 2

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="CANConstruction-PT-070"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is CANConstruction-PT-070, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r087-tall-171620521400040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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