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-171640602600093.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-14b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602600093
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 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 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 726K 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-14b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-14b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716424534125

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-14b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-23 00:35:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:35:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:35:35] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-23 00:35:35] [INFO ] Transformed 2678 places.
[2024-05-23 00:35:35] [INFO ] Transformed 3085 transitions.
[2024-05-23 00:35:35] [INFO ] Found NUPN structural information;
[2024-05-23 00:35:35] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 286 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 3085 rows 2678 cols
[2024-05-23 00:35:35] [INFO ] Computed 16 invariants in 102 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 (101 resets) in 65 ms. (151 steps per ms)
FORMULA FlexibleBarrier-PT-14b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80006 steps (73 resets) in 74 ms. (1066 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-23 00:35:35] [INFO ] Invariant cache hit.
[2024-05-23 00:35:36] [INFO ] [Real]Absence check using 16 positive place invariants in 68 ms returned sat
[2024-05-23 00:35:37] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2024-05-23 00:35:38] [INFO ] Deduced a trap composed of 82 places in 501 ms of which 43 ms to minimize.
[2024-05-23 00:35:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 64 ms returned sat
[2024-05-23 00:35:40] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2024-05-23 00:35:40] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 7 ms to minimize.
[2024-05-23 00:35:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
[2024-05-23 00:35:40] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 185 ms.
Maximisation of solution failed !
Minimization took 4 ms.
[2024-05-23 00:35:44] [INFO ] [Real]Absence check using 16 positive place invariants in 65 ms returned sat
[2024-05-23 00:35:45] [INFO ] [Real]Absence check using state equation in 958 ms returned sat
[2024-05-23 00:35:45] [INFO ] Deduced a trap composed of 268 places in 178 ms of which 5 ms to minimize.
[2024-05-23 00:35:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:45] [INFO ] [Nat]Absence check using 16 positive place invariants in 57 ms returned sat
[2024-05-23 00:35:46] [INFO ] [Nat]Absence check using state equation in 983 ms returned sat
[2024-05-23 00:35:47] [INFO ] Deduced a trap composed of 268 places in 193 ms of which 4 ms to minimize.
[2024-05-23 00:35:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2024-05-23 00:35:47] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 167 ms.
[2024-05-23 00:35: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 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-23 00:35:51] [INFO ] [Real]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-23 00:35:52] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2024-05-23 00:35:52] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 4 ms to minimize.
[2024-05-23 00:35:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:35:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 57 ms returned sat
[2024-05-23 00:35:54] [INFO ] [Nat]Absence check using state equation in 1064 ms returned sat
[2024-05-23 00:35:54] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 4 ms to minimize.
[2024-05-23 00:35:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 411 ms
[2024-05-23 00:35:54] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 165 ms.
[2024-05-23 00:35:57] [INFO ] Added : 115 causal constraints over 23 iterations in 3111 ms. Result :unknown
[2024-05-23 00:35:58] [INFO ] [Real]Absence check using 16 positive place invariants in 60 ms returned sat
[2024-05-23 00:35:59] [INFO ] [Real]Absence check using state equation in 990 ms returned sat
[2024-05-23 00:36:00] [INFO ] Deduced a trap composed of 933 places in 1309 ms of which 13 ms to minimize.
[2024-05-23 00:36:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:36:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 58 ms returned sat
[2024-05-23 00:36:02] [INFO ] [Nat]Absence check using state equation in 974 ms returned sat
[2024-05-23 00:36:03] [INFO ] Deduced a trap composed of 933 places in 1249 ms of which 13 ms to minimize.
[2024-05-23 00:36:04] [INFO ] Deduced a trap composed of 255 places in 1078 ms of which 22 ms to minimize.
[2024-05-23 00:36:06] [INFO ] Deduced a trap composed of 269 places in 1235 ms of which 12 ms to minimize.
[2024-05-23 00:36:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
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-23 00:36:06] [INFO ] [Real]Absence check using 16 positive place invariants in 56 ms returned sat
[2024-05-23 00:36:07] [INFO ] [Real]Absence check using state equation in 967 ms returned sat
[2024-05-23 00:36:08] [INFO ] Deduced a trap composed of 268 places in 257 ms of which 5 ms to minimize.
[2024-05-23 00:36:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:36:08] [INFO ] [Nat]Absence check using 16 positive place invariants in 57 ms returned sat
[2024-05-23 00:36:09] [INFO ] [Nat]Absence check using state equation in 1013 ms returned sat
[2024-05-23 00:36:09] [INFO ] Deduced a trap composed of 268 places in 263 ms of which 5 ms to minimize.
[2024-05-23 00:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 456 ms
[2024-05-23 00:36:10] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 165 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-23 00:36:13] [INFO ] [Real]Absence check using 16 positive place invariants in 57 ms returned sat
[2024-05-23 00:36:14] [INFO ] [Real]Absence check using state equation in 1000 ms returned sat
[2024-05-23 00:36:15] [INFO ] Deduced a trap composed of 82 places in 281 ms of which 5 ms to minimize.
[2024-05-23 00:36:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:36:15] [INFO ] [Nat]Absence check using 16 positive place invariants in 56 ms returned sat
[2024-05-23 00:36:16] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2024-05-23 00:36:17] [INFO ] Deduced a trap composed of 82 places in 267 ms of which 5 ms to minimize.
[2024-05-23 00:36:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 459 ms
[2024-05-23 00:36:17] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 161 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-23 00:36:20] [INFO ] [Real]Absence check using 16 positive place invariants in 57 ms returned sat
[2024-05-23 00:36:21] [INFO ] [Real]Absence check using state equation in 1133 ms returned sat
[2024-05-23 00:36:22] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 153 ms.
[2024-05-23 00:36:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:36:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 59 ms returned sat
[2024-05-23 00:36:24] [INFO ] [Nat]Absence check using state equation in 1133 ms returned sat
[2024-05-23 00:36:24] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 145 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-23 00:36:28] [INFO ] [Real]Absence check using 16 positive place invariants in 54 ms returned sat
[2024-05-23 00:36:28] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2024-05-23 00:36:29] [INFO ] Deduced a trap composed of 385 places in 202 ms of which 5 ms to minimize.
[2024-05-23 00:36:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 00:36:29] [INFO ] [Nat]Absence check using 16 positive place invariants in 55 ms returned sat
[2024-05-23 00:36:30] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2024-05-23 00:36:31] [INFO ] Deduced a trap composed of 385 places in 202 ms of which 5 ms to minimize.
[2024-05-23 00:36:31] [INFO ] Deduced a trap composed of 268 places in 161 ms of which 4 ms to minimize.
[2024-05-23 00:36:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 637 ms
[2024-05-23 00:36:31] [INFO ] Computed and/alt/rep : 2839/4489/2839 causal constraints (skipped 245 transitions) in 146 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, 1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 2678 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Graph (trivial) has 2620 edges and 2678 vertex of which 86 / 2678 are part of one of the 14 SCC in 11 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 662 transitions
Trivial Post-agglo rules discarded 662 transitions
Performed 662 trivial Post agglomeration. Transition count delta: 662
Iterating post reduction 0 with 662 rules applied. Total rules applied 663 place count 2606 transition count 2336
Reduce places removed 662 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 665 rules applied. Total rules applied 1328 place count 1944 transition count 2333
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1331 place count 1941 transition count 2333
Performed 175 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 175 Pre rules applied. Total rules applied 1331 place count 1941 transition count 2158
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 3 with 350 rules applied. Total rules applied 1681 place count 1766 transition count 2158
Discarding 1042 places :
Symmetric choice reduction at 3 with 1042 rule applications. Total rules 2723 place count 724 transition count 1116
Iterating global reduction 3 with 1042 rules applied. Total rules applied 3765 place count 724 transition count 1116
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 3765 place count 724 transition count 1101
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 3795 place count 709 transition count 1101
Discarding 168 places :
Symmetric choice reduction at 3 with 168 rule applications. Total rules 3963 place count 541 transition count 933
Iterating global reduction 3 with 168 rules applied. Total rules applied 4131 place count 541 transition count 933
Ensure Unique test removed 164 transitions
Reduce isomorphic transitions removed 164 transitions.
Iterating post reduction 3 with 164 rules applied. Total rules applied 4295 place count 541 transition count 769
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 4437 place count 470 transition count 698
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 4465 place count 470 transition count 670
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 4479 place count 456 transition count 656
Iterating global reduction 5 with 14 rules applied. Total rules applied 4493 place count 456 transition count 656
Free-agglomeration rule applied 371 times.
Iterating global reduction 5 with 371 rules applied. Total rules applied 4864 place count 456 transition count 285
Reduce places removed 371 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Graph (complete) has 230 edges and 85 vertex of which 70 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 539 rules applied. Total rules applied 5403 place count 70 transition count 118
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 5424 place count 70 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 5425 place count 70 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 5426 place count 69 transition count 96
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 55 edges and 68 vertex of which 22 / 68 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 5429 place count 57 transition count 95
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 5452 place count 56 transition count 73
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 10 Pre rules applied. Total rules applied 5452 place count 56 transition count 63
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 5472 place count 46 transition count 63
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 5482 place count 46 transition count 53
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 10 with 20 rules applied. Total rules applied 5502 place count 36 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 5504 place count 35 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 5505 place count 35 transition count 41
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 5515 place count 35 transition count 31
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 10 with 27 rules applied. Total rules applied 5542 place count 18 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 5543 place count 18 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 5544 place count 17 transition count 20
Applied a total of 5544 rules in 503 ms. Remains 17 /2678 variables (removed 2661) and now considering 20/3085 (removed 3065) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 512 ms. Remains : 17/2678 places, 20/3085 transitions.
// Phase 1: matrix 20 rows 17 cols
[2024-05-23 00:36:35] [INFO ] Computed 5 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-14b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 691 ms. (1445 steps per ms)
FORMULA FlexibleBarrier-PT-14b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-14b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 217 ms. (4587 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-23 00:36:36] [INFO ] Flatten gal took : 17 ms
[2024-05-23 00:36:36] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:36:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16586046529998845735.gal : 4 ms
[2024-05-23 00:36:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6603770877745250058.prop : 0 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/ReachabilityCardinality16586046529998845735.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6603770877745250058.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 ...329
Loading property file /tmp/ReachabilityCardinality6603770877745250058.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7,0.010134,3540,2,32,5,108,6,0,91,45,0
ITS tools runner thread asked to quit. Dying gracefully.
Total reachable state count : 7

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 61047 ms.

BK_STOP 1716424596368

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-14b"
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-14b, 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-171640602600093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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