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.r167-tall-167838853200501.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 lolaxred
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 r167-tall-167838853200501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 792K
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 25 12:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 12:21 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 374K 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-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 1678486985384

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 22:23:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 22:23:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:23:06] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2023-03-10 22:23:06] [INFO ] Transformed 1402 places.
[2023-03-10 22:23:06] [INFO ] Transformed 1613 transitions.
[2023-03-10 22:23:06] [INFO ] Found NUPN structural information;
[2023-03-10 22:23:06] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 164 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 1613 rows 1402 cols
[2023-03-10 22:23:07] [INFO ] Computed 12 place invariants in 41 ms
Incomplete random walk after 10000 steps, including 133 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :4
FORMULA FlexibleBarrier-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) 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 :1
FORMULA FlexibleBarrier-PT-10b-UpperBounds-08 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 11) 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 11) seen :0
[2023-03-10 22:23:07] [INFO ] Invariant cache hit.
[2023-03-10 22:23:07] [INFO ] [Real]Absence check using 12 positive place invariants in 29 ms returned sat
[2023-03-10 22:23:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:08] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2023-03-10 22:23:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:23:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2023-03-10 22:23:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:09] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-10 22:23:09] [INFO ] Deduced a trap composed of 611 places in 580 ms of which 7 ms to minimize.
[2023-03-10 22:23:10] [INFO ] Deduced a trap composed of 70 places in 423 ms of which 1 ms to minimize.
[2023-03-10 22:23:10] [INFO ] Deduced a trap composed of 97 places in 423 ms of which 1 ms to minimize.
[2023-03-10 22:23:11] [INFO ] Deduced a trap composed of 468 places in 358 ms of which 2 ms to minimize.
[2023-03-10 22:23:11] [INFO ] Deduced a trap composed of 533 places in 363 ms of which 1 ms to minimize.
[2023-03-10 22:23:11] [INFO ] Deduced a trap composed of 222 places in 343 ms of which 1 ms to minimize.
[2023-03-10 22:23:12] [INFO ] Deduced a trap composed of 101 places in 334 ms of which 2 ms to minimize.
[2023-03-10 22:23:12] [INFO ] Deduced a trap composed of 103 places in 343 ms of which 0 ms to minimize.
[2023-03-10 22:23:13] [INFO ] Deduced a trap composed of 489 places in 328 ms of which 1 ms to minimize.
[2023-03-10 22:23:13] [INFO ] Deduced a trap composed of 513 places in 369 ms of which 1 ms to minimize.
[2023-03-10 22:23: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 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.verifyPossible(DeadlockTester.java:916)
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-10 22:23:13] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2023-03-10 22:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:14] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2023-03-10 22:23:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:23:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 35 ms returned sat
[2023-03-10 22:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:15] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2023-03-10 22:23:16] [INFO ] Deduced a trap composed of 542 places in 430 ms of which 1 ms to minimize.
[2023-03-10 22:23:16] [INFO ] Deduced a trap composed of 467 places in 698 ms of which 2 ms to minimize.
[2023-03-10 22:23:17] [INFO ] Deduced a trap composed of 494 places in 362 ms of which 1 ms to minimize.
[2023-03-10 22:23:17] [INFO ] Deduced a trap composed of 62 places in 428 ms of which 1 ms to minimize.
[2023-03-10 22:23:18] [INFO ] Deduced a trap composed of 512 places in 360 ms of which 1 ms to minimize.
[2023-03-10 22:23:18] [INFO ] Deduced a trap composed of 468 places in 359 ms of which 1 ms to minimize.
[2023-03-10 22:23:19] [INFO ] Deduced a trap composed of 479 places in 488 ms of which 1 ms to minimize.
[2023-03-10 22:23:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3624 ms
[2023-03-10 22:23:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:999)
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-10 22:23:19] [INFO ] [Real]Absence check using 12 positive place invariants in 22 ms returned sat
[2023-03-10 22:23:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:20] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2023-03-10 22:23:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:23:20] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-10 22:23:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:20] [INFO ] [Nat]Absence check using state equation in 504 ms returned sat
[2023-03-10 22:23:21] [INFO ] Deduced a trap composed of 519 places in 377 ms of which 1 ms to minimize.
[2023-03-10 22:23:21] [INFO ] Deduced a trap composed of 172 places in 394 ms of which 1 ms to minimize.
[2023-03-10 22:23:22] [INFO ] Deduced a trap composed of 104 places in 356 ms of which 1 ms to minimize.
[2023-03-10 22:23:22] [INFO ] Deduced a trap composed of 106 places in 353 ms of which 1 ms to minimize.
[2023-03-10 22:23:23] [INFO ] Deduced a trap composed of 177 places in 383 ms of which 1 ms to minimize.
[2023-03-10 22:23:23] [INFO ] Deduced a trap composed of 101 places in 358 ms of which 1 ms to minimize.
[2023-03-10 22:23:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2604 ms
[2023-03-10 22:23:23] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 117 ms.
[2023-03-10 22:23:25] [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.refineWithCausalOrder(DeadlockTester.java:1186)
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-10 22:23:25] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-10 22:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:25] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2023-03-10 22:23:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:23:26] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-10 22:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:26] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2023-03-10 22:23:27] [INFO ] Deduced a trap composed of 243 places in 428 ms of which 1 ms to minimize.
[2023-03-10 22:23:27] [INFO ] Deduced a trap composed of 198 places in 388 ms of which 1 ms to minimize.
[2023-03-10 22:23:28] [INFO ] Deduced a trap composed of 490 places in 402 ms of which 1 ms to minimize.
[2023-03-10 22:23:28] [INFO ] Deduced a trap composed of 220 places in 316 ms of which 1 ms to minimize.
[2023-03-10 22:23:28] [INFO ] Deduced a trap composed of 108 places in 339 ms of which 1 ms to minimize.
[2023-03-10 22:23:29] [INFO ] Deduced a trap composed of 102 places in 335 ms of which 1 ms to minimize.
[2023-03-10 22:23:29] [INFO ] Deduced a trap composed of 172 places in 343 ms of which 1 ms to minimize.
[2023-03-10 22:23:30] [INFO ] Deduced a trap composed of 101 places in 362 ms of which 2 ms to minimize.
[2023-03-10 22:23:30] [INFO ] Deduced a trap composed of 96 places in 207 ms of which 2 ms to minimize.
[2023-03-10 22:23:30] [INFO ] Deduced a trap composed of 105 places in 394 ms of which 1 ms to minimize.
[2023-03-10 22:23:31] [INFO ] Deduced a trap composed of 497 places in 357 ms of which 1 ms to minimize.
[2023-03-10 22:23:31] [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:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
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-10 22:23:31] [INFO ] [Real]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-10 22:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:32] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-10 22:23:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:23:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-10 22:23:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:32] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2023-03-10 22:23:33] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 143 ms.
[2023-03-10 22:23:37] [INFO ] Added : 261 causal constraints over 53 iterations in 4135 ms. Result :sat
Minimization took 54 ms.
[2023-03-10 22:23:37] [INFO ] [Real]Absence check using 12 positive place invariants in 21 ms returned sat
[2023-03-10 22:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:37] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2023-03-10 22:23:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:23:38] [INFO ] [Nat]Absence check using 12 positive place invariants in 23 ms returned sat
[2023-03-10 22:23:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:38] [INFO ] [Nat]Absence check using state equation in 520 ms returned sat
[2023-03-10 22:23:39] [INFO ] Deduced a trap composed of 503 places in 493 ms of which 1 ms to minimize.
[2023-03-10 22:23:39] [INFO ] Deduced a trap composed of 500 places in 354 ms of which 1 ms to minimize.
[2023-03-10 22:23:40] [INFO ] Deduced a trap composed of 466 places in 341 ms of which 1 ms to minimize.
[2023-03-10 22:23:40] [INFO ] Deduced a trap composed of 502 places in 389 ms of which 1 ms to minimize.
[2023-03-10 22:23:40] [INFO ] Deduced a trap composed of 477 places in 366 ms of which 1 ms to minimize.
[2023-03-10 22:23:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2264 ms
[2023-03-10 22:23:41] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 85 ms.
[2023-03-10 22:23:43] [INFO ] Deduced a trap composed of 14 places in 712 ms of which 1 ms to minimize.
[2023-03-10 22:23:43] [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: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-10 22:23:43] [INFO ] [Real]Absence check using 12 positive place invariants in 23 ms returned sat
[2023-03-10 22:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:44] [INFO ] [Real]Absence check using state equation in 487 ms returned sat
[2023-03-10 22:23:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:23:44] [INFO ] [Nat]Absence check using 12 positive place invariants in 24 ms returned sat
[2023-03-10 22:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:45] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2023-03-10 22:23:46] [INFO ] Deduced a trap composed of 512 places in 847 ms of which 2 ms to minimize.
[2023-03-10 22:23:47] [INFO ] Deduced a trap composed of 176 places in 768 ms of which 1 ms to minimize.
[2023-03-10 22:23:47] [INFO ] Deduced a trap composed of 477 places in 448 ms of which 1 ms to minimize.
[2023-03-10 22:23:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2299 ms
[2023-03-10 22:23:47] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 99 ms.
[2023-03-10 22:23:50] [INFO ] Deduced a trap composed of 14 places in 1071 ms of which 3 ms to minimize.
[2023-03-10 22:23:50] [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-10 22:23:51] [INFO ] [Real]Absence check using 12 positive place invariants in 31 ms returned sat
[2023-03-10 22:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:55] [INFO ] [Real]Absence check using state equation in 4540 ms returned unknown
[2023-03-10 22:23:56] [INFO ] [Real]Absence check using 12 positive place invariants in 31 ms returned sat
[2023-03-10 22:23:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:57] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2023-03-10 22:23:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:23:57] [INFO ] [Nat]Absence check using 12 positive place invariants in 40 ms returned sat
[2023-03-10 22:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:23:58] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2023-03-10 22:23:58] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 152 ms.
[2023-03-10 22:24:03] [INFO ] Deduced a trap composed of 14 places in 1138 ms of which 2 ms to minimize.
[2023-03-10 22:24:03] [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: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-10 22:24:03] [INFO ] [Real]Absence check using 12 positive place invariants in 71 ms returned sat
[2023-03-10 22:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:24:04] [INFO ] [Real]Absence check using state equation in 949 ms returned sat
[2023-03-10 22:24:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:24:05] [INFO ] [Nat]Absence check using 12 positive place invariants in 36 ms returned sat
[2023-03-10 22:24:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:24:06] [INFO ] [Nat]Absence check using state equation in 1453 ms returned sat
[2023-03-10 22:24:07] [INFO ] Deduced a trap composed of 465 places in 944 ms of which 2 ms to minimize.
[2023-03-10 22:24:08] [INFO ] Deduced a trap composed of 475 places in 820 ms of which 1 ms to minimize.
[2023-03-10 22:24:09] [INFO ] Deduced a trap composed of 486 places in 813 ms of which 1 ms to minimize.
[2023-03-10 22:24:10] [INFO ] Deduced a trap composed of 494 places in 829 ms of which 1 ms to minimize.
[2023-03-10 22:24:10] [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 9
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.verifyPossible(DeadlockTester.java:916)
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-10 22:24:11] [INFO ] [Real]Absence check using 12 positive place invariants in 35 ms returned sat
[2023-03-10 22:24:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:24:12] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2023-03-10 22:24:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:24:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 36 ms returned sat
[2023-03-10 22:24:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:24:13] [INFO ] [Nat]Absence check using state equation in 1086 ms returned sat
[2023-03-10 22:24:13] [INFO ] Computed and/alt/rep : 1475/2377/1475 causal constraints (skipped 137 transitions) in 155 ms.
[2023-03-10 22:24:17] [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: Broken pipe ... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 11 out of 1402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Graph (trivial) has 1351 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 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 352 place count 1350 transition count 1199
Reduce places removed 351 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 353 rules applied. Total rules applied 705 place count 999 transition count 1197
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 707 place count 997 transition count 1197
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 707 place count 997 transition count 1112
Deduced a syphon composed of 85 places in 46 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 877 place count 912 transition count 1112
Discarding 502 places :
Symmetric choice reduction at 3 with 502 rule applications. Total rules 1379 place count 410 transition count 610
Iterating global reduction 3 with 502 rules applied. Total rules applied 1881 place count 410 transition count 610
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1881 place count 410 transition count 602
Deduced a syphon composed of 8 places in 12 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 1897 place count 402 transition count 602
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 1975 place count 324 transition count 524
Iterating global reduction 3 with 78 rules applied. Total rules applied 2053 place count 324 transition count 524
Ensure Unique test removed 74 transitions
Reduce isomorphic transitions removed 74 transitions.
Iterating post reduction 3 with 74 rules applied. Total rules applied 2127 place count 324 transition count 450
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 2235 place count 270 transition count 396
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 2255 place count 270 transition count 376
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2265 place count 260 transition count 366
Iterating global reduction 5 with 10 rules applied. Total rules applied 2275 place count 260 transition count 366
Free-agglomeration rule applied 189 times.
Iterating global reduction 5 with 189 rules applied. Total rules applied 2464 place count 260 transition count 177
Reduce places removed 189 places and 0 transitions.
Drop transitions removed 77 transitions
Reduce isomorphic transitions removed 77 transitions.
Graph (complete) has 193 edges and 71 vertex of which 66 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 267 rules applied. Total rules applied 2731 place count 66 transition count 100
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 2738 place count 66 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 2739 place count 65 transition count 92
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 45 edges and 64 vertex of which 18 / 64 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 2741 place count 55 transition count 92
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 2759 place count 55 transition count 74
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 9 Pre rules applied. Total rules applied 2759 place count 55 transition count 65
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 9 with 18 rules applied. Total rules applied 2777 place count 46 transition count 65
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 2786 place count 46 transition count 56
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 2804 place count 37 transition count 47
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 2813 place count 37 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 20 rules applied. Total rules applied 2833 place count 26 transition count 29
Applied a total of 2833 rules in 808 ms. Remains 26 /1402 variables (removed 1376) and now considering 29/1613 (removed 1584) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 808 ms. Remains : 26/1402 places, 29/1613 transitions.
// Phase 1: matrix 29 rows 26 cols
[2023-03-10 22:24:17] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2393 ms. (steps per millisecond=417 ) properties (out of 11) seen :11
FORMULA FlexibleBarrier-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-10b-UpperBounds-05 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
FORMULA FlexibleBarrier-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 73587 ms.
ITS solved all properties within timeout

BK_STOP 1678487061369

--------------------
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-10b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
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 r167-tall-167838853200501"
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 '' 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 ;