Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r171-tall-167838858700485.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is FlexibleBarrier-PT-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858700485
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 241K Mar 5 18:22 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-08b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-08b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1679475992898

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 09:06:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 09:06:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:06:34] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-22 09:06:34] [INFO ] Transformed 920 places.
[2023-03-22 09:06:34] [INFO ] Transformed 1057 transitions.
[2023-03-22 09:06:34] [INFO ] Found NUPN structural information;
[2023-03-22 09:06:34] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
// Phase 1: matrix 1057 rows 920 cols
[2023-03-22 09:06:34] [INFO ] Computed 10 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 159 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 16) seen :8
FORMULA FlexibleBarrier-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
[2023-03-22 09:06:34] [INFO ] Invariant cache hit.
[2023-03-22 09:06:35] [INFO ] [Real]Absence check using 10 positive place invariants in 25 ms returned sat
[2023-03-22 09:06:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:35] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2023-03-22 09:06:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:06:35] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 09:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:36] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-22 09:06:36] [INFO ] Deduced a trap composed of 298 places in 245 ms of which 3 ms to minimize.
[2023-03-22 09:06:36] [INFO ] Deduced a trap composed of 283 places in 210 ms of which 1 ms to minimize.
[2023-03-22 09:06:36] [INFO ] Deduced a trap composed of 83 places in 203 ms of which 1 ms to minimize.
[2023-03-22 09:06:37] [INFO ] Deduced a trap composed of 84 places in 213 ms of which 1 ms to minimize.
[2023-03-22 09:06:37] [INFO ] Deduced a trap composed of 117 places in 239 ms of which 1 ms to minimize.
[2023-03-22 09:06:37] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 0 ms to minimize.
[2023-03-22 09:06:37] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
[2023-03-22 09:06:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1671 ms
[2023-03-22 09:06:37] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 63 ms.
[2023-03-22 09:06:40] [INFO ] Deduced a trap composed of 92 places in 290 ms of which 1 ms to minimize.
[2023-03-22 09:06:40] [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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-22 09:06:41] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 09:06:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:41] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-22 09:06:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:06:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-22 09:06:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:41] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2023-03-22 09:06:42] [INFO ] Deduced a trap composed of 358 places in 219 ms of which 1 ms to minimize.
[2023-03-22 09:06:42] [INFO ] Deduced a trap composed of 290 places in 192 ms of which 1 ms to minimize.
[2023-03-22 09:06:42] [INFO ] Deduced a trap composed of 317 places in 199 ms of which 1 ms to minimize.
[2023-03-22 09:06:42] [INFO ] Deduced a trap composed of 319 places in 168 ms of which 1 ms to minimize.
[2023-03-22 09:06:42] [INFO ] Deduced a trap composed of 289 places in 162 ms of which 1 ms to minimize.
[2023-03-22 09:06:43] [INFO ] Deduced a trap composed of 312 places in 204 ms of which 1 ms to minimize.
[2023-03-22 09:06:43] [INFO ] Deduced a trap composed of 284 places in 201 ms of which 1 ms to minimize.
[2023-03-22 09:06:43] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1609 ms
[2023-03-22 09:06:43] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 67 ms.
[2023-03-22 09:06:46] [INFO ] Deduced a trap composed of 92 places in 287 ms of which 1 ms to minimize.
[2023-03-22 09:06:46] [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 1
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-22 09:06:46] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-22 09:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:47] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2023-03-22 09:06:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:06:47] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 09:06:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:47] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2023-03-22 09:06:47] [INFO ] Deduced a trap composed of 359 places in 200 ms of which 1 ms to minimize.
[2023-03-22 09:06:48] [INFO ] Deduced a trap composed of 341 places in 184 ms of which 1 ms to minimize.
[2023-03-22 09:06:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 490 ms
[2023-03-22 09:06:48] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 68 ms.
[2023-03-22 09:06:51] [INFO ] Added : 337 causal constraints over 68 iterations in 3707 ms. Result :sat
Minimization took 205 ms.
[2023-03-22 09:06:52] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-22 09:06:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:52] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2023-03-22 09:06:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:06:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-22 09:06:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:52] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2023-03-22 09:06:53] [INFO ] Deduced a trap composed of 85 places in 71 ms of which 1 ms to minimize.
[2023-03-22 09:06:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2023-03-22 09:06:53] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 51 ms.
[2023-03-22 09:06:56] [INFO ] Deduced a trap composed of 310 places in 275 ms of which 3 ms to minimize.
[2023-03-22 09:06:57] [INFO ] Deduced a trap composed of 307 places in 264 ms of which 1 ms to minimize.
[2023-03-22 09:06:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 686 ms
[2023-03-22 09:06:57] [INFO ] Added : 326 causal constraints over 67 iterations in 4364 ms. Result :sat
Minimization took 63 ms.
[2023-03-22 09:06:57] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 09:06:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:58] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-22 09:06:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:06:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 09:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:06:58] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2023-03-22 09:06:58] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 56 ms.
[2023-03-22 09:07:02] [INFO ] Deduced a trap composed of 310 places in 201 ms of which 1 ms to minimize.
[2023-03-22 09:07:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2023-03-22 09:07:02] [INFO ] Added : 324 causal constraints over 65 iterations in 3834 ms. Result :sat
Minimization took 180 ms.
[2023-03-22 09:07:02] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-22 09:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:07:02] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-22 09:07:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:07:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 09:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:07:03] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2023-03-22 09:07:03] [INFO ] Deduced a trap composed of 313 places in 220 ms of which 1 ms to minimize.
[2023-03-22 09:07:03] [INFO ] Deduced a trap composed of 319 places in 194 ms of which 1 ms to minimize.
[2023-03-22 09:07:04] [INFO ] Deduced a trap composed of 282 places in 184 ms of which 1 ms to minimize.
[2023-03-22 09:07:04] [INFO ] Deduced a trap composed of 312 places in 180 ms of which 0 ms to minimize.
[2023-03-22 09:07:04] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 1 ms to minimize.
[2023-03-22 09:07:04] [INFO ] Deduced a trap composed of 307 places in 195 ms of which 1 ms to minimize.
[2023-03-22 09:07:05] [INFO ] Deduced a trap composed of 284 places in 179 ms of which 1 ms to minimize.
[2023-03-22 09:07:05] [INFO ] Deduced a trap composed of 311 places in 222 ms of which 1 ms to minimize.
[2023-03-22 09:07:05] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1865 ms
[2023-03-22 09:07:05] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 51 ms.
[2023-03-22 09:07:08] [INFO ] Added : 265 causal constraints over 53 iterations in 2695 ms. Result :unknown
[2023-03-22 09:07:08] [INFO ] [Real]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 09:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:07:08] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-03-22 09:07:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:07:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-22 09:07:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:07:08] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2023-03-22 09:07:09] [INFO ] Deduced a trap composed of 295 places in 193 ms of which 1 ms to minimize.
[2023-03-22 09:07:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2023-03-22 09:07:09] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 57 ms.
[2023-03-22 09:07:13] [INFO ] Deduced a trap composed of 281 places in 179 ms of which 1 ms to minimize.
[2023-03-22 09:07:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 276 ms
[2023-03-22 09:07:13] [INFO ] Deduced a trap composed of 92 places in 307 ms of which 0 ms to minimize.
[2023-03-22 09:07:13] [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 6
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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
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)
[2023-03-22 09:07:13] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2023-03-22 09:07:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:07:14] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-22 09:07:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:07:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-22 09:07:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:07:14] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2023-03-22 09:07:14] [INFO ] Deduced a trap composed of 150 places in 193 ms of which 1 ms to minimize.
[2023-03-22 09:07:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-22 09:07:15] [INFO ] Computed and/alt/rep : 968/1629/968 causal constraints (skipped 88 transitions) in 58 ms.
[2023-03-22 09:07:18] [INFO ] Added : 320 causal constraints over 64 iterations in 3420 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 887 edges and 920 vertex of which 50 / 920 are part of one of the 8 SCC in 6 ms
Free SCC test removed 42 places
Drop transitions removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 239 place count 878 transition count 768
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 640 transition count 767
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 639 transition count 767
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 479 place count 639 transition count 713
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 587 place count 585 transition count 713
Discarding 313 places :
Symmetric choice reduction at 3 with 313 rule applications. Total rules 900 place count 272 transition count 400
Iterating global reduction 3 with 313 rules applied. Total rules applied 1213 place count 272 transition count 400
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1213 place count 272 transition count 392
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 1229 place count 264 transition count 392
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 1276 place count 217 transition count 345
Iterating global reduction 3 with 47 rules applied. Total rules applied 1323 place count 217 transition count 345
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 3 with 46 rules applied. Total rules applied 1369 place count 217 transition count 299
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1453 place count 175 transition count 257
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 1469 place count 175 transition count 241
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1477 place count 167 transition count 233
Iterating global reduction 5 with 8 rules applied. Total rules applied 1485 place count 167 transition count 233
Free-agglomeration rule applied 118 times.
Iterating global reduction 5 with 118 rules applied. Total rules applied 1603 place count 167 transition count 115
Reduce places removed 118 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 131 edges and 49 vertex of which 39 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 167 rules applied. Total rules applied 1770 place count 39 transition count 67
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 1784 place count 39 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1785 place count 39 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1786 place count 38 transition count 51
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 37 vertex of which 12 / 37 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1788 place count 31 transition count 51
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1800 place count 31 transition count 39
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 6 Pre rules applied. Total rules applied 1800 place count 31 transition count 33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 1812 place count 25 transition count 33
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1817 place count 25 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1827 place count 20 transition count 23
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 1832 place count 20 transition count 18
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 13 rules applied. Total rules applied 1845 place count 12 transition count 13
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1846 place count 12 transition count 13
Applied a total of 1846 rules in 160 ms. Remains 12 /920 variables (removed 908) and now considering 13/1057 (removed 1044) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 12/920 places, 13/1057 transitions.
// Phase 1: matrix 13 rows 12 cols
[2023-03-22 09:07:19] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=1766 ) properties (out of 5) seen :5
FORMULA FlexibleBarrier-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 45494 ms.
ITS solved all properties within timeout

BK_STOP 1679476040617

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-08b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is FlexibleBarrier-PT-08b, 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 r171-tall-167838858700485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-08b.tgz
mv FlexibleBarrier-PT-08b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;