Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 536K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716422233201

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-22 23:57:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:57:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:57:14] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-22 23:57:14] [INFO ] Transformed 1988 places.
[2024-05-22 23:57:14] [INFO ] Transformed 2289 transitions.
[2024-05-22 23:57:14] [INFO ] Found NUPN structural information;
[2024-05-22 23:57:14] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2289 rows 1988 cols
[2024-05-22 23:57:14] [INFO ] Computed 14 invariants in 60 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (116 resets) in 64 ms. (153 steps per ms)
FORMULA FlexibleBarrier-PT-12b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100008 steps (114 resets) in 148 ms. (671 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-22 23:57:15] [INFO ] Invariant cache hit.
[2024-05-22 23:57:15] [INFO ] [Real]Absence check using 14 positive place invariants in 56 ms returned sat
[2024-05-22 23:57:16] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2024-05-22 23:57:18] [INFO ] Deduced a trap composed of 734 places in 1225 ms of which 102 ms to minimize.
[2024-05-22 23:57:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:57:18] [INFO ] [Nat]Absence check using 14 positive place invariants in 43 ms returned sat
[2024-05-22 23:57:19] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2024-05-22 23:57:20] [INFO ] Deduced a trap composed of 734 places in 880 ms of which 13 ms to minimize.
[2024-05-22 23:57:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1046 ms
[2024-05-22 23:57:20] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 153 ms.
[2024-05-22 23:57:23] [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 0
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 23:57:23] [INFO ] [Real]Absence check using 14 positive place invariants in 44 ms returned sat
[2024-05-22 23:57:24] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2024-05-22 23:57:25] [INFO ] Deduced a trap composed of 661 places in 848 ms of which 11 ms to minimize.
[2024-05-22 23:57:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:57:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 40 ms returned sat
[2024-05-22 23:57:26] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2024-05-22 23:57:27] [INFO ] Deduced a trap composed of 661 places in 913 ms of which 11 ms to minimize.
[2024-05-22 23:57:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1059 ms
[2024-05-22 23:57:27] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 142 ms.
[2024-05-22 23:57:30] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 23:57:30] [INFO ] [Real]Absence check using 14 positive place invariants in 41 ms returned sat
[2024-05-22 23:57:31] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2024-05-22 23:57:32] [INFO ] Deduced a trap composed of 213 places in 960 ms of which 11 ms to minimize.
[2024-05-22 23:57:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:57:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 40 ms returned sat
[2024-05-22 23:57:33] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2024-05-22 23:57:34] [INFO ] Deduced a trap composed of 213 places in 961 ms of which 12 ms to minimize.
[2024-05-22 23:57:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1103 ms
[2024-05-22 23:57:34] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 104 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-22 23:57:38] [INFO ] [Real]Absence check using 14 positive place invariants in 40 ms returned sat
[2024-05-22 23:57:39] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2024-05-22 23:57:39] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 122 ms.
[2024-05-22 23:57:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:57:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2024-05-22 23:57:40] [INFO ] [Nat]Absence check using state equation in 935 ms returned sat
[2024-05-22 23:57:41] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 132 ms.
[2024-05-22 23:57:44] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 23:57:44] [INFO ] [Real]Absence check using 14 positive place invariants in 36 ms returned sat
[2024-05-22 23:57:45] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2024-05-22 23:57:46] [INFO ] Deduced a trap composed of 121 places in 348 ms of which 6 ms to minimize.
[2024-05-22 23:57:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:57:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 40 ms returned sat
[2024-05-22 23:57:47] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2024-05-22 23:57:48] [INFO ] Deduced a trap composed of 121 places in 350 ms of which 6 ms to minimize.
[2024-05-22 23:57:48] [INFO ] Deduced a trap composed of 70 places in 282 ms of which 5 ms to minimize.
[2024-05-22 23:57:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 833 ms
[2024-05-22 23:57:48] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 129 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-22 23:57:51] [INFO ] [Real]Absence check using 14 positive place invariants in 38 ms returned sat
[2024-05-22 23:57:52] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2024-05-22 23:57:52] [INFO ] Deduced a trap composed of 222 places in 140 ms of which 3 ms to minimize.
[2024-05-22 23:57:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:57:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 41 ms returned sat
[2024-05-22 23:57:53] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2024-05-22 23:57:54] [INFO ] Deduced a trap composed of 222 places in 154 ms of which 3 ms to minimize.
[2024-05-22 23:57:54] [INFO ] Deduced a trap composed of 212 places in 160 ms of which 3 ms to minimize.
[2024-05-22 23:57:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 526 ms
[2024-05-22 23:57:54] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 117 ms.
[2024-05-22 23:57:57] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-22 23:57:58] [INFO ] [Real]Absence check using 14 positive place invariants in 38 ms returned sat
[2024-05-22 23:57:59] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2024-05-22 23:58:00] [INFO ] Deduced a trap composed of 73 places in 939 ms of which 10 ms to minimize.
[2024-05-22 23:58:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:58:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 39 ms returned sat
[2024-05-22 23:58:01] [INFO ] [Nat]Absence check using state equation in 999 ms returned sat
[2024-05-22 23:58:02] [INFO ] Deduced a trap composed of 73 places in 944 ms of which 11 ms to minimize.
[2024-05-22 23:58:03] [INFO ] Deduced a trap composed of 205 places in 890 ms of which 11 ms to minimize.
[2024-05-22 23:58:03] [INFO ] Deduced a trap composed of 121 places in 201 ms of which 4 ms to minimize.
[2024-05-22 23:58:04] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 3 ms to minimize.
[2024-05-22 23:58:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2558 ms
[2024-05-22 23:58:04] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 108 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-22 23:58:05] [INFO ] [Real]Absence check using 14 positive place invariants in 39 ms returned sat
[2024-05-22 23:58:06] [INFO ] [Real]Absence check using state equation in 691 ms returned sat
[2024-05-22 23:58:06] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 130 ms.
[2024-05-22 23:58:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 23:58:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 39 ms returned sat
[2024-05-22 23:58:08] [INFO ] [Nat]Absence check using state equation in 711 ms returned sat
[2024-05-22 23:58:08] [INFO ] Computed and/alt/rep : 2101/3349/2101 causal constraints (skipped 187 transitions) in 122 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 1988 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1941 edges and 1988 vertex of which 74 / 1988 are part of one of the 12 SCC in 19 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 498 transitions
Trivial Post-agglo rules discarded 498 transitions
Performed 498 trivial Post agglomeration. Transition count delta: 498
Iterating post reduction 0 with 498 rules applied. Total rules applied 499 place count 1926 transition count 1716
Reduce places removed 498 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 500 rules applied. Total rules applied 999 place count 1428 transition count 1714
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1001 place count 1426 transition count 1714
Performed 127 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 127 Pre rules applied. Total rules applied 1001 place count 1426 transition count 1587
Deduced a syphon composed of 127 places in 3 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 1255 place count 1299 transition count 1587
Discarding 749 places :
Symmetric choice reduction at 3 with 749 rule applications. Total rules 2004 place count 550 transition count 838
Iterating global reduction 3 with 749 rules applied. Total rules applied 2753 place count 550 transition count 838
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 2753 place count 550 transition count 826
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 2777 place count 538 transition count 826
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 2787 place count 538 transition count 816
Discarding 118 places :
Symmetric choice reduction at 4 with 118 rule applications. Total rules 2905 place count 420 transition count 698
Iterating global reduction 4 with 118 rules applied. Total rules applied 3023 place count 420 transition count 698
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 4 with 114 rules applied. Total rules applied 3137 place count 420 transition count 584
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 5 with 126 rules applied. Total rules applied 3263 place count 357 transition count 521
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 3277 place count 357 transition count 507
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 3289 place count 345 transition count 495
Iterating global reduction 6 with 12 rules applied. Total rules applied 3301 place count 345 transition count 495
Free-agglomeration rule applied 273 times.
Iterating global reduction 6 with 273 rules applied. Total rules applied 3574 place count 345 transition count 222
Reduce places removed 273 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Graph (complete) has 203 edges and 72 vertex of which 57 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 394 rules applied. Total rules applied 3968 place count 57 transition count 102
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 3989 place count 57 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 3990 place count 56 transition count 80
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 45 edges and 55 vertex of which 18 / 55 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 3992 place count 46 transition count 80
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 9 with 18 rules applied. Total rules applied 4010 place count 46 transition count 62
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 9 Pre rules applied. Total rules applied 4010 place count 46 transition count 53
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 4028 place count 37 transition count 53
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4037 place count 37 transition count 44
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 11 with 18 rules applied. Total rules applied 4055 place count 28 transition count 35
Free-agglomeration rule applied 9 times.
Iterating global reduction 11 with 9 rules applied. Total rules applied 4064 place count 28 transition count 26
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 11 with 24 rules applied. Total rules applied 4088 place count 13 transition count 17
Applied a total of 4088 rules in 452 ms. Remains 13 /1988 variables (removed 1975) and now considering 17/2289 (removed 2272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 13/1988 places, 17/2289 transitions.
// Phase 1: matrix 17 rows 13 cols
[2024-05-22 23:58:12] [INFO ] Computed 4 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 823 ms. (1213 steps per ms)
FORMULA FlexibleBarrier-PT-12b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-12b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 180 ms. (5524 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-22 23:58:13] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:58:13] [INFO ] Flatten gal took : 3 ms
[2024-05-22 23:58:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality206916182227607088.gal : 3 ms
[2024-05-22 23:58:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4317586542023959394.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality206916182227607088.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4317586542023959394.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 59351 ms.

BK_STOP 1716422293768

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-12b, 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 r180-tall-171640602600077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12b.tgz
mv FlexibleBarrier-PT-12b 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 ;