About the Execution of 2023-gold for FlexibleBarrier-PT-10b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
414.987 | 75664.00 | 91552.00 | 371.20 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r197-tall-171640624700036.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 FlexibleBarrier-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640624700036
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 748K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 07:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 374K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-10b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716495826565
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=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-23 20:23:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 20:23:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 20:23:48] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-05-23 20:23:48] [INFO ] Transformed 1402 places.
[2024-05-23 20:23:48] [INFO ] Transformed 1613 transitions.
[2024-05-23 20:23:48] [INFO ] Found NUPN structural information;
[2024-05-23 20:23:48] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1613 rows 1402 cols
[2024-05-23 20:23:48] [INFO ] Computed 12 invariants in 44 ms
Incomplete random walk after 10000 steps, including 132 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :3
FORMULA FlexibleBarrier-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :1
FORMULA FlexibleBarrier-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 12) seen :0
[2024-05-23 20:23:48] [INFO ] Invariant cache hit.
[2024-05-23 20:23:49] [INFO ] [Real]Absence check using 12 positive place invariants in 26 ms returned sat
[2024-05-23 20:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:49] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2024-05-23 20:23:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:23:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-23 20:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:50] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2024-05-23 20:23:50] [INFO ] Deduced a trap composed of 199 places in 288 ms of which 4 ms to minimize.
[2024-05-23 20:23:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 432 ms
[2024-05-23 20:23:50] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 96 ms.
[2024-05-23 20:23:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
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-23 20:23:54] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2024-05-23 20:23:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:55] [INFO ] [Real]Absence check using state equation in 482 ms returned sat
[2024-05-23 20:23:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:23:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-23 20:23:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:23:56] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2024-05-23 20:23:56] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 89 ms.
[2024-05-23 20:24:00] [INFO ] Added : 262 causal constraints over 53 iterations in 3821 ms. Result :sat
Minimization took 296 ms.
[2024-05-23 20:24:00] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2024-05-23 20:24:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:01] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2024-05-23 20:24:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:01] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2024-05-23 20:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:01] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2024-05-23 20:24:02] [INFO ] Deduced a trap composed of 515 places in 399 ms of which 1 ms to minimize.
[2024-05-23 20:24:02] [INFO ] Deduced a trap composed of 494 places in 394 ms of which 1 ms to minimize.
[2024-05-23 20:24:03] [INFO ] Deduced a trap composed of 467 places in 370 ms of which 2 ms to minimize.
[2024-05-23 20:24:03] [INFO ] Deduced a trap composed of 481 places in 312 ms of which 1 ms to minimize.
[2024-05-23 20:24:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1722 ms
[2024-05-23 20:24:03] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 88 ms.
[2024-05-23 20:24:06] [INFO ] Deduced a trap composed of 14 places in 591 ms of which 1 ms to minimize.
[2024-05-23 20:24:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
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-23 20:24:06] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-23 20:24:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:07] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2024-05-23 20:24:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-23 20:24:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:08] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2024-05-23 20:24:08] [INFO ] Deduced a trap composed of 486 places in 385 ms of which 1 ms to minimize.
[2024-05-23 20:24:08] [INFO ] Deduced a trap composed of 62 places in 352 ms of which 1 ms to minimize.
[2024-05-23 20:24:09] [INFO ] Deduced a trap composed of 477 places in 360 ms of which 1 ms to minimize.
[2024-05-23 20:24:09] [INFO ] Deduced a trap composed of 476 places in 328 ms of which 0 ms to minimize.
[2024-05-23 20:24:10] [INFO ] Deduced a trap composed of 507 places in 293 ms of which 1 ms to minimize.
[2024-05-23 20:24:10] [INFO ] Deduced a trap composed of 476 places in 263 ms of which 1 ms to minimize.
[2024-05-23 20:24:10] [INFO ] Deduced a trap composed of 502 places in 291 ms of which 1 ms to minimize.
[2024-05-23 20:24:11] [INFO ] Deduced a trap composed of 500 places in 262 ms of which 1 ms to minimize.
[2024-05-23 20:24:11] [INFO ] Deduced a trap composed of 479 places in 238 ms of which 1 ms to minimize.
[2024-05-23 20:24:11] [INFO ] Deduced a trap composed of 487 places in 286 ms of which 1 ms to minimize.
[2024-05-23 20:24:12] [INFO ] Deduced a trap composed of 445 places in 237 ms of which 1 ms to minimize.
[2024-05-23 20:24:12] [INFO ] Deduced a trap composed of 482 places in 235 ms of which 0 ms to minimize.
[2024-05-23 20:24:12] [INFO ] Deduced a trap composed of 440 places in 215 ms of which 1 ms to minimize.
[2024-05-23 20:24:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
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-23 20:24:12] [INFO ] [Real]Absence check using 12 positive place invariants in 25 ms returned sat
[2024-05-23 20:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:13] [INFO ] [Real]Absence check using state equation in 508 ms returned sat
[2024-05-23 20:24:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:13] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2024-05-23 20:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:14] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2024-05-23 20:24:14] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 85 ms.
[2024-05-23 20:24:18] [INFO ] Deduced a trap composed of 145 places in 146 ms of which 1 ms to minimize.
[2024-05-23 20:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-05-23 20:24:18] [INFO ] Added : 270 causal constraints over 54 iterations in 4136 ms. Result :sat
Minimization took 148 ms.
[2024-05-23 20:24:18] [INFO ] [Real]Absence check using 12 positive place invariants in 26 ms returned sat
[2024-05-23 20:24:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:19] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2024-05-23 20:24:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-23 20:24:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:19] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2024-05-23 20:24:20] [INFO ] Deduced a trap composed of 542 places in 354 ms of which 1 ms to minimize.
[2024-05-23 20:24:20] [INFO ] Deduced a trap composed of 70 places in 357 ms of which 4 ms to minimize.
[2024-05-23 20:24:20] [INFO ] Deduced a trap composed of 97 places in 354 ms of which 0 ms to minimize.
[2024-05-23 20:24:21] [INFO ] Deduced a trap composed of 62 places in 340 ms of which 0 ms to minimize.
[2024-05-23 20:24:21] [INFO ] Deduced a trap composed of 466 places in 363 ms of which 1 ms to minimize.
[2024-05-23 20:24:22] [INFO ] Deduced a trap composed of 481 places in 370 ms of which 1 ms to minimize.
[2024-05-23 20:24:22] [INFO ] Deduced a trap composed of 101 places in 361 ms of which 1 ms to minimize.
[2024-05-23 20:24:23] [INFO ] Deduced a trap composed of 103 places in 367 ms of which 1 ms to minimize.
[2024-05-23 20:24:23] [INFO ] Deduced a trap composed of 493 places in 329 ms of which 1 ms to minimize.
[2024-05-23 20:24:23] [INFO ] Deduced a trap composed of 482 places in 303 ms of which 0 ms to minimize.
[2024-05-23 20:24:24] [INFO ] Deduced a trap composed of 516 places in 307 ms of which 1 ms to minimize.
[2024-05-23 20:24:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
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-23 20:24:24] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2024-05-23 20:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:24] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2024-05-23 20:24:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:25] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2024-05-23 20:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:25] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2024-05-23 20:24:26] [INFO ] Deduced a trap composed of 461 places in 442 ms of which 1 ms to minimize.
[2024-05-23 20:24:26] [INFO ] Deduced a trap composed of 174 places in 401 ms of which 1 ms to minimize.
[2024-05-23 20:24:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 992 ms
[2024-05-23 20:24:26] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 71 ms.
[2024-05-23 20:24:29] [INFO ] Added : 245 causal constraints over 49 iterations in 3359 ms. Result :unknown
[2024-05-23 20:24:30] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2024-05-23 20:24:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:30] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2024-05-23 20:24:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:30] [INFO ] [Nat]Absence check using 12 positive place invariants in 22 ms returned sat
[2024-05-23 20:24:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:31] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2024-05-23 20:24:31] [INFO ] Deduced a trap composed of 200 places in 406 ms of which 2 ms to minimize.
[2024-05-23 20:24:32] [INFO ] Deduced a trap composed of 62 places in 388 ms of which 6 ms to minimize.
[2024-05-23 20:24:32] [INFO ] Deduced a trap composed of 489 places in 404 ms of which 1 ms to minimize.
[2024-05-23 20:24:33] [INFO ] Deduced a trap composed of 572 places in 360 ms of which 1 ms to minimize.
[2024-05-23 20:24:33] [INFO ] Deduced a trap composed of 475 places in 336 ms of which 0 ms to minimize.
[2024-05-23 20:24:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2201 ms
[2024-05-23 20:24:33] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 80 ms.
[2024-05-23 20:24:36] [INFO ] Deduced a trap composed of 14 places in 573 ms of which 1 ms to minimize.
[2024-05-23 20:24:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
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-23 20:24:36] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2024-05-23 20:24:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:36] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2024-05-23 20:24:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:37] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2024-05-23 20:24:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:37] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2024-05-23 20:24:38] [INFO ] Deduced a trap composed of 553 places in 386 ms of which 1 ms to minimize.
[2024-05-23 20:24:38] [INFO ] Deduced a trap composed of 70 places in 417 ms of which 1 ms to minimize.
[2024-05-23 20:24:39] [INFO ] Deduced a trap composed of 96 places in 384 ms of which 1 ms to minimize.
[2024-05-23 20:24:39] [INFO ] Deduced a trap composed of 492 places in 348 ms of which 1 ms to minimize.
[2024-05-23 20:24:39] [INFO ] Deduced a trap composed of 181 places in 338 ms of which 1 ms to minimize.
[2024-05-23 20:24:40] [INFO ] Deduced a trap composed of 341 places in 337 ms of which 1 ms to minimize.
[2024-05-23 20:24:40] [INFO ] Deduced a trap composed of 498 places in 337 ms of which 0 ms to minimize.
[2024-05-23 20:24:41] [INFO ] Deduced a trap composed of 244 places in 326 ms of which 1 ms to minimize.
[2024-05-23 20:24:41] [INFO ] Deduced a trap composed of 458 places in 345 ms of which 0 ms to minimize.
[2024-05-23 20:24:41] [INFO ] Deduced a trap composed of 509 places in 346 ms of which 1 ms to minimize.
[2024-05-23 20:24:42] [INFO ] Deduced a trap composed of 478 places in 319 ms of which 1 ms to minimize.
[2024-05-23 20:24:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
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-23 20:24:42] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2024-05-23 20:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:42] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2024-05-23 20:24:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:43] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-23 20:24:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:43] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2024-05-23 20:24:43] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 79 ms.
[2024-05-23 20:24:47] [INFO ] Added : 267 causal constraints over 54 iterations in 3912 ms. Result :sat
Minimization took 277 ms.
[2024-05-23 20:24:48] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2024-05-23 20:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:48] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2024-05-23 20:24:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-23 20:24:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:49] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2024-05-23 20:24:49] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 75 ms.
[2024-05-23 20:24:52] [INFO ] Deduced a trap composed of 481 places in 298 ms of which 1 ms to minimize.
[2024-05-23 20:24:52] [INFO ] Deduced a trap composed of 483 places in 284 ms of which 1 ms to minimize.
[2024-05-23 20:24:53] [INFO ] Deduced a trap composed of 451 places in 273 ms of which 1 ms to minimize.
[2024-05-23 20:24:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1112 ms
[2024-05-23 20:24:53] [INFO ] Added : 204 causal constraints over 41 iterations in 4023 ms. Result :sat
Minimization took 256 ms.
[2024-05-23 20:24:53] [INFO ] [Real]Absence check using 12 positive place invariants in 20 ms returned sat
[2024-05-23 20:24:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:54] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2024-05-23 20:24:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 20:24:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2024-05-23 20:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-23 20:24:55] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2024-05-23 20:24:55] [INFO ] Deduced a trap composed of 215 places in 386 ms of which 1 ms to minimize.
[2024-05-23 20:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 494 ms
[2024-05-23 20:24:55] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 78 ms.
[2024-05-23 20:24:58] [INFO ] Added : 232 causal constraints over 47 iterations in 3376 ms. Result :sat
Minimization took 272 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1357 edges and 1402 vertex of which 62 / 1402 are part of one of the 10 SCC in 7 ms
Free SCC test removed 52 places
Drop transitions removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions removed 354 transitions
Trivial Post-agglo rules discarded 354 transitions
Performed 354 trivial Post agglomeration. Transition count delta: 354
Iterating post reduction 0 with 354 rules applied. Total rules applied 355 place count 1350 transition count 1196
Reduce places removed 354 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 356 rules applied. Total rules applied 711 place count 996 transition count 1194
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 713 place count 994 transition count 1194
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 713 place count 994 transition count 1107
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 887 place count 907 transition count 1107
Discarding 506 places :
Symmetric choice reduction at 3 with 506 rule applications. Total rules 1393 place count 401 transition count 601
Iterating global reduction 3 with 506 rules applied. Total rules applied 1899 place count 401 transition count 601
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1899 place count 401 transition count 593
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1915 place count 393 transition count 593
Discarding 79 places :
Symmetric choice reduction at 3 with 79 rule applications. Total rules 1994 place count 314 transition count 514
Iterating global reduction 3 with 79 rules applied. Total rules applied 2073 place count 314 transition count 514
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Iterating post reduction 3 with 77 rules applied. Total rules applied 2150 place count 314 transition count 437
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 2256 place count 261 transition count 384
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2276 place count 261 transition count 364
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2286 place count 251 transition count 354
Iterating global reduction 5 with 10 rules applied. Total rules applied 2296 place count 251 transition count 354
Free-agglomeration rule applied 186 times.
Iterating global reduction 5 with 186 rules applied. Total rules applied 2482 place count 251 transition count 168
Reduce places removed 186 places and 0 transitions.
Drop transitions removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 5 with 265 rules applied. Total rules applied 2747 place count 65 transition count 89
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2748 place count 65 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2749 place count 64 transition count 88
Applied a total of 2749 rules in 248 ms. Remains 64 /1402 variables (removed 1338) and now considering 88/1613 (removed 1525) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 248 ms. Remains : 64/1402 places, 88/1613 transitions.
// Phase 1: matrix 88 rows 64 cols
[2024-05-23 20:24:59] [INFO ] Computed 12 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1546 ms. (steps per millisecond=646 ) properties (out of 8) seen :8
FORMULA FlexibleBarrier-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 73197 ms.
BK_STOP 1716495902229
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="FlexibleBarrier-PT-10b"
export BK_EXAMINATION="UpperBounds"
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 FlexibleBarrier-PT-10b, 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 r197-tall-171640624700036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10b.tgz
mv FlexibleBarrier-PT-10b 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 ;