/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 20:30:10,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 20:30:10,662 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 20:30:10,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 20:30:10,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 20:30:10,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 20:30:10,705 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 20:30:10,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 20:30:10,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 20:30:10,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 20:30:10,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 20:30:10,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 20:30:10,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 20:30:10,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 20:30:10,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 20:30:10,723 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 20:30:10,725 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 20:30:10,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 20:30:10,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 20:30:10,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 20:30:10,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 20:30:10,739 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 20:30:10,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 20:30:10,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 20:30:10,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 20:30:10,748 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 20:30:10,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 20:30:10,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 20:30:10,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 20:30:10,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 20:30:10,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 20:30:10,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 20:30:10,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 20:30:10,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 20:30:10,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 20:30:10,754 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 20:30:10,755 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 20:30:10,755 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 20:30:10,755 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 20:30:10,756 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 20:30:10,756 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 20:30:10,760 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 20:30:10,797 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 20:30:10,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 20:30:10,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 20:30:10,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 20:30:10,801 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 20:30:10,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 20:30:10,801 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 20:30:10,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 20:30:10,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 20:30:10,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 20:30:10,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 20:30:10,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 20:30:10,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 20:30:10,803 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 20:30:10,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 20:30:10,803 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 20:30:10,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 20:30:10,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 20:30:10,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 20:30:10,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 20:30:10,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 20:30:10,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 20:30:10,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 20:30:10,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 20:30:10,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 20:30:10,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 20:30:10,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 20:30:10,805 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 20:30:10,805 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 20:30:10,805 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-25 20:30:11,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 20:30:11,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 20:30:11,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 20:30:11,107 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-25 20:30:11,107 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-25 20:30:11,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl [2021-03-25 20:30:11,108 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/simple-array-sum.wvr.bpl' [2021-03-25 20:30:11,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 20:30:11,179 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-25 20:30:11,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 20:30:11,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 20:30:11,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 20:30:11,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... [2021-03-25 20:30:11,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... [2021-03-25 20:30:11,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 20:30:11,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 20:30:11,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 20:30:11,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 20:30:11,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... [2021-03-25 20:30:11,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... [2021-03-25 20:30:11,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... [2021-03-25 20:30:11,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... [2021-03-25 20:30:11,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... [2021-03-25 20:30:11,214 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... [2021-03-25 20:30:11,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... [2021-03-25 20:30:11,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 20:30:11,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 20:30:11,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 20:30:11,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 20:30:11,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 20:30:11,265 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-25 20:30:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-25 20:30:11,265 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-25 20:30:11,265 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-25 20:30:11,265 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-25 20:30:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-25 20:30:11,266 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-25 20:30:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 20:30:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 20:30:11,266 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-25 20:30:11,266 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-25 20:30:11,266 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-25 20:30:11,267 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 20:30:11,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 20:30:11,480 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-25 20:30:11,482 INFO L202 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 08:30:11 BoogieIcfgContainer [2021-03-25 20:30:11,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 20:30:11,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 20:30:11,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 20:30:11,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 20:30:11,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.03 08:30:11" (1/2) ... [2021-03-25 20:30:11,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1faa772f and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 08:30:11, skipping insertion in model container [2021-03-25 20:30:11,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 08:30:11" (2/2) ... [2021-03-25 20:30:11,487 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2021-03-25 20:30:11,491 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 20:30:11,494 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 20:30:11,495 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 20:30:11,567 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-03-25 20:30:11,597 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-25 20:30:11,619 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 20:30:11,620 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 20:30:11,620 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 20:30:11,620 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 20:30:11,620 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 20:30:11,620 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 20:30:11,620 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 20:30:11,620 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 20:30:11,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 82 flow [2021-03-25 20:30:11,670 INFO L129 PetriNetUnfolder]: 4/26 cut-off events. [2021-03-25 20:30:11,671 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 20:30:11,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2021-03-25 20:30:11,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 29 transitions, 82 flow [2021-03-25 20:30:11,676 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 24 transitions, 66 flow [2021-03-25 20:30:11,678 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:11,693 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 66 flow [2021-03-25 20:30:11,700 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 66 flow [2021-03-25 20:30:11,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 66 flow [2021-03-25 20:30:11,714 INFO L129 PetriNetUnfolder]: 4/24 cut-off events. [2021-03-25 20:30:11,714 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 20:30:11,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 4/24 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2021-03-25 20:30:11,717 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-25 20:30:11,933 INFO L154 LiptonReduction]: Checked pairs total: 90 [2021-03-25 20:30:11,933 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 20:30:11,939 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 262 [2021-03-25 20:30:11,953 INFO L129 PetriNetUnfolder]: 4/16 cut-off events. [2021-03-25 20:30:11,954 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 20:30:11,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:11,954 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:11,954 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:11,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1603213337, now seen corresponding path program 1 times [2021-03-25 20:30:11,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:11,978 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43487624] [2021-03-25 20:30:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:12,120 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.7 percent of original size [2021-03-25 20:30:12,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:30:12,167 INFO L142 QuantifierPusher]: treesize reduction 13, result has 76.4 percent of original size [2021-03-25 20:30:12,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 20:30:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:12,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43487624] [2021-03-25 20:30:12,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 20:30:12,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 20:30:12,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858452432] [2021-03-25 20:30:12,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 20:30:12,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:12,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 20:30:12,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 20:30:12,229 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2021-03-25 20:30:12,230 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,230 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:12,230 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2021-03-25 20:30:12,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:12,347 INFO L129 PetriNetUnfolder]: 104/163 cut-off events. [2021-03-25 20:30:12,347 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-25 20:30:12,349 INFO L84 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 163 events. 104/163 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 479 event pairs, 26 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 312. Up to 93 conditions per place. [2021-03-25 20:30:12,352 INFO L132 encePairwiseOnDemand]: 31/36 looper letters, 18 selfloop transitions, 5 changer transitions 1/30 dead transitions. [2021-03-25 20:30:12,352 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 30 transitions, 126 flow [2021-03-25 20:30:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 20:30:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 20:30:12,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2021-03-25 20:30:12,364 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2021-03-25 20:30:12,364 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 85 transitions. [2021-03-25 20:30:12,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 85 transitions. [2021-03-25 20:30:12,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:12,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 85 transitions. [2021-03-25 20:30:12,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,380 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,382 INFO L185 Difference]: Start difference. First operand has 23 places, 17 transitions, 52 flow. Second operand 4 states and 85 transitions. [2021-03-25 20:30:12,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 30 transitions, 126 flow [2021-03-25 20:30:12,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-03-25 20:30:12,391 INFO L241 Difference]: Finished difference. Result has 22 places, 21 transitions, 72 flow [2021-03-25 20:30:12,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2021-03-25 20:30:12,397 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2021-03-25 20:30:12,398 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:12,398 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 21 transitions, 72 flow [2021-03-25 20:30:12,398 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 21 transitions, 72 flow [2021-03-25 20:30:12,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 22 places, 21 transitions, 72 flow [2021-03-25 20:30:12,411 INFO L129 PetriNetUnfolder]: 10/35 cut-off events. [2021-03-25 20:30:12,412 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 20:30:12,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 35 events. 10/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 40. Up to 8 conditions per place. [2021-03-25 20:30:12,413 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-25 20:30:12,415 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:12,415 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:12,415 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 20:30:12,418 INFO L480 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 72 flow [2021-03-25 20:30:12,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,418 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:12,418 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:12,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 20:30:12,419 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2064833924, now seen corresponding path program 1 times [2021-03-25 20:30:12,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:12,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428612493] [2021-03-25 20:30:12,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:12,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:12,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:12,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:12,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428612493] [2021-03-25 20:30:12,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 20:30:12,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 20:30:12,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922105845] [2021-03-25 20:30:12,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 20:30:12,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:12,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 20:30:12,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 20:30:12,476 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2021-03-25 20:30:12,476 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,476 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:12,476 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2021-03-25 20:30:12,476 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:12,560 INFO L129 PetriNetUnfolder]: 104/175 cut-off events. [2021-03-25 20:30:12,560 INFO L130 PetriNetUnfolder]: For 46/51 co-relation queries the response was YES. [2021-03-25 20:30:12,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 175 events. 104/175 cut-off events. For 46/51 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 528 event pairs, 12 based on Foata normal form. 21/155 useless extension candidates. Maximal degree in co-relation 369. Up to 79 conditions per place. [2021-03-25 20:30:12,562 INFO L132 encePairwiseOnDemand]: 30/36 looper letters, 23 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-03-25 20:30:12,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 37 transitions, 173 flow [2021-03-25 20:30:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 20:30:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 20:30:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2021-03-25 20:30:12,565 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6 [2021-03-25 20:30:12,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 108 transitions. [2021-03-25 20:30:12,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 108 transitions. [2021-03-25 20:30:12,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:12,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 108 transitions. [2021-03-25 20:30:12,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,568 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,569 INFO L185 Difference]: Start difference. First operand has 22 places, 21 transitions, 72 flow. Second operand 5 states and 108 transitions. [2021-03-25 20:30:12,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 37 transitions, 173 flow [2021-03-25 20:30:12,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 37 transitions, 173 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 20:30:12,570 INFO L241 Difference]: Finished difference. Result has 30 places, 24 transitions, 123 flow [2021-03-25 20:30:12,571 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2021-03-25 20:30:12,571 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 7 predicate places. [2021-03-25 20:30:12,571 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:12,571 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 123 flow [2021-03-25 20:30:12,572 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 123 flow [2021-03-25 20:30:12,572 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 123 flow [2021-03-25 20:30:12,577 INFO L129 PetriNetUnfolder]: 12/52 cut-off events. [2021-03-25 20:30:12,578 INFO L130 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2021-03-25 20:30:12,578 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 52 events. 12/52 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 163 event pairs, 2 based on Foata normal form. 1/48 useless extension candidates. Maximal degree in co-relation 90. Up to 12 conditions per place. [2021-03-25 20:30:12,579 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-25 20:30:12,581 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:12,581 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:12,581 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 20:30:12,582 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 123 flow [2021-03-25 20:30:12,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,582 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:12,582 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:12,582 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 20:30:12,583 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:12,583 INFO L82 PathProgramCache]: Analyzing trace with hash -452810530, now seen corresponding path program 2 times [2021-03-25 20:30:12,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:12,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888508813] [2021-03-25 20:30:12,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:12,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:12,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:12,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:12,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888508813] [2021-03-25 20:30:12,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 20:30:12,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 20:30:12,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509166256] [2021-03-25 20:30:12,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 20:30:12,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:12,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 20:30:12,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 20:30:12,609 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2021-03-25 20:30:12,609 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,609 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:12,609 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2021-03-25 20:30:12,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:12,675 INFO L129 PetriNetUnfolder]: 90/155 cut-off events. [2021-03-25 20:30:12,676 INFO L130 PetriNetUnfolder]: For 188/205 co-relation queries the response was YES. [2021-03-25 20:30:12,677 INFO L84 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 155 events. 90/155 cut-off events. For 188/205 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 436 event pairs, 4 based on Foata normal form. 12/137 useless extension candidates. Maximal degree in co-relation 395. Up to 53 conditions per place. [2021-03-25 20:30:12,678 INFO L132 encePairwiseOnDemand]: 30/36 looper letters, 24 selfloop transitions, 5 changer transitions 6/41 dead transitions. [2021-03-25 20:30:12,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 252 flow [2021-03-25 20:30:12,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 20:30:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 20:30:12,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2021-03-25 20:30:12,679 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6 [2021-03-25 20:30:12,679 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 108 transitions. [2021-03-25 20:30:12,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 108 transitions. [2021-03-25 20:30:12,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:12,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 108 transitions. [2021-03-25 20:30:12,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,681 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,682 INFO L185 Difference]: Start difference. First operand has 30 places, 24 transitions, 123 flow. Second operand 5 states and 108 transitions. [2021-03-25 20:30:12,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 252 flow [2021-03-25 20:30:12,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 246 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-25 20:30:12,684 INFO L241 Difference]: Finished difference. Result has 35 places, 22 transitions, 114 flow [2021-03-25 20:30:12,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2021-03-25 20:30:12,684 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2021-03-25 20:30:12,685 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:12,685 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 114 flow [2021-03-25 20:30:12,685 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 114 flow [2021-03-25 20:30:12,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 114 flow [2021-03-25 20:30:12,688 INFO L129 PetriNetUnfolder]: 8/31 cut-off events. [2021-03-25 20:30:12,688 INFO L130 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2021-03-25 20:30:12,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 31 events. 8/31 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 73. Up to 7 conditions per place. [2021-03-25 20:30:12,689 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-25 20:30:12,691 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:12,691 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:12,691 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-25 20:30:12,692 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 114 flow [2021-03-25 20:30:12,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,692 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:12,692 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:12,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 20:30:12,692 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:12,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:12,693 INFO L82 PathProgramCache]: Analyzing trace with hash 99223701, now seen corresponding path program 1 times [2021-03-25 20:30:12,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:12,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752442419] [2021-03-25 20:30:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:12,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:12,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:12,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:12,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752442419] [2021-03-25 20:30:12,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 20:30:12,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 20:30:12,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445276142] [2021-03-25 20:30:12,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 20:30:12,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:12,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 20:30:12,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 20:30:12,712 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 36 [2021-03-25 20:30:12,712 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,712 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:12,712 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 36 [2021-03-25 20:30:12,712 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:12,725 INFO L129 PetriNetUnfolder]: 23/52 cut-off events. [2021-03-25 20:30:12,725 INFO L130 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2021-03-25 20:30:12,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 52 events. 23/52 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 100 event pairs, 0 based on Foata normal form. 2/51 useless extension candidates. Maximal degree in co-relation 139. Up to 27 conditions per place. [2021-03-25 20:30:12,726 INFO L132 encePairwiseOnDemand]: 33/36 looper letters, 12 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-03-25 20:30:12,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 160 flow [2021-03-25 20:30:12,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 20:30:12,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 20:30:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2021-03-25 20:30:12,727 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7962962962962963 [2021-03-25 20:30:12,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2021-03-25 20:30:12,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2021-03-25 20:30:12,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:12,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2021-03-25 20:30:12,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,729 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,729 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 114 flow. Second operand 3 states and 86 transitions. [2021-03-25 20:30:12,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 160 flow [2021-03-25 20:30:12,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 140 flow, removed 4 selfloop flow, removed 5 redundant places. [2021-03-25 20:30:12,730 INFO L241 Difference]: Finished difference. Result has 31 places, 23 transitions, 109 flow [2021-03-25 20:30:12,731 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2021-03-25 20:30:12,731 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 8 predicate places. [2021-03-25 20:30:12,731 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:12,731 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 109 flow [2021-03-25 20:30:12,731 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 23 transitions, 109 flow [2021-03-25 20:30:12,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 23 transitions, 109 flow [2021-03-25 20:30:12,735 INFO L129 PetriNetUnfolder]: 11/38 cut-off events. [2021-03-25 20:30:12,735 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-25 20:30:12,735 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 38 events. 11/38 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 71. Up to 8 conditions per place. [2021-03-25 20:30:12,736 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-25 20:30:12,737 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:12,737 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:12,738 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 20:30:12,738 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 109 flow [2021-03-25 20:30:12,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,739 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:12,739 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:12,739 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 20:30:12,739 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:12,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 2029596539, now seen corresponding path program 1 times [2021-03-25 20:30:12,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:12,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261466217] [2021-03-25 20:30:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:12,763 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 20:30:12,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:12,772 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 20:30:12,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:12,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:12,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:12,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261466217] [2021-03-25 20:30:12,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 20:30:12,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 20:30:12,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417870629] [2021-03-25 20:30:12,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 20:30:12,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 20:30:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 20:30:12,784 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2021-03-25 20:30:12,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:12,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2021-03-25 20:30:12,785 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:12,848 INFO L129 PetriNetUnfolder]: 127/198 cut-off events. [2021-03-25 20:30:12,848 INFO L130 PetriNetUnfolder]: For 143/153 co-relation queries the response was YES. [2021-03-25 20:30:12,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 198 events. 127/198 cut-off events. For 143/153 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 533 event pairs, 38 based on Foata normal form. 18/213 useless extension candidates. Maximal degree in co-relation 611. Up to 138 conditions per place. [2021-03-25 20:30:12,850 INFO L132 encePairwiseOnDemand]: 29/36 looper letters, 28 selfloop transitions, 10 changer transitions 1/45 dead transitions. [2021-03-25 20:30:12,850 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 285 flow [2021-03-25 20:30:12,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 20:30:12,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 20:30:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2021-03-25 20:30:12,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2021-03-25 20:30:12,851 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 120 transitions. [2021-03-25 20:30:12,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 120 transitions. [2021-03-25 20:30:12,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:12,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 120 transitions. [2021-03-25 20:30:12,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,853 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,853 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 109 flow. Second operand 6 states and 120 transitions. [2021-03-25 20:30:12,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 285 flow [2021-03-25 20:30:12,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 20:30:12,856 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 178 flow [2021-03-25 20:30:12,856 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2021-03-25 20:30:12,856 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 15 predicate places. [2021-03-25 20:30:12,856 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:12,856 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 178 flow [2021-03-25 20:30:12,856 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 178 flow [2021-03-25 20:30:12,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 178 flow [2021-03-25 20:30:12,861 INFO L129 PetriNetUnfolder]: 20/59 cut-off events. [2021-03-25 20:30:12,861 INFO L130 PetriNetUnfolder]: For 31/34 co-relation queries the response was YES. [2021-03-25 20:30:12,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 59 events. 20/59 cut-off events. For 31/34 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 161 event pairs, 1 based on Foata normal form. 2/59 useless extension candidates. Maximal degree in co-relation 147. Up to 15 conditions per place. [2021-03-25 20:30:12,862 INFO L142 LiptonReduction]: Number of co-enabled transitions 162 [2021-03-25 20:30:12,864 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:12,864 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:12,865 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 20:30:12,865 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 178 flow [2021-03-25 20:30:12,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:12,866 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:12,866 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:12,866 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 20:30:12,866 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash -325290422, now seen corresponding path program 1 times [2021-03-25 20:30:12,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:12,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128285330] [2021-03-25 20:30:12,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:12,899 INFO L142 QuantifierPusher]: treesize reduction 4, result has 76.5 percent of original size [2021-03-25 20:30:12,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:12,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:12,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,916 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:12,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:12,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:12,935 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:30:12,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:12,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128285330] [2021-03-25 20:30:12,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527840691] [2021-03-25 20:30:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:12,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 20:30:13,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:13,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,097 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.0 percent of original size [2021-03-25 20:30:13,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:13,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:13,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:13,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:30:13,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:13,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:13,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:30:13,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:13,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:13,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,148 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:13,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,149 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:13,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:13,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:13,152 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:13,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:13,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:30:13,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:13,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:13,182 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:13,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-03-25 20:30:13,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:13,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:13,197 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:13,205 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,207 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:13,207 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2021-03-25 20:30:13,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:13,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,250 INFO L147 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size 19 [2021-03-25 20:30:13,251 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-25 20:30:13,251 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:13,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:13,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,270 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:13,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:13,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:13,275 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-25 20:30:13,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:13,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:13,277 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:13,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:13,283 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 20:30:13,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:13,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:13,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2021-03-25 20:30:13,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73142864] [2021-03-25 20:30:13,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 20:30:13,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:13,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 20:30:13,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-25 20:30:13,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2021-03-25 20:30:13,317 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 178 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:13,317 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:13,317 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2021-03-25 20:30:13,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:13,532 INFO L129 PetriNetUnfolder]: 173/289 cut-off events. [2021-03-25 20:30:13,532 INFO L130 PetriNetUnfolder]: For 388/405 co-relation queries the response was YES. [2021-03-25 20:30:13,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 289 events. 173/289 cut-off events. For 388/405 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1017 event pairs, 24 based on Foata normal form. 16/304 useless extension candidates. Maximal degree in co-relation 968. Up to 190 conditions per place. [2021-03-25 20:30:13,536 INFO L132 encePairwiseOnDemand]: 29/36 looper letters, 34 selfloop transitions, 12 changer transitions 2/54 dead transitions. [2021-03-25 20:30:13,536 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 390 flow [2021-03-25 20:30:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 20:30:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 20:30:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2021-03-25 20:30:13,539 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2021-03-25 20:30:13,539 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 138 transitions. [2021-03-25 20:30:13,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 138 transitions. [2021-03-25 20:30:13,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:13,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 138 transitions. [2021-03-25 20:30:13,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:13,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:13,541 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:13,541 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 178 flow. Second operand 7 states and 138 transitions. [2021-03-25 20:30:13,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 390 flow [2021-03-25 20:30:13,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 384 flow, removed 3 selfloop flow, removed 0 redundant places. [2021-03-25 20:30:13,546 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 264 flow [2021-03-25 20:30:13,547 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=264, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-25 20:30:13,547 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 25 predicate places. [2021-03-25 20:30:13,547 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:13,547 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 264 flow [2021-03-25 20:30:13,548 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 264 flow [2021-03-25 20:30:13,548 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 264 flow [2021-03-25 20:30:13,561 INFO L129 PetriNetUnfolder]: 42/123 cut-off events. [2021-03-25 20:30:13,561 INFO L130 PetriNetUnfolder]: For 156/158 co-relation queries the response was YES. [2021-03-25 20:30:13,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 123 events. 42/123 cut-off events. For 156/158 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 521 event pairs, 6 based on Foata normal form. 1/123 useless extension candidates. Maximal degree in co-relation 377. Up to 37 conditions per place. [2021-03-25 20:30:13,563 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-25 20:30:13,566 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:13,566 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:13,566 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-25 20:30:13,570 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 264 flow [2021-03-25 20:30:13,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:13,570 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:13,570 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:13,793 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-03-25 20:30:13,793 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:13,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:13,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1752726740, now seen corresponding path program 2 times [2021-03-25 20:30:13,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:13,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941180385] [2021-03-25 20:30:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:13,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:13,829 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 20:30:13,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:13,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:13,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:13,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:13,903 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:30:13,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:13,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:13,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941180385] [2021-03-25 20:30:13,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246975687] [2021-03-25 20:30:13,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:13,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 20:30:13,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:30:13,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 20:30:13,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:13,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:13,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:13,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:13,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:13,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:13,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:14,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:14,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:14,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:14,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:14,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:30:14,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 20:30:14,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,037 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:14,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:14,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:14,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:14,042 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:14,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:30:14,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 20:30:14,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2021-03-25 20:30:14,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:14,052 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:14,054 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:14,062 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2021-03-25 20:30:14,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:14,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:14,075 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:14,083 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,084 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.0 percent of original size [2021-03-25 20:30:14,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,085 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:14,085 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2021-03-25 20:30:14,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,115 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.4 percent of original size [2021-03-25 20:30:14,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:14,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,117 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:14,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:14,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:30:14,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:14,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:14,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,156 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:14,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:14,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:14,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,160 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:14,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:14,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:14,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-25 20:30:14,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:14,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:14,168 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:14,173 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,174 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:14,174 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 20:30:14,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,202 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:14,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:14,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2021-03-25 20:30:14,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642926011] [2021-03-25 20:30:14,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 20:30:14,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:14,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 20:30:14,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-03-25 20:30:14,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2021-03-25 20:30:14,208 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 264 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:14,208 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:14,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2021-03-25 20:30:14,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:14,512 INFO L129 PetriNetUnfolder]: 231/397 cut-off events. [2021-03-25 20:30:14,512 INFO L130 PetriNetUnfolder]: For 992/1003 co-relation queries the response was YES. [2021-03-25 20:30:14,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1637 conditions, 397 events. 231/397 cut-off events. For 992/1003 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1578 event pairs, 37 based on Foata normal form. 7/403 useless extension candidates. Maximal degree in co-relation 1563. Up to 234 conditions per place. [2021-03-25 20:30:14,516 INFO L132 encePairwiseOnDemand]: 29/36 looper letters, 40 selfloop transitions, 22 changer transitions 1/69 dead transitions. [2021-03-25 20:30:14,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 595 flow [2021-03-25 20:30:14,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 20:30:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 20:30:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2021-03-25 20:30:14,517 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2021-03-25 20:30:14,517 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 145 transitions. [2021-03-25 20:30:14,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 145 transitions. [2021-03-25 20:30:14,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:14,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 145 transitions. [2021-03-25 20:30:14,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 20.714285714285715) internal successors, (145), 7 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:14,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:14,519 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 36.0) internal successors, (288), 8 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:14,519 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 264 flow. Second operand 7 states and 145 transitions. [2021-03-25 20:30:14,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 595 flow [2021-03-25 20:30:14,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 69 transitions, 578 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 20:30:14,523 INFO L241 Difference]: Finished difference. Result has 56 places, 48 transitions, 422 flow [2021-03-25 20:30:14,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=422, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2021-03-25 20:30:14,524 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 33 predicate places. [2021-03-25 20:30:14,524 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:14,524 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 48 transitions, 422 flow [2021-03-25 20:30:14,524 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 422 flow [2021-03-25 20:30:14,524 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 422 flow [2021-03-25 20:30:14,535 INFO L129 PetriNetUnfolder]: 58/153 cut-off events. [2021-03-25 20:30:14,535 INFO L130 PetriNetUnfolder]: For 413/428 co-relation queries the response was YES. [2021-03-25 20:30:14,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 153 events. 58/153 cut-off events. For 413/428 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 626 event pairs, 4 based on Foata normal form. 2/149 useless extension candidates. Maximal degree in co-relation 546. Up to 42 conditions per place. [2021-03-25 20:30:14,537 INFO L142 LiptonReduction]: Number of co-enabled transitions 284 [2021-03-25 20:30:14,584 INFO L154 LiptonReduction]: Checked pairs total: 12 [2021-03-25 20:30:14,584 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 20:30:14,584 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-25 20:30:14,584 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 424 flow [2021-03-25 20:30:14,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:14,585 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:14,585 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:14,806 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:14,806 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:14,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:14,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1035774060, now seen corresponding path program 3 times [2021-03-25 20:30:14,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:14,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231539746] [2021-03-25 20:30:14,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:14,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:14,872 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 20:30:14,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:14,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:14,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:14,906 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 20:30:14,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:30:14,918 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:30:14,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:14,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:14,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231539746] [2021-03-25 20:30:14,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507387722] [2021-03-25 20:30:14,928 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:14,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-25 20:30:14,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:30:14,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 20:30:14,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:14,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:14,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:14,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:14,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:14,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:14,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:14,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:14,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:14,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:15,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:15,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:15,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:30:15,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:15,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:15,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:15,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,038 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:15,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,039 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:15,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:15,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:15,040 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:15,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:15,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:15,045 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-03-25 20:30:15,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:15,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:15,046 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:15,054 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2021-03-25 20:30:15,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:15,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:15,058 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:15,073 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:15,077 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:15,077 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2021-03-25 20:30:15,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:15,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:15,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:15,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:15,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:15,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:15,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:15,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:15,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:15,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:15,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:15,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:15,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-25 20:30:15,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:15,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:15,119 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:15,124 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,125 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:15,125 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 20:30:15,125 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,143 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-25 20:30:15,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:15,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,147 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:15,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:15,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:15,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:15,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:15,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:15,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2021-03-25 20:30:15,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816982805] [2021-03-25 20:30:15,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-03-25 20:30:15,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:15,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-03-25 20:30:15,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-03-25 20:30:15,183 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2021-03-25 20:30:15,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 424 flow. Second operand has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:15,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:15,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2021-03-25 20:30:15,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:15,537 INFO L129 PetriNetUnfolder]: 322/560 cut-off events. [2021-03-25 20:30:15,538 INFO L130 PetriNetUnfolder]: For 2204/2215 co-relation queries the response was YES. [2021-03-25 20:30:15,540 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 560 events. 322/560 cut-off events. For 2204/2215 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2445 event pairs, 41 based on Foata normal form. 12/572 useless extension candidates. Maximal degree in co-relation 2516. Up to 240 conditions per place. [2021-03-25 20:30:15,543 INFO L132 encePairwiseOnDemand]: 28/37 looper letters, 50 selfloop transitions, 35 changer transitions 1/92 dead transitions. [2021-03-25 20:30:15,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 920 flow [2021-03-25 20:30:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 20:30:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 20:30:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2021-03-25 20:30:15,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2021-03-25 20:30:15,545 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 186 transitions. [2021-03-25 20:30:15,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 186 transitions. [2021-03-25 20:30:15,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:15,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 186 transitions. [2021-03-25 20:30:15,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 20.666666666666668) internal successors, (186), 9 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:15,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:15,548 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:15,548 INFO L185 Difference]: Start difference. First operand has 56 places, 48 transitions, 424 flow. Second operand 9 states and 186 transitions. [2021-03-25 20:30:15,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 920 flow [2021-03-25 20:30:15,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 884 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-03-25 20:30:15,558 INFO L241 Difference]: Finished difference. Result has 67 places, 62 transitions, 651 flow [2021-03-25 20:30:15,558 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=651, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2021-03-25 20:30:15,558 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 44 predicate places. [2021-03-25 20:30:15,558 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:15,559 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 62 transitions, 651 flow [2021-03-25 20:30:15,559 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 651 flow [2021-03-25 20:30:15,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 62 transitions, 651 flow [2021-03-25 20:30:15,579 INFO L129 PetriNetUnfolder]: 103/253 cut-off events. [2021-03-25 20:30:15,579 INFO L130 PetriNetUnfolder]: For 1320/1373 co-relation queries the response was YES. [2021-03-25 20:30:15,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1221 conditions, 253 events. 103/253 cut-off events. For 1320/1373 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1214 event pairs, 10 based on Foata normal form. 6/246 useless extension candidates. Maximal degree in co-relation 1136. Up to 91 conditions per place. [2021-03-25 20:30:15,584 INFO L142 LiptonReduction]: Number of co-enabled transitions 380 [2021-03-25 20:30:15,703 INFO L154 LiptonReduction]: Checked pairs total: 72 [2021-03-25 20:30:15,703 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 20:30:15,703 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 145 [2021-03-25 20:30:15,704 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 659 flow [2021-03-25 20:30:15,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 15.666666666666666) internal successors, (188), 12 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:15,705 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:15,705 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:15,926 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:15,927 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:15,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:15,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1764702536, now seen corresponding path program 4 times [2021-03-25 20:30:15,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:15,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474118331] [2021-03-25 20:30:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:15,980 INFO L142 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size [2021-03-25 20:30:15,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:15,997 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.0 percent of original size [2021-03-25 20:30:15,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:30:16,010 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.0 percent of original size [2021-03-25 20:30:16,011 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:30:16,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:16,034 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:30:16,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:16,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474118331] [2021-03-25 20:30:16,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240789073] [2021-03-25 20:30:16,045 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:16,072 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-25 20:30:16,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:30:16,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 20:30:16,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:16,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:16,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,096 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:16,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:16,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:16,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,098 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:16,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:16,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:16,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:16,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:16,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:16,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:30:16,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:16,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:16,108 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:16,119 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,120 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:16,120 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-03-25 20:30:16,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,153 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,155 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 20:30:16,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:16,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,157 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:16,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:16,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:30:16,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:16,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,192 INFO L147 QuantifierPusher]: treesize reduction 2, result has 93.9 percent of original size 31 [2021-03-25 20:30:16,193 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.1 percent of original size [2021-03-25 20:30:16,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:16,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:16,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:16,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:16,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:16,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:16,213 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-25 20:30:16,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:16,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:16,215 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:16,223 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,224 INFO L142 QuantifierPusher]: treesize reduction -1, result has 104.3 percent of original size [2021-03-25 20:30:16,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,225 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:16,225 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:24 [2021-03-25 20:30:16,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:30:16,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:16,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:16,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:16,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:16,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,267 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:16,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:16,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:16,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-25 20:30:16,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:16,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:16,273 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:16,278 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,279 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:16,279 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 20:30:16,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:16,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:16,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:16,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 20:30:16,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935741294] [2021-03-25 20:30:16,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 20:30:16,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:16,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 20:30:16,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 20:30:16,302 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2021-03-25 20:30:16,302 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 659 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:16,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:16,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2021-03-25 20:30:16,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:16,531 INFO L129 PetriNetUnfolder]: 359/612 cut-off events. [2021-03-25 20:30:16,531 INFO L130 PetriNetUnfolder]: For 4090/4096 co-relation queries the response was YES. [2021-03-25 20:30:16,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 612 events. 359/612 cut-off events. For 4090/4096 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2770 event pairs, 93 based on Foata normal form. 7/619 useless extension candidates. Maximal degree in co-relation 3299. Up to 506 conditions per place. [2021-03-25 20:30:16,538 INFO L132 encePairwiseOnDemand]: 35/41 looper letters, 71 selfloop transitions, 17 changer transitions 0/94 dead transitions. [2021-03-25 20:30:16,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 1075 flow [2021-03-25 20:30:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 20:30:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 20:30:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2021-03-25 20:30:16,539 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5017421602787456 [2021-03-25 20:30:16,539 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 144 transitions. [2021-03-25 20:30:16,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 144 transitions. [2021-03-25 20:30:16,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:16,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 144 transitions. [2021-03-25 20:30:16,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:16,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:16,541 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 41.0) internal successors, (328), 8 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:16,541 INFO L185 Difference]: Start difference. First operand has 66 places, 62 transitions, 659 flow. Second operand 7 states and 144 transitions. [2021-03-25 20:30:16,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 1075 flow [2021-03-25 20:30:16,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 1002 flow, removed 26 selfloop flow, removed 4 redundant places. [2021-03-25 20:30:16,555 INFO L241 Difference]: Finished difference. Result has 70 places, 74 transitions, 776 flow [2021-03-25 20:30:16,556 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=776, PETRI_PLACES=70, PETRI_TRANSITIONS=74} [2021-03-25 20:30:16,556 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 47 predicate places. [2021-03-25 20:30:16,556 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:16,556 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 74 transitions, 776 flow [2021-03-25 20:30:16,556 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 74 transitions, 776 flow [2021-03-25 20:30:16,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 74 transitions, 776 flow [2021-03-25 20:30:16,579 INFO L129 PetriNetUnfolder]: 103/256 cut-off events. [2021-03-25 20:30:16,580 INFO L130 PetriNetUnfolder]: For 1378/1433 co-relation queries the response was YES. [2021-03-25 20:30:16,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 256 events. 103/256 cut-off events. For 1378/1433 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1267 event pairs, 11 based on Foata normal form. 4/254 useless extension candidates. Maximal degree in co-relation 1185. Up to 85 conditions per place. [2021-03-25 20:30:16,585 INFO L142 LiptonReduction]: Number of co-enabled transitions 444 [2021-03-25 20:30:16,755 INFO L154 LiptonReduction]: Checked pairs total: 161 [2021-03-25 20:30:16,755 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 20:30:16,756 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 200 [2021-03-25 20:30:16,757 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 790 flow [2021-03-25 20:30:16,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:16,757 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:16,757 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:16,972 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:16,972 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash 388538190, now seen corresponding path program 1 times [2021-03-25 20:30:16,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:16,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860932666] [2021-03-25 20:30:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:17,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:17,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:17,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860932666] [2021-03-25 20:30:17,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598232381] [2021-03-25 20:30:17,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-25 20:30:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:17,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:17,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:17,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,078 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:17,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:17,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:17,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:17,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:17,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,091 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:17,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:17,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:17,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:17,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:17,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:17,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,112 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-25 20:30:17,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,117 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,118 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:17,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 20:30:17,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:17,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-25 20:30:17,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819618451] [2021-03-25 20:30:17,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 20:30:17,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:17,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 20:30:17,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 20:30:17,122 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 48 [2021-03-25 20:30:17,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:17,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:17,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 48 [2021-03-25 20:30:17,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:17,223 INFO L129 PetriNetUnfolder]: 300/582 cut-off events. [2021-03-25 20:30:17,224 INFO L130 PetriNetUnfolder]: For 3725/3791 co-relation queries the response was YES. [2021-03-25 20:30:17,226 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 582 events. 300/582 cut-off events. For 3725/3791 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3000 event pairs, 37 based on Foata normal form. 24/594 useless extension candidates. Maximal degree in co-relation 2853. Up to 217 conditions per place. [2021-03-25 20:30:17,231 INFO L132 encePairwiseOnDemand]: 44/48 looper letters, 42 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2021-03-25 20:30:17,231 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 1072 flow [2021-03-25 20:30:17,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 20:30:17,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 20:30:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2021-03-25 20:30:17,232 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2021-03-25 20:30:17,232 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 170 transitions. [2021-03-25 20:30:17,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 170 transitions. [2021-03-25 20:30:17,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:17,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 170 transitions. [2021-03-25 20:30:17,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:17,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:17,234 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:17,234 INFO L185 Difference]: Start difference. First operand has 70 places, 74 transitions, 790 flow. Second operand 5 states and 170 transitions. [2021-03-25 20:30:17,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 1072 flow [2021-03-25 20:30:17,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 1022 flow, removed 21 selfloop flow, removed 2 redundant places. [2021-03-25 20:30:17,267 INFO L241 Difference]: Finished difference. Result has 74 places, 77 transitions, 855 flow [2021-03-25 20:30:17,268 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=855, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2021-03-25 20:30:17,268 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 51 predicate places. [2021-03-25 20:30:17,268 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:17,268 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 77 transitions, 855 flow [2021-03-25 20:30:17,268 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 77 transitions, 855 flow [2021-03-25 20:30:17,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 77 transitions, 855 flow [2021-03-25 20:30:17,296 INFO L129 PetriNetUnfolder]: 130/324 cut-off events. [2021-03-25 20:30:17,296 INFO L130 PetriNetUnfolder]: For 2228/2376 co-relation queries the response was YES. [2021-03-25 20:30:17,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1661 conditions, 324 events. 130/324 cut-off events. For 2228/2376 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1758 event pairs, 12 based on Foata normal form. 6/314 useless extension candidates. Maximal degree in co-relation 1587. Up to 106 conditions per place. [2021-03-25 20:30:17,302 INFO L142 LiptonReduction]: Number of co-enabled transitions 484 [2021-03-25 20:30:17,339 INFO L154 LiptonReduction]: Checked pairs total: 24 [2021-03-25 20:30:17,339 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 20:30:17,339 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-03-25 20:30:17,340 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 857 flow [2021-03-25 20:30:17,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:17,340 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:17,340 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:17,557 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-03-25 20:30:17,557 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:17,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:17,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1290588240, now seen corresponding path program 1 times [2021-03-25 20:30:17,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:17,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100645575] [2021-03-25 20:30:17,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:17,591 INFO L142 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size [2021-03-25 20:30:17,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,599 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-25 20:30:17,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:17,610 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-25 20:30:17,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:17,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:17,628 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:30:17,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:17,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100645575] [2021-03-25 20:30:17,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816768096] [2021-03-25 20:30:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:17,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 20:30:17,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:17,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:17,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:17,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:17,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,675 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:17,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:17,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:17,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:17,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:30:17,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:17,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:17,684 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:17,693 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,694 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:17,694 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-03-25 20:30:17,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,713 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 20:30:17,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:17,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,716 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:17,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:30:17,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:17,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:30:17,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:17,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:17,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,750 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:17,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:17,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-25 20:30:17,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:17,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:17,756 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:17,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:17,763 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:17,763 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2021-03-25 20:30:17,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:17,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:17,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:17,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:17,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:17,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:17,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:17,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,786 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:17,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:17,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,788 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:17,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:17,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:17,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-25 20:30:17,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:17,796 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:17,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,802 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:17,802 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 20:30:17,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:17,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:17,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:17,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:17,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 20:30:17,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705895933] [2021-03-25 20:30:17,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 20:30:17,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:17,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 20:30:17,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 20:30:17,830 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2021-03-25 20:30:17,830 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 857 flow. Second operand has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:17,830 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:17,830 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2021-03-25 20:30:17,830 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:18,073 INFO L129 PetriNetUnfolder]: 469/824 cut-off events. [2021-03-25 20:30:18,073 INFO L130 PetriNetUnfolder]: For 6722/6733 co-relation queries the response was YES. [2021-03-25 20:30:18,076 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4652 conditions, 824 events. 469/824 cut-off events. For 6722/6733 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4122 event pairs, 143 based on Foata normal form. 10/834 useless extension candidates. Maximal degree in co-relation 4504. Up to 692 conditions per place. [2021-03-25 20:30:18,082 INFO L132 encePairwiseOnDemand]: 42/49 looper letters, 79 selfloop transitions, 17 changer transitions 0/102 dead transitions. [2021-03-25 20:30:18,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 102 transitions, 1198 flow [2021-03-25 20:30:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 20:30:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 20:30:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2021-03-25 20:30:18,083 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4402332361516035 [2021-03-25 20:30:18,084 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 151 transitions. [2021-03-25 20:30:18,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 151 transitions. [2021-03-25 20:30:18,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:18,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 151 transitions. [2021-03-25 20:30:18,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:18,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:18,085 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 49.0) internal successors, (392), 8 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:18,085 INFO L185 Difference]: Start difference. First operand has 74 places, 77 transitions, 857 flow. Second operand 7 states and 151 transitions. [2021-03-25 20:30:18,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 102 transitions, 1198 flow [2021-03-25 20:30:18,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 102 transitions, 1164 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-25 20:30:18,102 INFO L241 Difference]: Finished difference. Result has 79 places, 81 transitions, 912 flow [2021-03-25 20:30:18,102 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=912, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2021-03-25 20:30:18,102 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 56 predicate places. [2021-03-25 20:30:18,102 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:18,102 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 81 transitions, 912 flow [2021-03-25 20:30:18,103 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 81 transitions, 912 flow [2021-03-25 20:30:18,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 81 transitions, 912 flow [2021-03-25 20:30:18,133 INFO L129 PetriNetUnfolder]: 143/365 cut-off events. [2021-03-25 20:30:18,133 INFO L130 PetriNetUnfolder]: For 2071/2167 co-relation queries the response was YES. [2021-03-25 20:30:18,136 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1800 conditions, 365 events. 143/365 cut-off events. For 2071/2167 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2068 event pairs, 12 based on Foata normal form. 4/353 useless extension candidates. Maximal degree in co-relation 1699. Up to 113 conditions per place. [2021-03-25 20:30:18,139 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-25 20:30:18,246 INFO L154 LiptonReduction]: Checked pairs total: 57 [2021-03-25 20:30:18,247 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 20:30:18,247 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 145 [2021-03-25 20:30:18,248 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 918 flow [2021-03-25 20:30:18,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.545454545454545) internal successors, (171), 11 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:18,248 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:18,248 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:18,456 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:18,456 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash -617975518, now seen corresponding path program 1 times [2021-03-25 20:30:18,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:18,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668019090] [2021-03-25 20:30:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:18,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:18,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:18,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668019090] [2021-03-25 20:30:18,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724403509] [2021-03-25 20:30:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-25 20:30:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:18,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 20:30:18,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:18,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,524 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:18,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:18,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:18,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:18,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:18,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:18,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:18,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:18,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:18,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:18,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:18,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:18,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:18,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,549 INFO L142 QuantifierPusher]: treesize reduction 1, result has 87.5 percent of original size [2021-03-25 20:30:18,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:18,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:18,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:18,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:18,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:18,561 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-25 20:30:18,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:18,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:18,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:18,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-25 20:30:18,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973727674] [2021-03-25 20:30:18,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 20:30:18,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:18,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 20:30:18,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 20:30:18,570 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 52 [2021-03-25 20:30:18,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 918 flow. Second operand has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:18,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:18,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 52 [2021-03-25 20:30:18,571 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:18,689 INFO L129 PetriNetUnfolder]: 317/634 cut-off events. [2021-03-25 20:30:18,689 INFO L130 PetriNetUnfolder]: For 3812/3909 co-relation queries the response was YES. [2021-03-25 20:30:18,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3225 conditions, 634 events. 317/634 cut-off events. For 3812/3909 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 3465 event pairs, 30 based on Foata normal form. 32/650 useless extension candidates. Maximal degree in co-relation 3094. Up to 198 conditions per place. [2021-03-25 20:30:18,696 INFO L132 encePairwiseOnDemand]: 47/52 looper letters, 53 selfloop transitions, 28 changer transitions 0/111 dead transitions. [2021-03-25 20:30:18,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 111 transitions, 1341 flow [2021-03-25 20:30:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 20:30:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 20:30:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 293 transitions. [2021-03-25 20:30:18,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7043269230769231 [2021-03-25 20:30:18,697 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 293 transitions. [2021-03-25 20:30:18,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 293 transitions. [2021-03-25 20:30:18,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:18,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 293 transitions. [2021-03-25 20:30:18,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 36.625) internal successors, (293), 8 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:18,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:18,700 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 52.0) internal successors, (468), 9 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:18,700 INFO L185 Difference]: Start difference. First operand has 79 places, 81 transitions, 918 flow. Second operand 8 states and 293 transitions. [2021-03-25 20:30:18,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 111 transitions, 1341 flow [2021-03-25 20:30:18,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 111 transitions, 1299 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-25 20:30:18,712 INFO L241 Difference]: Finished difference. Result has 85 places, 90 transitions, 1063 flow [2021-03-25 20:30:18,712 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1063, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2021-03-25 20:30:18,712 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 62 predicate places. [2021-03-25 20:30:18,712 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:18,712 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 90 transitions, 1063 flow [2021-03-25 20:30:18,713 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 90 transitions, 1063 flow [2021-03-25 20:30:18,713 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 90 transitions, 1063 flow [2021-03-25 20:30:18,739 INFO L129 PetriNetUnfolder]: 134/347 cut-off events. [2021-03-25 20:30:18,740 INFO L130 PetriNetUnfolder]: For 2657/2827 co-relation queries the response was YES. [2021-03-25 20:30:18,742 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 347 events. 134/347 cut-off events. For 2657/2827 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1974 event pairs, 11 based on Foata normal form. 9/352 useless extension candidates. Maximal degree in co-relation 1731. Up to 113 conditions per place. [2021-03-25 20:30:18,749 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-25 20:30:18,767 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:18,767 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:18,767 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 55 [2021-03-25 20:30:18,769 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 1063 flow [2021-03-25 20:30:18,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:18,769 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:18,769 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:18,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:18,984 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:18,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:18,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1417895755, now seen corresponding path program 1 times [2021-03-25 20:30:18,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:18,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887764240] [2021-03-25 20:30:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:19,012 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 20:30:19,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:19,017 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 20:30:19,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,021 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 20:30:19,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:19,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887764240] [2021-03-25 20:30:19,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165441016] [2021-03-25 20:30:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:19,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 20:30:19,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:19,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,064 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:19,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:19,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,077 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-25 20:30:19,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,078 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:19,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:19,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:30:19,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:19,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:30:19,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:19,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:19,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:19,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2021-03-25 20:30:19,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352682537] [2021-03-25 20:30:19,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 20:30:19,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:19,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 20:30:19,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-25 20:30:19,098 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2021-03-25 20:30:19,098 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 1063 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:19,098 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:19,098 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2021-03-25 20:30:19,098 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:19,334 INFO L129 PetriNetUnfolder]: 592/1085 cut-off events. [2021-03-25 20:30:19,335 INFO L130 PetriNetUnfolder]: For 8152/8163 co-relation queries the response was YES. [2021-03-25 20:30:19,340 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6130 conditions, 1085 events. 592/1085 cut-off events. For 8152/8163 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 6180 event pairs, 51 based on Foata normal form. 14/1099 useless extension candidates. Maximal degree in co-relation 5883. Up to 407 conditions per place. [2021-03-25 20:30:19,347 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 98 selfloop transitions, 48 changer transitions 0/152 dead transitions. [2021-03-25 20:30:19,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 152 transitions, 1915 flow [2021-03-25 20:30:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 20:30:19,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 20:30:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2021-03-25 20:30:19,348 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.43653846153846154 [2021-03-25 20:30:19,348 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 227 transitions. [2021-03-25 20:30:19,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 227 transitions. [2021-03-25 20:30:19,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:19,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 227 transitions. [2021-03-25 20:30:19,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.7) internal successors, (227), 10 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:19,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:19,350 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:19,350 INFO L185 Difference]: Start difference. First operand has 85 places, 90 transitions, 1063 flow. Second operand 10 states and 227 transitions. [2021-03-25 20:30:19,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 152 transitions, 1915 flow [2021-03-25 20:30:19,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 152 transitions, 1841 flow, removed 29 selfloop flow, removed 2 redundant places. [2021-03-25 20:30:19,376 INFO L241 Difference]: Finished difference. Result has 95 places, 103 transitions, 1354 flow [2021-03-25 20:30:19,376 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1354, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2021-03-25 20:30:19,376 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 72 predicate places. [2021-03-25 20:30:19,376 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:19,377 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 103 transitions, 1354 flow [2021-03-25 20:30:19,377 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 103 transitions, 1354 flow [2021-03-25 20:30:19,378 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 95 places, 103 transitions, 1354 flow [2021-03-25 20:30:19,413 INFO L129 PetriNetUnfolder]: 164/438 cut-off events. [2021-03-25 20:30:19,413 INFO L130 PetriNetUnfolder]: For 3900/4086 co-relation queries the response was YES. [2021-03-25 20:30:19,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2561 conditions, 438 events. 164/438 cut-off events. For 3900/4086 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2680 event pairs, 15 based on Foata normal form. 11/443 useless extension candidates. Maximal degree in co-relation 2457. Up to 134 conditions per place. [2021-03-25 20:30:19,421 INFO L142 LiptonReduction]: Number of co-enabled transitions 790 [2021-03-25 20:30:19,427 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:19,427 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:19,427 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-25 20:30:19,428 INFO L480 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 1354 flow [2021-03-25 20:30:19,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:19,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:19,428 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:19,643 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-03-25 20:30:19,644 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:19,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2058412742, now seen corresponding path program 1 times [2021-03-25 20:30:19,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:19,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887085358] [2021-03-25 20:30:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:19,657 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 20:30:19,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:19,663 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 20:30:19,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,674 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 20:30:19,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:19,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887085358] [2021-03-25 20:30:19,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903401056] [2021-03-25 20:30:19,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:19,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 20:30:19,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:19,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,714 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:19,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:19,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,728 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,731 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-25 20:30:19,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,732 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:19,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:19,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:19,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,745 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:19,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:19,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,746 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:19,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:19,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:19,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:19,751 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-25 20:30:19,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:19,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:19,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:19,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-03-25 20:30:19,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056450447] [2021-03-25 20:30:19,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 20:30:19,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:19,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 20:30:19,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 20:30:19,761 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2021-03-25 20:30:19,761 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 1354 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:19,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:19,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2021-03-25 20:30:19,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:20,027 INFO L129 PetriNetUnfolder]: 593/1103 cut-off events. [2021-03-25 20:30:20,027 INFO L130 PetriNetUnfolder]: For 10867/10878 co-relation queries the response was YES. [2021-03-25 20:30:20,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6749 conditions, 1103 events. 593/1103 cut-off events. For 10867/10878 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6433 event pairs, 42 based on Foata normal form. 24/1127 useless extension candidates. Maximal degree in co-relation 6556. Up to 360 conditions per place. [2021-03-25 20:30:20,040 INFO L132 encePairwiseOnDemand]: 45/52 looper letters, 104 selfloop transitions, 51 changer transitions 1/162 dead transitions. [2021-03-25 20:30:20,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 162 transitions, 2156 flow [2021-03-25 20:30:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 20:30:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 20:30:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 247 transitions. [2021-03-25 20:30:20,042 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2021-03-25 20:30:20,042 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 247 transitions. [2021-03-25 20:30:20,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 247 transitions. [2021-03-25 20:30:20,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:20,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 247 transitions. [2021-03-25 20:30:20,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:20,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:20,044 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 52.0) internal successors, (624), 12 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:20,044 INFO L185 Difference]: Start difference. First operand has 95 places, 103 transitions, 1354 flow. Second operand 11 states and 247 transitions. [2021-03-25 20:30:20,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 162 transitions, 2156 flow [2021-03-25 20:30:20,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 162 transitions, 2080 flow, removed 30 selfloop flow, removed 3 redundant places. [2021-03-25 20:30:20,075 INFO L241 Difference]: Finished difference. Result has 104 places, 103 transitions, 1426 flow [2021-03-25 20:30:20,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1261, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1426, PETRI_PLACES=104, PETRI_TRANSITIONS=103} [2021-03-25 20:30:20,076 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 81 predicate places. [2021-03-25 20:30:20,076 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:20,076 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 103 transitions, 1426 flow [2021-03-25 20:30:20,076 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 103 transitions, 1426 flow [2021-03-25 20:30:20,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 103 transitions, 1426 flow [2021-03-25 20:30:20,114 INFO L129 PetriNetUnfolder]: 161/444 cut-off events. [2021-03-25 20:30:20,114 INFO L130 PetriNetUnfolder]: For 4459/4624 co-relation queries the response was YES. [2021-03-25 20:30:20,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 444 events. 161/444 cut-off events. For 4459/4624 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2830 event pairs, 15 based on Foata normal form. 14/449 useless extension candidates. Maximal degree in co-relation 2550. Up to 132 conditions per place. [2021-03-25 20:30:20,123 INFO L142 LiptonReduction]: Number of co-enabled transitions 796 [2021-03-25 20:30:20,129 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:20,129 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:20,129 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-25 20:30:20,130 INFO L480 AbstractCegarLoop]: Abstraction has has 104 places, 103 transitions, 1426 flow [2021-03-25 20:30:20,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:20,131 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:20,131 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:20,352 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:20,352 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:20,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1870605874, now seen corresponding path program 5 times [2021-03-25 20:30:20,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:20,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854295083] [2021-03-25 20:30:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:20,380 INFO L142 QuantifierPusher]: treesize reduction 15, result has 51.6 percent of original size [2021-03-25 20:30:20,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,388 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.5 percent of original size [2021-03-25 20:30:20,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:30:20,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:20,402 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 20:30:20,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:30:20,411 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:30:20,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:20,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854295083] [2021-03-25 20:30:20,419 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117549948] [2021-03-25 20:30:20,419 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-25 20:30:20,460 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 20:30:20,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:30:20,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjunts are in the unsatisfiable core [2021-03-25 20:30:20,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:20,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:20,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:20,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,489 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:20,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:30:20,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:20,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:30:20,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,493 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,493 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:20,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:30:20,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:30:20,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:20,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:20,500 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:20,511 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:20,514 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:20,514 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:33 [2021-03-25 20:30:20,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:20,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:20,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:20,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:20,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:20,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:20,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:20,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-03-25 20:30:20,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:20,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:20,552 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:20,559 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,561 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:20,561 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:23 [2021-03-25 20:30:20,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:30:20,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,588 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:20,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:30:20,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:20,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:20,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:20,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:20,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,632 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:20,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 20:30:20,636 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,637 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:20,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:20,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:20,642 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-25 20:30:20,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-25 20:30:20,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:20,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:20,644 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:20,651 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:20,652 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:20,652 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:15 [2021-03-25 20:30:20,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:20,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:20,672 INFO L142 QuantifierPusher]: treesize reduction 1, result has 94.7 percent of original size [2021-03-25 20:30:20,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:30:20,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,673 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:20,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:20,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:20,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:20,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:20,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:20,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:20,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2021-03-25 20:30:20,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416913822] [2021-03-25 20:30:20,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-25 20:30:20,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-25 20:30:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2021-03-25 20:30:20,710 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2021-03-25 20:30:20,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 103 transitions, 1426 flow. Second operand has 13 states, 13 states have (on average 15.538461538461538) internal successors, (202), 13 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:20,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:20,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2021-03-25 20:30:20,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:21,287 INFO L129 PetriNetUnfolder]: 715/1287 cut-off events. [2021-03-25 20:30:21,288 INFO L130 PetriNetUnfolder]: For 16940/16958 co-relation queries the response was YES. [2021-03-25 20:30:21,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8262 conditions, 1287 events. 715/1287 cut-off events. For 16940/16958 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 7394 event pairs, 199 based on Foata normal form. 14/1299 useless extension candidates. Maximal degree in co-relation 8062. Up to 933 conditions per place. [2021-03-25 20:30:21,303 INFO L132 encePairwiseOnDemand]: 42/52 looper letters, 125 selfloop transitions, 37 changer transitions 2/170 dead transitions. [2021-03-25 20:30:21,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 170 transitions, 2483 flow [2021-03-25 20:30:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 20:30:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 20:30:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 224 transitions. [2021-03-25 20:30:21,304 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2021-03-25 20:30:21,304 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 224 transitions. [2021-03-25 20:30:21,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 224 transitions. [2021-03-25 20:30:21,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:21,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 224 transitions. [2021-03-25 20:30:21,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.4) internal successors, (224), 10 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:21,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:21,308 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:21,308 INFO L185 Difference]: Start difference. First operand has 104 places, 103 transitions, 1426 flow. Second operand 10 states and 224 transitions. [2021-03-25 20:30:21,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 170 transitions, 2483 flow [2021-03-25 20:30:21,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 170 transitions, 2352 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-03-25 20:30:21,344 INFO L241 Difference]: Finished difference. Result has 110 places, 126 transitions, 1781 flow [2021-03-25 20:30:21,344 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1781, PETRI_PLACES=110, PETRI_TRANSITIONS=126} [2021-03-25 20:30:21,344 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 87 predicate places. [2021-03-25 20:30:21,344 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:21,344 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 126 transitions, 1781 flow [2021-03-25 20:30:21,345 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 126 transitions, 1781 flow [2021-03-25 20:30:21,346 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 126 transitions, 1781 flow [2021-03-25 20:30:21,394 INFO L129 PetriNetUnfolder]: 213/577 cut-off events. [2021-03-25 20:30:21,394 INFO L130 PetriNetUnfolder]: For 6638/6781 co-relation queries the response was YES. [2021-03-25 20:30:21,398 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 577 events. 213/577 cut-off events. For 6638/6781 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 3900 event pairs, 16 based on Foata normal form. 17/582 useless extension candidates. Maximal degree in co-relation 3417. Up to 165 conditions per place. [2021-03-25 20:30:21,404 INFO L142 LiptonReduction]: Number of co-enabled transitions 966 [2021-03-25 20:30:21,438 INFO L154 LiptonReduction]: Checked pairs total: 6 [2021-03-25 20:30:21,438 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 20:30:21,438 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-03-25 20:30:21,441 INFO L480 AbstractCegarLoop]: Abstraction has has 110 places, 126 transitions, 1784 flow [2021-03-25 20:30:21,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 15.538461538461538) internal successors, (202), 13 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:21,442 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:21,442 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:21,659 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-03-25 20:30:21,660 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash -280549092, now seen corresponding path program 6 times [2021-03-25 20:30:21,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:21,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068207310] [2021-03-25 20:30:21,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:21,681 INFO L142 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size [2021-03-25 20:30:21,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,693 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.0 percent of original size [2021-03-25 20:30:21,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:30:21,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,714 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:30:21,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:21,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068207310] [2021-03-25 20:30:21,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395602332] [2021-03-25 20:30:21,721 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:21,780 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2021-03-25 20:30:21,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:30:21,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 20:30:21,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:21,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:21,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,794 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:21,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:21,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:21,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,795 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:21,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:21,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:21,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,797 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:21,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:21,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:21,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:30:21,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:21,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:21,802 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:21,809 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,810 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:21,810 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2021-03-25 20:30:21,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:21,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,835 INFO L147 QuantifierPusher]: treesize reduction 2, result has 92.9 percent of original size 26 [2021-03-25 20:30:21,836 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.1 percent of original size [2021-03-25 20:30:21,836 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:21,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:21,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:30:21,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,839 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:21,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:21,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:30:21,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-25 20:30:21,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:21,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:21,846 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:21,851 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,851 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-25 20:30:21,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,852 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:21,852 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:19 [2021-03-25 20:30:21,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,873 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,874 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:21,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:21,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:21,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:21,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:21,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:21,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:21,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-25 20:30:21,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:21,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:21,887 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:21,891 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,892 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:21,892 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 20:30:21,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,905 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-25 20:30:21,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:21,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,906 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:21,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:21,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:21,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,910 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:21,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:21,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:21,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 20:30:21,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179867565] [2021-03-25 20:30:21,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 20:30:21,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 20:30:21,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2021-03-25 20:30:21,927 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-25 20:30:21,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 126 transitions, 1784 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:21,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:21,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-25 20:30:21,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:22,500 INFO L129 PetriNetUnfolder]: 860/1535 cut-off events. [2021-03-25 20:30:22,500 INFO L130 PetriNetUnfolder]: For 22314/22325 co-relation queries the response was YES. [2021-03-25 20:30:22,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10170 conditions, 1535 events. 860/1535 cut-off events. For 22314/22325 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 9007 event pairs, 227 based on Foata normal form. 14/1549 useless extension candidates. Maximal degree in co-relation 9957. Up to 931 conditions per place. [2021-03-25 20:30:22,525 INFO L132 encePairwiseOnDemand]: 42/53 looper letters, 138 selfloop transitions, 51 changer transitions 14/209 dead transitions. [2021-03-25 20:30:22,525 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 209 transitions, 3305 flow [2021-03-25 20:30:22,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 20:30:22,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 20:30:22,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2021-03-25 20:30:22,526 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.42641509433962266 [2021-03-25 20:30:22,526 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 226 transitions. [2021-03-25 20:30:22,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 226 transitions. [2021-03-25 20:30:22,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:22,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 226 transitions. [2021-03-25 20:30:22,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 22.6) internal successors, (226), 10 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:22,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:22,531 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 53.0) internal successors, (583), 11 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:22,531 INFO L185 Difference]: Start difference. First operand has 110 places, 126 transitions, 1784 flow. Second operand 10 states and 226 transitions. [2021-03-25 20:30:22,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 209 transitions, 3305 flow [2021-03-25 20:30:22,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 209 transitions, 3065 flow, removed 113 selfloop flow, removed 2 redundant places. [2021-03-25 20:30:22,583 INFO L241 Difference]: Finished difference. Result has 121 places, 146 transitions, 2103 flow [2021-03-25 20:30:22,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2103, PETRI_PLACES=121, PETRI_TRANSITIONS=146} [2021-03-25 20:30:22,584 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 98 predicate places. [2021-03-25 20:30:22,584 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:22,584 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 121 places, 146 transitions, 2103 flow [2021-03-25 20:30:22,584 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 121 places, 146 transitions, 2103 flow [2021-03-25 20:30:22,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 146 transitions, 2103 flow [2021-03-25 20:30:22,640 INFO L129 PetriNetUnfolder]: 236/597 cut-off events. [2021-03-25 20:30:22,640 INFO L130 PetriNetUnfolder]: For 8231/8736 co-relation queries the response was YES. [2021-03-25 20:30:22,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3738 conditions, 597 events. 236/597 cut-off events. For 8231/8736 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3872 event pairs, 18 based on Foata normal form. 22/599 useless extension candidates. Maximal degree in co-relation 3627. Up to 175 conditions per place. [2021-03-25 20:30:22,650 INFO L142 LiptonReduction]: Number of co-enabled transitions 1082 [2021-03-25 20:30:22,659 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:22,660 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:22,660 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 76 [2021-03-25 20:30:22,660 INFO L480 AbstractCegarLoop]: Abstraction has has 121 places, 146 transitions, 2103 flow [2021-03-25 20:30:22,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:22,660 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:22,661 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:22,883 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-03-25 20:30:22,883 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:22,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:22,883 INFO L82 PathProgramCache]: Analyzing trace with hash -291306035, now seen corresponding path program 1 times [2021-03-25 20:30:22,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:22,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056765538] [2021-03-25 20:30:22,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:22,906 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,907 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:22,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:22,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056765538] [2021-03-25 20:30:22,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117023779] [2021-03-25 20:30:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-25 20:30:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:22,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 20:30:22,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:22,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:22,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:22,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:22,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:22,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,959 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:22,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:22,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:22,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,961 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,961 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:22,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:22,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:22,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:22,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:22,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:22,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:22,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:22,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:22,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:22,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:22,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:22,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:22,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:22,983 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-25 20:30:22,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,987 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,988 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:22,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:22,989 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:22,989 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-25 20:30:22,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555128421] [2021-03-25 20:30:22,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 20:30:22,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:22,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 20:30:22,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 20:30:22,992 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 53 [2021-03-25 20:30:22,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 146 transitions, 2103 flow. Second operand has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:22,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:22,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 53 [2021-03-25 20:30:22,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:23,144 INFO L129 PetriNetUnfolder]: 625/1241 cut-off events. [2021-03-25 20:30:23,144 INFO L130 PetriNetUnfolder]: For 15734/15995 co-relation queries the response was YES. [2021-03-25 20:30:23,152 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7932 conditions, 1241 events. 625/1241 cut-off events. For 15734/15995 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 7967 event pairs, 86 based on Foata normal form. 29/1220 useless extension candidates. Maximal degree in co-relation 7738. Up to 330 conditions per place. [2021-03-25 20:30:23,157 INFO L132 encePairwiseOnDemand]: 49/53 looper letters, 68 selfloop transitions, 61 changer transitions 0/172 dead transitions. [2021-03-25 20:30:23,157 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 172 transitions, 2699 flow [2021-03-25 20:30:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 20:30:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 20:30:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2021-03-25 20:30:23,158 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.720125786163522 [2021-03-25 20:30:23,158 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 229 transitions. [2021-03-25 20:30:23,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 229 transitions. [2021-03-25 20:30:23,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:23,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 229 transitions. [2021-03-25 20:30:23,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:23,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:23,160 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:23,160 INFO L185 Difference]: Start difference. First operand has 121 places, 146 transitions, 2103 flow. Second operand 6 states and 229 transitions. [2021-03-25 20:30:23,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 172 transitions, 2699 flow [2021-03-25 20:30:23,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 172 transitions, 2546 flow, removed 58 selfloop flow, removed 4 redundant places. [2021-03-25 20:30:23,205 INFO L241 Difference]: Finished difference. Result has 125 places, 152 transitions, 2289 flow [2021-03-25 20:30:23,205 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1958, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2289, PETRI_PLACES=125, PETRI_TRANSITIONS=152} [2021-03-25 20:30:23,206 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 102 predicate places. [2021-03-25 20:30:23,206 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:23,206 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 152 transitions, 2289 flow [2021-03-25 20:30:23,206 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 152 transitions, 2289 flow [2021-03-25 20:30:23,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 152 transitions, 2289 flow [2021-03-25 20:30:23,292 INFO L129 PetriNetUnfolder]: 284/748 cut-off events. [2021-03-25 20:30:23,292 INFO L130 PetriNetUnfolder]: For 10701/10993 co-relation queries the response was YES. [2021-03-25 20:30:23,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 748 events. 284/748 cut-off events. For 10701/10993 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5322 event pairs, 19 based on Foata normal form. 21/753 useless extension candidates. Maximal degree in co-relation 4944. Up to 223 conditions per place. [2021-03-25 20:30:23,309 INFO L142 LiptonReduction]: Number of co-enabled transitions 1160 [2021-03-25 20:30:23,317 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:23,317 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:23,317 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 111 [2021-03-25 20:30:23,318 INFO L480 AbstractCegarLoop]: Abstraction has has 125 places, 152 transitions, 2289 flow [2021-03-25 20:30:23,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:23,318 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:23,318 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:23,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-03-25 20:30:23,541 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2116308476, now seen corresponding path program 7 times [2021-03-25 20:30:23,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:23,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023122091] [2021-03-25 20:30:23,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:23,569 INFO L142 QuantifierPusher]: treesize reduction 15, result has 51.6 percent of original size [2021-03-25 20:30:23,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,577 INFO L142 QuantifierPusher]: treesize reduction 8, result has 76.5 percent of original size [2021-03-25 20:30:23,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:30:23,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:23,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:23,598 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:30:23,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:23,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023122091] [2021-03-25 20:30:23,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567475917] [2021-03-25 20:30:23,606 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:23,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 20:30:23,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:23,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:23,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:23,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:23,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:23,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:23,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:23,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:23,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:23,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:23,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:30:23,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:30:23,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:23,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:23,650 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:23,658 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,660 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:23,660 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2021-03-25 20:30:23,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:30:23,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,688 INFO L147 QuantifierPusher]: treesize reduction 2, result has 93.9 percent of original size 31 [2021-03-25 20:30:23,689 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.1 percent of original size [2021-03-25 20:30:23,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:23,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:23,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:23,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,691 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:23,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:23,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:30:23,695 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2021-03-25 20:30:23,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:23,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:23,696 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:23,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,702 INFO L142 QuantifierPusher]: treesize reduction 3, result has 88.5 percent of original size [2021-03-25 20:30:23,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:23,703 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:23,703 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2021-03-25 20:30:23,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:23,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:23,718 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.3 percent of original size [2021-03-25 20:30:23,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:30:23,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,719 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:23,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:23,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:30:23,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:23,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:30:23,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:23,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,737 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:23,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:23,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:23,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,739 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:23,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:23,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:23,742 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-25 20:30:23,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:23,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:23,743 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:23,747 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,747 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:23,748 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 20:30:23,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,767 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:23,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:23,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:23,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 20:30:23,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912479991] [2021-03-25 20:30:23,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 20:30:23,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 20:30:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 20:30:23,772 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-25 20:30:23,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 152 transitions, 2289 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:23,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:23,773 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-25 20:30:23,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:24,133 INFO L129 PetriNetUnfolder]: 993/1781 cut-off events. [2021-03-25 20:30:24,133 INFO L130 PetriNetUnfolder]: For 29607/29618 co-relation queries the response was YES. [2021-03-25 20:30:24,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12691 conditions, 1781 events. 993/1781 cut-off events. For 29607/29618 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10869 event pairs, 306 based on Foata normal form. 14/1795 useless extension candidates. Maximal degree in co-relation 12446. Up to 1447 conditions per place. [2021-03-25 20:30:24,150 INFO L132 encePairwiseOnDemand]: 45/53 looper letters, 153 selfloop transitions, 27 changer transitions 13/199 dead transitions. [2021-03-25 20:30:24,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 199 transitions, 3381 flow [2021-03-25 20:30:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 20:30:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 20:30:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2021-03-25 20:30:24,151 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.40970350404312667 [2021-03-25 20:30:24,151 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 152 transitions. [2021-03-25 20:30:24,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 152 transitions. [2021-03-25 20:30:24,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:24,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 152 transitions. [2021-03-25 20:30:24,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:24,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:24,152 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 53.0) internal successors, (424), 8 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:24,153 INFO L185 Difference]: Start difference. First operand has 125 places, 152 transitions, 2289 flow. Second operand 7 states and 152 transitions. [2021-03-25 20:30:24,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 199 transitions, 3381 flow [2021-03-25 20:30:24,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 199 transitions, 3339 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-03-25 20:30:24,218 INFO L241 Difference]: Finished difference. Result has 132 places, 163 transitions, 2507 flow [2021-03-25 20:30:24,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2258, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2507, PETRI_PLACES=132, PETRI_TRANSITIONS=163} [2021-03-25 20:30:24,218 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 109 predicate places. [2021-03-25 20:30:24,219 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:24,219 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 163 transitions, 2507 flow [2021-03-25 20:30:24,219 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 163 transitions, 2507 flow [2021-03-25 20:30:24,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 132 places, 163 transitions, 2507 flow [2021-03-25 20:30:24,301 INFO L129 PetriNetUnfolder]: 301/781 cut-off events. [2021-03-25 20:30:24,302 INFO L130 PetriNetUnfolder]: For 12084/12398 co-relation queries the response was YES. [2021-03-25 20:30:24,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5251 conditions, 781 events. 301/781 cut-off events. For 12084/12398 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 5612 event pairs, 25 based on Foata normal form. 26/791 useless extension candidates. Maximal degree in co-relation 5090. Up to 232 conditions per place. [2021-03-25 20:30:24,311 INFO L142 LiptonReduction]: Number of co-enabled transitions 1202 [2021-03-25 20:30:24,316 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:24,316 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:24,316 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 97 [2021-03-25 20:30:24,317 INFO L480 AbstractCegarLoop]: Abstraction has has 132 places, 163 transitions, 2507 flow [2021-03-25 20:30:24,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:24,317 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:24,317 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:24,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-03-25 20:30:24,519 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:24,520 INFO L82 PathProgramCache]: Analyzing trace with hash 429636254, now seen corresponding path program 8 times [2021-03-25 20:30:24,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:24,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629589085] [2021-03-25 20:30:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:24,559 INFO L142 QuantifierPusher]: treesize reduction 19, result has 50.0 percent of original size [2021-03-25 20:30:24,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:24,572 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.7 percent of original size [2021-03-25 20:30:24,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:30:24,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:30:24,588 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 20:30:24,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:30:24,596 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:30:24,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:24,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629589085] [2021-03-25 20:30:24,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141015178] [2021-03-25 20:30:24,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-25 20:30:24,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 20:30:24,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:30:24,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 20:30:24,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:24,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:24,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:30:24,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:24,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:24,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:24,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,651 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:24,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:24,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:24,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,653 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:24,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:24,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:30:24,657 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:30:24,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:24,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:24,659 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:24,671 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,672 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:24,672 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-03-25 20:30:24,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:30:24,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,697 INFO L147 QuantifierPusher]: treesize reduction 4, result has 87.1 percent of original size 27 [2021-03-25 20:30:24,698 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.5 percent of original size [2021-03-25 20:30:24,698 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:24,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:24,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:30:24,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:24,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:24,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:30:24,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-03-25 20:30:24,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:24,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:24,705 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:24,711 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:24,711 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:24,711 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2021-03-25 20:30:24,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:24,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:30:24,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:30:24,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,731 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:24,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:24,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:24,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,733 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:24,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:30:24,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:30:24,736 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-03-25 20:30:24,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:24,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:24,738 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:30:24,742 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,743 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:30:24,743 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 20:30:24,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,760 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-25 20:30:24,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:30:24,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:24,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:24,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:30:24,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:24,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:24,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:24,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 20:30:24,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947263356] [2021-03-25 20:30:24,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 20:30:24,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:24,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 20:30:24,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-03-25 20:30:24,786 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-25 20:30:24,786 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 163 transitions, 2507 flow. Second operand has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:24,786 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:24,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-25 20:30:24,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:25,265 INFO L129 PetriNetUnfolder]: 1203/2178 cut-off events. [2021-03-25 20:30:25,265 INFO L130 PetriNetUnfolder]: For 38732/38750 co-relation queries the response was YES. [2021-03-25 20:30:25,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15792 conditions, 2178 events. 1203/2178 cut-off events. For 38732/38750 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 13752 event pairs, 309 based on Foata normal form. 18/2194 useless extension candidates. Maximal degree in co-relation 15537. Up to 1508 conditions per place. [2021-03-25 20:30:25,285 INFO L132 encePairwiseOnDemand]: 43/53 looper letters, 188 selfloop transitions, 50 changer transitions 2/246 dead transitions. [2021-03-25 20:30:25,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 246 transitions, 4039 flow [2021-03-25 20:30:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 20:30:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 20:30:25,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 251 transitions. [2021-03-25 20:30:25,300 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4305317324185249 [2021-03-25 20:30:25,300 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 251 transitions. [2021-03-25 20:30:25,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 251 transitions. [2021-03-25 20:30:25,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:25,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 251 transitions. [2021-03-25 20:30:25,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 22.818181818181817) internal successors, (251), 11 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:25,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:25,302 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 53.0) internal successors, (636), 12 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:25,302 INFO L185 Difference]: Start difference. First operand has 132 places, 163 transitions, 2507 flow. Second operand 11 states and 251 transitions. [2021-03-25 20:30:25,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 246 transitions, 4039 flow [2021-03-25 20:30:25,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 246 transitions, 3934 flow, removed 43 selfloop flow, removed 2 redundant places. [2021-03-25 20:30:25,438 INFO L241 Difference]: Finished difference. Result has 147 places, 189 transitions, 3066 flow [2021-03-25 20:30:25,439 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2443, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3066, PETRI_PLACES=147, PETRI_TRANSITIONS=189} [2021-03-25 20:30:25,439 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 124 predicate places. [2021-03-25 20:30:25,439 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:25,439 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 189 transitions, 3066 flow [2021-03-25 20:30:25,439 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 189 transitions, 3066 flow [2021-03-25 20:30:25,441 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 147 places, 189 transitions, 3066 flow [2021-03-25 20:30:25,515 INFO L129 PetriNetUnfolder]: 345/905 cut-off events. [2021-03-25 20:30:25,515 INFO L130 PetriNetUnfolder]: For 15182/15490 co-relation queries the response was YES. [2021-03-25 20:30:25,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6405 conditions, 905 events. 345/905 cut-off events. For 15182/15490 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6677 event pairs, 27 based on Foata normal form. 25/908 useless extension candidates. Maximal degree in co-relation 6223. Up to 269 conditions per place. [2021-03-25 20:30:25,528 INFO L142 LiptonReduction]: Number of co-enabled transitions 1386 [2021-03-25 20:30:25,535 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:25,535 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:25,535 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 96 [2021-03-25 20:30:25,536 INFO L480 AbstractCegarLoop]: Abstraction has has 147 places, 189 transitions, 3066 flow [2021-03-25 20:30:25,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 15.727272727272727) internal successors, (173), 11 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:25,536 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:25,536 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:25,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:25,736 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:25,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1951992119, now seen corresponding path program 9 times [2021-03-25 20:30:25,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:25,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122881124] [2021-03-25 20:30:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:25,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:25,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:25,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122881124] [2021-03-25 20:30:25,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083938037] [2021-03-25 20:30:25,760 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:25,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-25 20:30:25,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:30:25,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 20:30:25,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:25,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,807 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:25,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:25,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:25,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,808 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:25,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:25,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:25,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,823 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:25,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:25,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:25,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:25,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:25,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:25,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:25,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:25,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:25,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:25,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,842 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:25,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:25,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:25,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:25,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:25,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 20:30:25,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:25,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 20:30:25,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205541332] [2021-03-25 20:30:25,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 20:30:25,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:25,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 20:30:25,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-25 20:30:25,859 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-25 20:30:25,859 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 189 transitions, 3066 flow. Second operand has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:25,859 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:25,859 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-25 20:30:25,859 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:26,752 INFO L129 PetriNetUnfolder]: 2416/4318 cut-off events. [2021-03-25 20:30:26,753 INFO L130 PetriNetUnfolder]: For 97839/97850 co-relation queries the response was YES. [2021-03-25 20:30:26,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33923 conditions, 4318 events. 2416/4318 cut-off events. For 97839/97850 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 30702 event pairs, 187 based on Foata normal form. 158/4476 useless extension candidates. Maximal degree in co-relation 33308. Up to 1270 conditions per place. [2021-03-25 20:30:26,800 INFO L132 encePairwiseOnDemand]: 29/53 looper letters, 336 selfloop transitions, 223 changer transitions 0/565 dead transitions. [2021-03-25 20:30:26,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 565 transitions, 10538 flow [2021-03-25 20:30:26,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-03-25 20:30:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2021-03-25 20:30:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 493 transitions. [2021-03-25 20:30:26,802 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4044298605414274 [2021-03-25 20:30:26,802 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 493 transitions. [2021-03-25 20:30:26,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 493 transitions. [2021-03-25 20:30:26,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:26,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 493 transitions. [2021-03-25 20:30:26,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 21.434782608695652) internal successors, (493), 23 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:26,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 53.0) internal successors, (1272), 24 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:26,805 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 53.0) internal successors, (1272), 24 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:26,805 INFO L185 Difference]: Start difference. First operand has 147 places, 189 transitions, 3066 flow. Second operand 23 states and 493 transitions. [2021-03-25 20:30:26,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 565 transitions, 10538 flow [2021-03-25 20:30:27,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 565 transitions, 10226 flow, removed 149 selfloop flow, removed 2 redundant places. [2021-03-25 20:30:27,020 INFO L241 Difference]: Finished difference. Result has 185 places, 369 transitions, 7345 flow [2021-03-25 20:30:27,020 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2884, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7345, PETRI_PLACES=185, PETRI_TRANSITIONS=369} [2021-03-25 20:30:27,020 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 162 predicate places. [2021-03-25 20:30:27,020 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:27,020 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 185 places, 369 transitions, 7345 flow [2021-03-25 20:30:27,020 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 185 places, 369 transitions, 7345 flow [2021-03-25 20:30:27,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 185 places, 369 transitions, 7345 flow [2021-03-25 20:30:27,307 INFO L129 PetriNetUnfolder]: 1139/2541 cut-off events. [2021-03-25 20:30:27,307 INFO L130 PetriNetUnfolder]: For 101989/103347 co-relation queries the response was YES. [2021-03-25 20:30:27,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23658 conditions, 2541 events. 1139/2541 cut-off events. For 101989/103347 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 20866 event pairs, 136 based on Foata normal form. 122/2541 useless extension candidates. Maximal degree in co-relation 23280. Up to 731 conditions per place. [2021-03-25 20:30:27,354 INFO L142 LiptonReduction]: Number of co-enabled transitions 2194 [2021-03-25 20:30:27,381 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:27,381 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:27,381 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 361 [2021-03-25 20:30:27,381 INFO L480 AbstractCegarLoop]: Abstraction has has 185 places, 369 transitions, 7345 flow [2021-03-25 20:30:27,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 16.1) internal successors, (161), 10 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:27,382 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:27,382 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:27,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:27,604 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:27,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:27,605 INFO L82 PathProgramCache]: Analyzing trace with hash 439356906, now seen corresponding path program 1 times [2021-03-25 20:30:27,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:27,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000753418] [2021-03-25 20:30:27,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:27,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:27,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 20:30:27,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000753418] [2021-03-25 20:30:27,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119574435] [2021-03-25 20:30:27,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:27,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 20:30:27,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:27,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,689 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:27,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:27,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:27,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,692 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:27,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:27,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:27,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,695 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,698 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-25 20:30:27,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:27,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,699 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:27,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:27,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:27,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:27,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,706 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:27,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:27,716 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:27,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,717 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:27,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:27,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:27,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:27,719 INFO L142 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size [2021-03-25 20:30:27,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:27,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 20:30:27,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:27,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-03-25 20:30:27,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817664949] [2021-03-25 20:30:27,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 20:30:27,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 20:30:27,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 20:30:27,727 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2021-03-25 20:30:27,728 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 369 transitions, 7345 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:27,728 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:27,728 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2021-03-25 20:30:27,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:28,988 INFO L129 PetriNetUnfolder]: 3164/5682 cut-off events. [2021-03-25 20:30:28,988 INFO L130 PetriNetUnfolder]: For 248853/248864 co-relation queries the response was YES. [2021-03-25 20:30:29,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57408 conditions, 5682 events. 3164/5682 cut-off events. For 248853/248864 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 41734 event pairs, 381 based on Foata normal form. 109/5791 useless extension candidates. Maximal degree in co-relation 56544. Up to 1957 conditions per place. [2021-03-25 20:30:29,067 INFO L132 encePairwiseOnDemand]: 39/53 looper letters, 503 selfloop transitions, 186 changer transitions 34/729 dead transitions. [2021-03-25 20:30:29,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 729 transitions, 16586 flow [2021-03-25 20:30:29,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 20:30:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 20:30:29,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2021-03-25 20:30:29,068 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.45073375262054505 [2021-03-25 20:30:29,068 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 215 transitions. [2021-03-25 20:30:29,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 215 transitions. [2021-03-25 20:30:29,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:29,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 215 transitions. [2021-03-25 20:30:29,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 23.88888888888889) internal successors, (215), 9 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:29,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:29,070 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 53.0) internal successors, (530), 10 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:29,070 INFO L185 Difference]: Start difference. First operand has 185 places, 369 transitions, 7345 flow. Second operand 9 states and 215 transitions. [2021-03-25 20:30:29,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 729 transitions, 16586 flow [2021-03-25 20:30:29,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 729 transitions, 15469 flow, removed 555 selfloop flow, removed 2 redundant places. [2021-03-25 20:30:29,590 INFO L241 Difference]: Finished difference. Result has 196 places, 468 transitions, 9826 flow [2021-03-25 20:30:29,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=6433, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9826, PETRI_PLACES=196, PETRI_TRANSITIONS=468} [2021-03-25 20:30:29,590 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 173 predicate places. [2021-03-25 20:30:29,590 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:29,590 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 468 transitions, 9826 flow [2021-03-25 20:30:29,591 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 468 transitions, 9826 flow [2021-03-25 20:30:29,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 195 places, 468 transitions, 9826 flow [2021-03-25 20:30:30,110 INFO L129 PetriNetUnfolder]: 1569/3431 cut-off events. [2021-03-25 20:30:30,110 INFO L130 PetriNetUnfolder]: For 157060/158645 co-relation queries the response was YES. [2021-03-25 20:30:30,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34409 conditions, 3431 events. 1569/3431 cut-off events. For 157060/158645 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 28656 event pairs, 172 based on Foata normal form. 155/3448 useless extension candidates. Maximal degree in co-relation 33731. Up to 976 conditions per place. [2021-03-25 20:30:30,175 INFO L142 LiptonReduction]: Number of co-enabled transitions 2422 [2021-03-25 20:30:30,210 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:30,211 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:30,211 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 621 [2021-03-25 20:30:30,211 INFO L480 AbstractCegarLoop]: Abstraction has has 195 places, 468 transitions, 9826 flow [2021-03-25 20:30:30,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:30,211 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:30,211 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:30,411 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:30,412 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:30,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1140117948, now seen corresponding path program 10 times [2021-03-25 20:30:30,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:30,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731078620] [2021-03-25 20:30:30,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:30,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:30,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:30,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731078620] [2021-03-25 20:30:30,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677245687] [2021-03-25 20:30:30,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:30,544 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-25 20:30:30,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:30:30,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 20:30:30,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:30,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:30,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:30,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:30,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:30,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:30,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:30,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,555 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:30,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:30,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:30,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,562 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:30,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:30,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:30,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,564 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:30,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:30,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:30,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,566 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:30,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:30,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:30,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:30,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:30,576 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-25 20:30:30,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:30,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:30,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:30,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:30,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-25 20:30:30,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956629868] [2021-03-25 20:30:30,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 20:30:30,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:30,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 20:30:30,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 20:30:30,591 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 53 [2021-03-25 20:30:30,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 468 transitions, 9826 flow. Second operand has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:30,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:30,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 53 [2021-03-25 20:30:30,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:32,148 INFO L129 PetriNetUnfolder]: 3709/7232 cut-off events. [2021-03-25 20:30:32,148 INFO L130 PetriNetUnfolder]: For 344303/345815 co-relation queries the response was YES. [2021-03-25 20:30:32,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77327 conditions, 7232 events. 3709/7232 cut-off events. For 344303/345815 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 59944 event pairs, 431 based on Foata normal form. 185/7222 useless extension candidates. Maximal degree in co-relation 76695. Up to 2362 conditions per place. [2021-03-25 20:30:32,240 INFO L132 encePairwiseOnDemand]: 49/53 looper letters, 435 selfloop transitions, 223 changer transitions 2/733 dead transitions. [2021-03-25 20:30:32,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 733 transitions, 18303 flow [2021-03-25 20:30:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 20:30:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 20:30:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2021-03-25 20:30:32,241 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7232704402515723 [2021-03-25 20:30:32,241 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 230 transitions. [2021-03-25 20:30:32,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 230 transitions. [2021-03-25 20:30:32,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:32,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 230 transitions. [2021-03-25 20:30:32,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:32,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:32,242 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:32,242 INFO L185 Difference]: Start difference. First operand has 195 places, 468 transitions, 9826 flow. Second operand 6 states and 230 transitions. [2021-03-25 20:30:32,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 733 transitions, 18303 flow [2021-03-25 20:30:32,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 733 transitions, 17282 flow, removed 494 selfloop flow, removed 4 redundant places. [2021-03-25 20:30:32,978 INFO L241 Difference]: Finished difference. Result has 199 places, 605 transitions, 14174 flow [2021-03-25 20:30:32,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=9350, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14174, PETRI_PLACES=199, PETRI_TRANSITIONS=605} [2021-03-25 20:30:32,979 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 176 predicate places. [2021-03-25 20:30:32,979 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:32,979 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 199 places, 605 transitions, 14174 flow [2021-03-25 20:30:32,979 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 199 places, 605 transitions, 14174 flow [2021-03-25 20:30:32,985 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 199 places, 605 transitions, 14174 flow [2021-03-25 20:30:34,154 INFO L129 PetriNetUnfolder]: 2774/6032 cut-off events. [2021-03-25 20:30:34,155 INFO L130 PetriNetUnfolder]: For 314832/318786 co-relation queries the response was YES. [2021-03-25 20:30:34,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64770 conditions, 6032 events. 2774/6032 cut-off events. For 314832/318786 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 54483 event pairs, 384 based on Foata normal form. 329/6071 useless extension candidates. Maximal degree in co-relation 64120. Up to 1949 conditions per place. [2021-03-25 20:30:34,277 INFO L142 LiptonReduction]: Number of co-enabled transitions 3226 [2021-03-25 20:30:34,334 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:30:34,334 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:30:34,334 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1355 [2021-03-25 20:30:34,334 INFO L480 AbstractCegarLoop]: Abstraction has has 199 places, 605 transitions, 14174 flow [2021-03-25 20:30:34,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 34.833333333333336) internal successors, (209), 6 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:34,335 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:34,335 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:34,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-03-25 20:30:34,535 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:34,536 INFO L82 PathProgramCache]: Analyzing trace with hash -15731548, now seen corresponding path program 11 times [2021-03-25 20:30:34,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:34,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740886083] [2021-03-25 20:30:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:34,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:34,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,556 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:34,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740886083] [2021-03-25 20:30:34,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105750005] [2021-03-25 20:30:34,564 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:34,592 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 20:30:34,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:30:34,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-25 20:30:34,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:34,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:34,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,595 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:34,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:34,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:34,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:34,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:34,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:34,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:34,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:34,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:34,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:34,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:34,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:34,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:34,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:34,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:34,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:34,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,640 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:34,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:34,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:34,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:34,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:34,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:34,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:34,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,655 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:34,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:34,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 20:30:34,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:34,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 20:30:34,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325604909] [2021-03-25 20:30:34,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 20:30:34,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:34,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 20:30:34,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-25 20:30:34,659 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-25 20:30:34,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 605 transitions, 14174 flow. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:34,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:34,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-25 20:30:34,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:30:41,190 INFO L129 PetriNetUnfolder]: 12523/22270 cut-off events. [2021-03-25 20:30:41,190 INFO L130 PetriNetUnfolder]: For 1262302/1262338 co-relation queries the response was YES. [2021-03-25 20:30:41,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 252522 conditions, 22270 events. 12523/22270 cut-off events. For 1262302/1262338 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 194062 event pairs, 522 based on Foata normal form. 687/22957 useless extension candidates. Maximal degree in co-relation 252270. Up to 7371 conditions per place. [2021-03-25 20:30:41,465 INFO L132 encePairwiseOnDemand]: 34/53 looper letters, 1242 selfloop transitions, 774 changer transitions 105/2127 dead transitions. [2021-03-25 20:30:41,465 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 2127 transitions, 58854 flow [2021-03-25 20:30:41,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-25 20:30:41,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-03-25 20:30:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 548 transitions. [2021-03-25 20:30:41,467 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.397677793904209 [2021-03-25 20:30:41,467 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 548 transitions. [2021-03-25 20:30:41,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 548 transitions. [2021-03-25 20:30:41,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:30:41,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 548 transitions. [2021-03-25 20:30:41,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 21.076923076923077) internal successors, (548), 26 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:41,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 53.0) internal successors, (1431), 27 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:41,470 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 53.0) internal successors, (1431), 27 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:41,470 INFO L185 Difference]: Start difference. First operand has 199 places, 605 transitions, 14174 flow. Second operand 26 states and 548 transitions. [2021-03-25 20:30:41,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 2127 transitions, 58854 flow [2021-03-25 20:30:44,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 2127 transitions, 57146 flow, removed 828 selfloop flow, removed 4 redundant places. [2021-03-25 20:30:44,920 INFO L241 Difference]: Finished difference. Result has 239 places, 1227 transitions, 34032 flow [2021-03-25 20:30:44,921 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=13458, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=34032, PETRI_PLACES=239, PETRI_TRANSITIONS=1227} [2021-03-25 20:30:44,921 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 216 predicate places. [2021-03-25 20:30:44,921 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:30:44,921 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 239 places, 1227 transitions, 34032 flow [2021-03-25 20:30:44,921 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 239 places, 1227 transitions, 34032 flow [2021-03-25 20:30:44,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 234 places, 1227 transitions, 34032 flow [2021-03-25 20:30:49,137 INFO L129 PetriNetUnfolder]: 7405/15162 cut-off events. [2021-03-25 20:30:49,137 INFO L130 PetriNetUnfolder]: For 1148014/1158042 co-relation queries the response was YES. [2021-03-25 20:30:49,295 INFO L84 FinitePrefix]: Finished finitePrefix Result has 190133 conditions, 15162 events. 7405/15162 cut-off events. For 1148014/1158042 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 148534 event pairs, 673 based on Foata normal form. 1091/15893 useless extension candidates. Maximal degree in co-relation 189978. Up to 5118 conditions per place. [2021-03-25 20:30:49,505 INFO L142 LiptonReduction]: Number of co-enabled transitions 5012 [2021-03-25 20:30:49,939 INFO L154 LiptonReduction]: Checked pairs total: 4 [2021-03-25 20:30:49,940 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 20:30:49,940 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5019 [2021-03-25 20:30:49,940 INFO L480 AbstractCegarLoop]: Abstraction has has 234 places, 1227 transitions, 34057 flow [2021-03-25 20:30:49,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 10 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:49,940 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:30:49,941 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:30:50,147 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-03-25 20:30:50,148 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:30:50,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:30:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash 531126698, now seen corresponding path program 1 times [2021-03-25 20:30:50,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:30:50,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615397006] [2021-03-25 20:30:50,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:30:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:50,158 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 20:30:50,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:50,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:50,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:50,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:50,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615397006] [2021-03-25 20:30:50,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482825746] [2021-03-25 20:30:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:30:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:30:50,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-25 20:30:50,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:30:50,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:50,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:50,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:30:50,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:30:50,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,231 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:50,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:50,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:50,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:50,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:50,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:50,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:50,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:50,234 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-25 20:30:50,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:50,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,235 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:50,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:30:50,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:30:50,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:50,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:30:50,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,238 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:50,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:50,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:50,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:30:50,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:30:50,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:30:50,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:30:50,242 INFO L142 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size [2021-03-25 20:30:50,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:30:50,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:30:50,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:30:50,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:30:50,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2021-03-25 20:30:50,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179906494] [2021-03-25 20:30:50,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 20:30:50,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:30:50,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 20:30:50,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 20:30:50,252 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-25 20:30:50,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 1227 transitions, 34057 flow. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:30:50,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:30:50,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-25 20:30:50,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:31:08,670 INFO L129 PetriNetUnfolder]: 20258/36898 cut-off events. [2021-03-25 20:31:08,670 INFO L130 PetriNetUnfolder]: For 2676808/2676814 co-relation queries the response was YES. [2021-03-25 20:31:09,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479224 conditions, 36898 events. 20258/36898 cut-off events. For 2676808/2676814 co-relation queries the response was YES. Maximal size of possible extension queue 2395. Compared 348638 event pairs, 1747 based on Foata normal form. 407/37305 useless extension candidates. Maximal degree in co-relation 479064. Up to 16952 conditions per place. [2021-03-25 20:31:09,461 INFO L132 encePairwiseOnDemand]: 41/54 looper letters, 1930 selfloop transitions, 531 changer transitions 59/2526 dead transitions. [2021-03-25 20:31:09,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 2526 transitions, 78399 flow [2021-03-25 20:31:09,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 20:31:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 20:31:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 193 transitions. [2021-03-25 20:31:09,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.39711934156378603 [2021-03-25 20:31:09,462 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 193 transitions. [2021-03-25 20:31:09,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 193 transitions. [2021-03-25 20:31:09,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:31:09,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 193 transitions. [2021-03-25 20:31:09,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 21.444444444444443) internal successors, (193), 9 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:31:09,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:31:09,464 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:31:09,464 INFO L185 Difference]: Start difference. First operand has 234 places, 1227 transitions, 34057 flow. Second operand 9 states and 193 transitions. [2021-03-25 20:31:09,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 2526 transitions, 78399 flow [2021-03-25 20:31:31,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 2526 transitions, 71414 flow, removed 3471 selfloop flow, removed 11 redundant places. [2021-03-25 20:31:31,385 INFO L241 Difference]: Finished difference. Result has 236 places, 1655 transitions, 44949 flow [2021-03-25 20:31:31,386 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=30113, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=44949, PETRI_PLACES=236, PETRI_TRANSITIONS=1655} [2021-03-25 20:31:31,386 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 213 predicate places. [2021-03-25 20:31:31,386 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:31:31,386 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 236 places, 1655 transitions, 44949 flow [2021-03-25 20:31:31,386 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 236 places, 1655 transitions, 44949 flow [2021-03-25 20:31:31,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 227 places, 1655 transitions, 44949 flow [2021-03-25 20:31:39,459 INFO L129 PetriNetUnfolder]: 12047/25354 cut-off events. [2021-03-25 20:31:39,460 INFO L130 PetriNetUnfolder]: For 1783699/1800791 co-relation queries the response was YES. [2021-03-25 20:31:39,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 307467 conditions, 25354 events. 12047/25354 cut-off events. For 1783699/1800791 co-relation queries the response was YES. Maximal size of possible extension queue 1991. Compared 270306 event pairs, 914 based on Foata normal form. 2531/27423 useless extension candidates. Maximal degree in co-relation 307224. Up to 8458 conditions per place. [2021-03-25 20:31:40,238 INFO L142 LiptonReduction]: Number of co-enabled transitions 6496 [2021-03-25 20:31:40,581 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:31:40,581 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:31:40,581 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9195 [2021-03-25 20:31:40,582 INFO L480 AbstractCegarLoop]: Abstraction has has 227 places, 1655 transitions, 44949 flow [2021-03-25 20:31:40,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:31:40,582 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:31:40,582 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:31:40,790 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-03-25 20:31:40,790 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:31:40,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:31:40,790 INFO L82 PathProgramCache]: Analyzing trace with hash 515800734, now seen corresponding path program 1 times [2021-03-25 20:31:40,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:31:40,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244022758] [2021-03-25 20:31:40,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:31:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:31:40,810 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 20:31:40,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:31:40,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:31:40,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:31:40,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244022758] [2021-03-25 20:31:40,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885218672] [2021-03-25 20:31:40,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:31:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:31:40,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-25 20:31:40,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:31:40,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:31:40,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,849 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:31:40,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:31:40,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:31:40,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,853 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,854 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,856 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,860 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,861 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,864 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:31:40,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:31:40,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 20:31:40,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,866 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:31:40,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,868 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:31:40,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:31:40,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 20:31:40,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:31:40,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:31:40,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:31:40,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:31:40,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:31:40,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:31:40,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:31:40,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:31:40,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:31:40,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:31:40,887 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-25 20:31:40,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:31:40,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:31:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:31:40,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:31:40,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-25 20:31:40,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789905282] [2021-03-25 20:31:40,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 20:31:40,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:31:40,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 20:31:40,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 20:31:40,896 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 54 [2021-03-25 20:31:40,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 1655 transitions, 44949 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:31:40,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:31:40,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 54 [2021-03-25 20:31:40,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:32:05,027 INFO L129 PetriNetUnfolder]: 25973/45630 cut-off events. [2021-03-25 20:32:05,027 INFO L130 PetriNetUnfolder]: For 3125013/3125019 co-relation queries the response was YES. [2021-03-25 20:32:05,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 571842 conditions, 45630 events. 25973/45630 cut-off events. For 3125013/3125019 co-relation queries the response was YES. Maximal size of possible extension queue 2278. Compared 415771 event pairs, 2390 based on Foata normal form. 2060/47690 useless extension candidates. Maximal degree in co-relation 571676. Up to 29098 conditions per place. [2021-03-25 20:32:05,942 INFO L132 encePairwiseOnDemand]: 45/54 looper letters, 1598 selfloop transitions, 375 changer transitions 182/2162 dead transitions. [2021-03-25 20:32:05,942 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 2162 transitions, 64580 flow [2021-03-25 20:32:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 20:32:05,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 20:32:05,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 141 transitions. [2021-03-25 20:32:05,943 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4351851851851852 [2021-03-25 20:32:05,943 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 141 transitions. [2021-03-25 20:32:05,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 141 transitions. [2021-03-25 20:32:05,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:32:05,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 141 transitions. [2021-03-25 20:32:05,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:32:05,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:32:05,944 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:32:05,944 INFO L185 Difference]: Start difference. First operand has 227 places, 1655 transitions, 44949 flow. Second operand 6 states and 141 transitions. [2021-03-25 20:32:05,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 2162 transitions, 64580 flow [2021-03-25 20:32:28,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 2162 transitions, 61814 flow, removed 1370 selfloop flow, removed 10 redundant places. [2021-03-25 20:32:28,741 INFO L241 Difference]: Finished difference. Result has 217 places, 1810 transitions, 50598 flow [2021-03-25 20:32:28,742 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=40013, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=50598, PETRI_PLACES=217, PETRI_TRANSITIONS=1810} [2021-03-25 20:32:28,742 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 194 predicate places. [2021-03-25 20:32:28,742 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:32:28,742 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 217 places, 1810 transitions, 50598 flow [2021-03-25 20:32:28,743 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 217 places, 1810 transitions, 50598 flow [2021-03-25 20:32:28,763 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 215 places, 1810 transitions, 50598 flow [2021-03-25 20:32:38,112 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([86] L47-->L46-1: Formula: (and (= (+ (select v_C_8 v_l_10) v_csum_6) v_csum_5) (= (+ v_l_10 1) v_l_9)) InVars {csum=v_csum_6, l=v_l_10, C=v_C_8} OutVars{csum=v_csum_5, l=v_l_9, C=v_C_8} AuxVars[] AssignedVars[csum, l][1372], [Black: 464#(<= k i), 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 523#(<= N (+ i 1)), Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 285#true, Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), 48#true, Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 51#(<= (+ l 1) N), Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 442#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 465#(<= N i), 212#true, 986#(<= l i)]) [2021-03-25 20:32:38,113 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-03-25 20:32:38,113 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:32:38,113 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 20:32:38,113 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:32:39,244 INFO L129 PetriNetUnfolder]: 16142/33061 cut-off events. [2021-03-25 20:32:39,244 INFO L130 PetriNetUnfolder]: For 1900634/1913943 co-relation queries the response was YES. [2021-03-25 20:32:39,712 INFO L84 FinitePrefix]: Finished finitePrefix Result has 376275 conditions, 33061 events. 16142/33061 cut-off events. For 1900634/1913943 co-relation queries the response was YES. Maximal size of possible extension queue 2103. Compared 347710 event pairs, 917 based on Foata normal form. 1943/34293 useless extension candidates. Maximal degree in co-relation 374068. Up to 11119 conditions per place. [2021-03-25 20:32:40,278 INFO L142 LiptonReduction]: Number of co-enabled transitions 6798 [2021-03-25 20:32:40,676 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:32:40,676 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:32:40,677 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11935 [2021-03-25 20:32:40,677 INFO L480 AbstractCegarLoop]: Abstraction has has 215 places, 1810 transitions, 50598 flow [2021-03-25 20:32:40,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:32:40,677 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:32:40,677 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:32:40,878 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-03-25 20:32:40,878 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:32:40,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:32:40,878 INFO L82 PathProgramCache]: Analyzing trace with hash 338591375, now seen corresponding path program 1 times [2021-03-25 20:32:40,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:32:40,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637398334] [2021-03-25 20:32:40,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:32:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:32:40,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:32:40,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:32:40,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637398334] [2021-03-25 20:32:40,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637900101] [2021-03-25 20:32:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:32:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:32:40,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 20:32:40,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:32:40,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,937 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:32:40,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:32:40,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:32:40,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,938 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:32:40,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:32:40,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:32:40,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:32:40,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:32:40,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:32:40,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:32:40,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,954 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:32:40,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 20:32:40,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:32:40,955 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:32:40,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:32:40,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:32:40,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 20:32:40,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,959 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 20:32:40,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:32:40,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:32:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 20:32:40,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:32:40,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-03-25 20:32:40,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325210354] [2021-03-25 20:32:40,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 20:32:40,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:32:40,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 20:32:40,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-03-25 20:32:40,977 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-25 20:32:40,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 1810 transitions, 50598 flow. Second operand has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:32:40,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:32:40,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-25 20:32:40,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:33:08,516 INFO L129 PetriNetUnfolder]: 24827/46033 cut-off events. [2021-03-25 20:33:08,517 INFO L130 PetriNetUnfolder]: For 2730641/2730673 co-relation queries the response was YES. [2021-03-25 20:33:09,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 551634 conditions, 46033 events. 24827/46033 cut-off events. For 2730641/2730673 co-relation queries the response was YES. Maximal size of possible extension queue 2477. Compared 448153 event pairs, 1150 based on Foata normal form. 1479/47512 useless extension candidates. Maximal degree in co-relation 547652. Up to 14377 conditions per place. [2021-03-25 20:33:09,472 INFO L132 encePairwiseOnDemand]: 44/54 looper letters, 1864 selfloop transitions, 1785 changer transitions 81/3736 dead transitions. [2021-03-25 20:33:09,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 3736 transitions, 113186 flow [2021-03-25 20:33:09,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-03-25 20:33:09,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2021-03-25 20:33:09,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 622 transitions. [2021-03-25 20:33:09,474 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.39719029374201786 [2021-03-25 20:33:09,474 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 622 transitions. [2021-03-25 20:33:09,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 622 transitions. [2021-03-25 20:33:09,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:33:09,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 622 transitions. [2021-03-25 20:33:09,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 21.448275862068964) internal successors, (622), 29 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:33:09,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 54.0) internal successors, (1620), 30 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:33:09,477 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 54.0) internal successors, (1620), 30 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:33:09,477 INFO L185 Difference]: Start difference. First operand has 215 places, 1810 transitions, 50598 flow. Second operand 29 states and 622 transitions. [2021-03-25 20:33:09,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 3736 transitions, 113186 flow [2021-03-25 20:33:26,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 3736 transitions, 110832 flow, removed 1172 selfloop flow, removed 3 redundant places. [2021-03-25 20:33:26,278 INFO L241 Difference]: Finished difference. Result has 260 places, 2721 transitions, 83656 flow [2021-03-25 20:33:26,279 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=46736, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=856, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=83656, PETRI_PLACES=260, PETRI_TRANSITIONS=2721} [2021-03-25 20:33:26,280 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 237 predicate places. [2021-03-25 20:33:26,280 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:33:26,280 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 2721 transitions, 83656 flow [2021-03-25 20:33:26,280 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 2721 transitions, 83656 flow [2021-03-25 20:33:26,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 260 places, 2721 transitions, 83656 flow [2021-03-25 20:33:40,862 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][309], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), 1552#(and (< i N) (<= i k)), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-25 20:33:40,862 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-25 20:33:40,862 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 20:33:40,863 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 20:33:40,863 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 20:33:40,863 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][351], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), 1040#(and (<= l i) (< l N)), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-25 20:33:40,863 INFO L384 tUnfolder$Statistics]: this new event has 27 ancestors and is cut-off event [2021-03-25 20:33:40,863 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 20:33:40,863 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 20:33:40,863 INFO L387 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2021-03-25 20:33:41,602 INFO L129 PetriNetUnfolder]: 15704/33535 cut-off events. [2021-03-25 20:33:41,602 INFO L130 PetriNetUnfolder]: For 2189626/2204586 co-relation queries the response was YES. [2021-03-25 20:33:42,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402273 conditions, 33535 events. 15704/33535 cut-off events. For 2189626/2204586 co-relation queries the response was YES. Maximal size of possible extension queue 2044. Compared 364849 event pairs, 886 based on Foata normal form. 2221/35001 useless extension candidates. Maximal degree in co-relation 400191. Up to 10392 conditions per place. [2021-03-25 20:33:42,673 INFO L142 LiptonReduction]: Number of co-enabled transitions 9076 [2021-03-25 20:33:43,703 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:33:43,703 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:33:43,703 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17423 [2021-03-25 20:33:43,704 INFO L480 AbstractCegarLoop]: Abstraction has has 260 places, 2721 transitions, 83656 flow [2021-03-25 20:33:43,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 16.333333333333332) internal successors, (147), 9 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:33:43,704 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:33:43,704 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:33:43,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-03-25 20:33:43,904 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:33:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:33:43,905 INFO L82 PathProgramCache]: Analyzing trace with hash -344641756, now seen corresponding path program 2 times [2021-03-25 20:33:43,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:33:43,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911799643] [2021-03-25 20:33:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:33:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:33:43,950 INFO L142 QuantifierPusher]: treesize reduction 7, result has 73.1 percent of original size [2021-03-25 20:33:43,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:33:43,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:43,962 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:33:43,994 INFO L142 QuantifierPusher]: treesize reduction 36, result has 56.1 percent of original size [2021-03-25 20:33:43,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:33:44,018 INFO L142 QuantifierPusher]: treesize reduction 55, result has 43.9 percent of original size [2021-03-25 20:33:44,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 20:33:44,041 INFO L142 QuantifierPusher]: treesize reduction 55, result has 45.0 percent of original size [2021-03-25 20:33:44,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:33:44,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:33:44,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:33:44,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:33:44,092 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:33:44,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:33:44,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911799643] [2021-03-25 20:33:44,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32010326] [2021-03-25 20:33:44,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:33:44,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 20:33:44,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:33:44,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 30 conjunts are in the unsatisfiable core [2021-03-25 20:33:44,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:33:44,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:33:44,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:33:44,123 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:33:44,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:33:44,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:33:44,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,126 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:33:44,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:33:44,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,129 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:33:44,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,145 INFO L147 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size 18 [2021-03-25 20:33:44,145 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size [2021-03-25 20:33:44,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:33:44,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:33:44,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:33:44,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:33:44,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:33:44,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,170 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:33:44,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:33:44,176 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:33:44,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:33:44,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:33:44,177 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:33:44,185 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:33:44,186 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:33:44,186 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2021-03-25 20:33:44,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:33:44,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:33:44,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,206 INFO L147 QuantifierPusher]: treesize reduction 2, result has 94.6 percent of original size 35 [2021-03-25 20:33:44,206 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.6 percent of original size [2021-03-25 20:33:44,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:33:44,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:33:44,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:33:44,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 20:33:44,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 20:33:44,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 20:33:44,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 20:33:44,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,258 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:33:44,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 20:33:44,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,259 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:33:44,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 20:33:44,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:33:44,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 20:33:44,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-03-25 20:33:44,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2021-03-25 20:33:44,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:33:44,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:33:44,270 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:33:44,282 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:33:44,283 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:33:44,283 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:46 [2021-03-25 20:33:44,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:33:44,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:33:44,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:33:44,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:33:44,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:33:44,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:33:44,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,314 INFO L147 QuantifierPusher]: treesize reduction 2, result has 95.9 percent of original size 47 [2021-03-25 20:33:44,314 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.0 percent of original size [2021-03-25 20:33:44,315 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:33:44,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 20:33:44,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:33:44,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 20:33:44,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-03-25 20:33:44,322 INFO L173 IndexEqualityManager]: detected equality via solver [2021-03-25 20:33:44,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 27 [2021-03-25 20:33:44,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,324 INFO L147 QuantifierPusher]: treesize reduction 1, result has 94.4 percent of original size 17 [2021-03-25 20:33:44,324 INFO L142 QuantifierPusher]: treesize reduction 1, result has 94.4 percent of original size [2021-03-25 20:33:44,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:33:44,325 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:33:44,331 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,332 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:33:44,332 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:23 [2021-03-25 20:33:44,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:33:44,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,363 INFO L147 QuantifierPusher]: treesize reduction 2, result has 91.3 percent of original size 21 [2021-03-25 20:33:44,363 INFO L142 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-03-25 20:33:44,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:33:44,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 20:33:44,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:33:44,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 20:33:44,369 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2021-03-25 20:33:44,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:33:44,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 20:33:44,371 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:33:44,375 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,376 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:33:44,376 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:12 [2021-03-25 20:33:44,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,396 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-25 20:33:44,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:33:44,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:33:44,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:33:44,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:33:44,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:33:44,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:33:44,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:33:44,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:33:44,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-03-25 20:33:44,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581780104] [2021-03-25 20:33:44,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-25 20:33:44,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:33:44,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-25 20:33:44,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2021-03-25 20:33:44,439 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-25 20:33:44,439 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 2721 transitions, 83656 flow. Second operand has 19 states, 19 states have (on average 15.421052631578947) internal successors, (293), 19 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:33:44,439 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:33:44,439 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-25 20:33:44,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:34:27,906 INFO L129 PetriNetUnfolder]: 25299/47224 cut-off events. [2021-03-25 20:34:27,907 INFO L130 PetriNetUnfolder]: For 3073819/3073833 co-relation queries the response was YES. [2021-03-25 20:34:28,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 599336 conditions, 47224 events. 25299/47224 cut-off events. For 3073819/3073833 co-relation queries the response was YES. Maximal size of possible extension queue 2554. Compared 464695 event pairs, 3917 based on Foata normal form. 15/47239 useless extension candidates. Maximal degree in co-relation 596195. Up to 40037 conditions per place. [2021-03-25 20:34:29,246 INFO L132 encePairwiseOnDemand]: 43/54 looper letters, 2776 selfloop transitions, 201 changer transitions 44/3027 dead transitions. [2021-03-25 20:34:29,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 3027 transitions, 97913 flow [2021-03-25 20:34:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-25 20:34:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-03-25 20:34:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 437 transitions. [2021-03-25 20:34:29,248 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.36784511784511786 [2021-03-25 20:34:29,248 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 437 transitions. [2021-03-25 20:34:29,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 437 transitions. [2021-03-25 20:34:29,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:34:29,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 437 transitions. [2021-03-25 20:34:29,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 19.863636363636363) internal successors, (437), 22 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:34:29,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 54.0) internal successors, (1242), 23 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:34:29,251 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 54.0) internal successors, (1242), 23 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:34:29,251 INFO L185 Difference]: Start difference. First operand has 260 places, 2721 transitions, 83656 flow. Second operand 22 states and 437 transitions. [2021-03-25 20:34:29,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 3027 transitions, 97913 flow [2021-03-25 20:34:56,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 3027 transitions, 90946 flow, removed 3480 selfloop flow, removed 2 redundant places. [2021-03-25 20:34:56,634 INFO L241 Difference]: Finished difference. Result has 291 places, 2858 transitions, 82275 flow [2021-03-25 20:34:56,636 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=77159, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=82275, PETRI_PLACES=291, PETRI_TRANSITIONS=2858} [2021-03-25 20:34:56,636 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 268 predicate places. [2021-03-25 20:34:56,636 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:34:56,636 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 291 places, 2858 transitions, 82275 flow [2021-03-25 20:34:56,636 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 291 places, 2858 transitions, 82275 flow [2021-03-25 20:34:56,665 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 289 places, 2858 transitions, 82275 flow [2021-03-25 20:35:12,014 INFO L129 PetriNetUnfolder]: 15980/34096 cut-off events. [2021-03-25 20:35:12,014 INFO L130 PetriNetUnfolder]: For 2055159/2068457 co-relation queries the response was YES. [2021-03-25 20:35:12,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 391595 conditions, 34096 events. 15980/34096 cut-off events. For 2055159/2068457 co-relation queries the response was YES. Maximal size of possible extension queue 2099. Compared 372197 event pairs, 898 based on Foata normal form. 2200/35531 useless extension candidates. Maximal degree in co-relation 390085. Up to 8994 conditions per place. [2021-03-25 20:35:13,430 INFO L142 LiptonReduction]: Number of co-enabled transitions 9528 [2021-03-25 20:35:14,452 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:35:14,452 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:35:14,452 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17816 [2021-03-25 20:35:14,453 INFO L480 AbstractCegarLoop]: Abstraction has has 289 places, 2858 transitions, 82275 flow [2021-03-25 20:35:14,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 15.421052631578947) internal successors, (293), 19 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:35:14,453 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:35:14,453 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:35:14,667 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:35:14,668 INFO L428 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:35:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:35:14,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1740526560, now seen corresponding path program 3 times [2021-03-25 20:35:14,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:35:14,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868961149] [2021-03-25 20:35:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:35:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:35:14,703 INFO L142 QuantifierPusher]: treesize reduction 7, result has 73.1 percent of original size [2021-03-25 20:35:14,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:35:14,715 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,715 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 20:35:14,734 INFO L142 QuantifierPusher]: treesize reduction 34, result has 58.5 percent of original size [2021-03-25 20:35:14,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-25 20:35:14,769 INFO L142 QuantifierPusher]: treesize reduction 51, result has 49.0 percent of original size [2021-03-25 20:35:14,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 20:35:14,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:35:14,829 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:35:14,842 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:35:14,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:35:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:35:14,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868961149] [2021-03-25 20:35:14,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550935637] [2021-03-25 20:35:14,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:35:14,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-03-25 20:35:14,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:35:14,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 32 conjunts are in the unsatisfiable core [2021-03-25 20:35:14,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:35:14,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:35:14,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:35:14,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:35:14,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:35:14,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:35:14,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:35:14,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:35:14,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:35:14,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,888 INFO L147 QuantifierPusher]: treesize reduction 2, result has 90.9 percent of original size 20 [2021-03-25 20:35:14,888 INFO L142 QuantifierPusher]: treesize reduction 2, result has 90.9 percent of original size [2021-03-25 20:35:14,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:14,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:14,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:14,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:35:14,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:35:14,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:35:14,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,902 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:35:14,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 20:35:14,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:35:14,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 20:35:14,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:35:14,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:35:14,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,909 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:35:14,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:35:14,917 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:14,918 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:35:14,918 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:40 [2021-03-25 20:35:14,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:14,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:14,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,937 INFO L147 QuantifierPusher]: treesize reduction 6, result has 89.7 percent of original size 52 [2021-03-25 20:35:14,937 INFO L142 QuantifierPusher]: treesize reduction 6, result has 89.7 percent of original size [2021-03-25 20:35:14,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 20:35:14,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 20:35:14,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 20:35:14,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,962 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:14,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-25 20:35:14,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,964 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:14,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-25 20:35:14,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,966 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:14,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-25 20:35:14,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,968 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:14,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-25 20:35:14,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:14,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-03-25 20:35:14,997 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,998 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:35:14,999 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:14,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:14,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:35:15,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 64 [2021-03-25 20:35:15,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,001 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-25 20:35:15,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-25 20:35:15,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,004 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,004 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:35:15,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:35:15,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,006 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:35:15,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 20:35:15,008 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,009 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:35:15,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 20:35:15,010 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-25 20:35:15,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-03-25 20:35:15,014 INFO L446 ElimStorePlain]: Different costs {0=[v_C_82], 2=[A]} [2021-03-25 20:35:15,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-03-25 20:35:15,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:35:15,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:35:15,018 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:35:15,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,043 INFO L354 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2021-03-25 20:35:15,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 36 [2021-03-25 20:35:15,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:35:15,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:35:15,045 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-25 20:35:15,053 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,054 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:35:15,055 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:35:15,055 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:45 [2021-03-25 20:35:15,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:35:15,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:35:15,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:35:15,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 20:35:15,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 20:35:15,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 20:35:15,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 20:35:15,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 20:35:15,105 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2021-03-25 20:35:15,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:35:15,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:35:15,107 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:35:15,113 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:15,114 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:35:15,114 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:20 [2021-03-25 20:35:15,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:15,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:15,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:15,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:15,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:15,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:15,137 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-25 20:35:15,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 20:35:15,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:35:15,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:35:15,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:35:15,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:15,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:35:15,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:35:15,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:35:15,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:35:15,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:35:15,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-03-25 20:35:15,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664237409] [2021-03-25 20:35:15,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-03-25 20:35:15,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:35:15,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-03-25 20:35:15,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2021-03-25 20:35:15,175 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-25 20:35:15,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 2858 transitions, 82275 flow. Second operand has 16 states, 16 states have (on average 15.5625) internal successors, (249), 16 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:35:15,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:35:15,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-25 20:35:15,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:36:00,004 INFO L129 PetriNetUnfolder]: 25422/47481 cut-off events. [2021-03-25 20:36:00,004 INFO L130 PetriNetUnfolder]: For 2796014/2796028 co-relation queries the response was YES. [2021-03-25 20:36:01,185 INFO L84 FinitePrefix]: Finished finitePrefix Result has 575761 conditions, 47481 events. 25422/47481 cut-off events. For 2796014/2796028 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 468468 event pairs, 4116 based on Foata normal form. 16/47497 useless extension candidates. Maximal degree in co-relation 573820. Up to 40710 conditions per place. [2021-03-25 20:36:01,578 INFO L132 encePairwiseOnDemand]: 45/54 looper letters, 2845 selfloop transitions, 116 changer transitions 40/3007 dead transitions. [2021-03-25 20:36:01,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 3007 transitions, 91526 flow [2021-03-25 20:36:01,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-03-25 20:36:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-03-25 20:36:01,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 413 transitions. [2021-03-25 20:36:01,580 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.36419753086419754 [2021-03-25 20:36:01,580 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 413 transitions. [2021-03-25 20:36:01,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 413 transitions. [2021-03-25 20:36:01,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:36:01,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 413 transitions. [2021-03-25 20:36:01,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 19.666666666666668) internal successors, (413), 21 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:36:01,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 54.0) internal successors, (1188), 22 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:36:01,585 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 54.0) internal successors, (1188), 22 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:36:01,585 INFO L185 Difference]: Start difference. First operand has 289 places, 2858 transitions, 82275 flow. Second operand 21 states and 413 transitions. [2021-03-25 20:36:01,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 3007 transitions, 91526 flow [2021-03-25 20:36:26,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 3007 transitions, 90827 flow, removed 332 selfloop flow, removed 7 redundant places. [2021-03-25 20:36:26,922 INFO L241 Difference]: Finished difference. Result has 311 places, 2890 transitions, 82973 flow [2021-03-25 20:36:26,924 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=81578, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=82973, PETRI_PLACES=311, PETRI_TRANSITIONS=2890} [2021-03-25 20:36:26,924 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 288 predicate places. [2021-03-25 20:36:26,924 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:36:26,924 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 311 places, 2890 transitions, 82973 flow [2021-03-25 20:36:26,924 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 311 places, 2890 transitions, 82973 flow [2021-03-25 20:36:26,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 309 places, 2890 transitions, 82973 flow [2021-03-25 20:36:28,178 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][327], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1570#(and (< i N) (<= i l)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:36:28,179 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:36:28,179 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:36:28,179 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:36:28,180 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:36:28,180 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][366], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1570#(and (< i N) (<= i l)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:36:28,180 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:36:28,180 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:36:28,180 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:36:28,180 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:36:30,037 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][327], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:36:30,038 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:36:30,038 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:36:30,038 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:36:30,038 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:36:30,038 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][366], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:36:30,038 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:36:30,038 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:36:30,038 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:36:30,038 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:36:39,657 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][327], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:36:39,657 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 20:36:39,657 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:36:39,657 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:36:39,657 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:36:39,658 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][366], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1805#(and (<= (+ asum 2) csum) (<= i 2) (< csum (+ N asum 1)) (<= N 2)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), 1707#true, Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:36:39,658 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 20:36:39,658 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:36:39,658 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:36:39,658 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:36:42,482 INFO L129 PetriNetUnfolder]: 16111/34186 cut-off events. [2021-03-25 20:36:42,482 INFO L130 PetriNetUnfolder]: For 2079411/2094176 co-relation queries the response was YES. [2021-03-25 20:36:43,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 394629 conditions, 34186 events. 16111/34186 cut-off events. For 2079411/2094176 co-relation queries the response was YES. Maximal size of possible extension queue 2094. Compared 372128 event pairs, 923 based on Foata normal form. 2361/35777 useless extension candidates. Maximal degree in co-relation 393224. Up to 9037 conditions per place. [2021-03-25 20:36:43,844 INFO L142 LiptonReduction]: Number of co-enabled transitions 9654 [2021-03-25 20:36:44,857 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:36:44,857 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 20:36:44,858 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17934 [2021-03-25 20:36:44,858 INFO L480 AbstractCegarLoop]: Abstraction has has 309 places, 2890 transitions, 82973 flow [2021-03-25 20:36:44,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 15.5625) internal successors, (249), 16 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:36:44,858 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:36:44,858 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:36:45,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-03-25 20:36:45,059 INFO L428 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:36:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:36:45,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1751991650, now seen corresponding path program 4 times [2021-03-25 20:36:45,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:36:45,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898707586] [2021-03-25 20:36:45,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:36:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:36:45,097 INFO L142 QuantifierPusher]: treesize reduction 7, result has 73.1 percent of original size [2021-03-25 20:36:45,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 20:36:45,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:36:45,130 INFO L142 QuantifierPusher]: treesize reduction 39, result has 56.2 percent of original size [2021-03-25 20:36:45,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-03-25 20:36:45,148 INFO L142 QuantifierPusher]: treesize reduction 61, result has 46.5 percent of original size [2021-03-25 20:36:45,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 20:36:45,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:36:45,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:36:45,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:36:45,216 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:36:45,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:36:45,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898707586] [2021-03-25 20:36:45,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121217822] [2021-03-25 20:36:45,225 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:36:45,243 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-25 20:36:45,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:36:45,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 30 conjunts are in the unsatisfiable core [2021-03-25 20:36:45,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:36:45,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:36:45,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:36:45,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:36:45,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:36:45,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:36:45,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:36:45,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:36:45,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:36:45,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,256 INFO L147 QuantifierPusher]: treesize reduction 6, result has 76.9 percent of original size 20 [2021-03-25 20:36:45,257 INFO L142 QuantifierPusher]: treesize reduction 6, result has 76.9 percent of original size [2021-03-25 20:36:45,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,275 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:36:45,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:36:45,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:36:45,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:36:45,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,279 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:36:45,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 20:36:45,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:36:45,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:36:45,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:36:45,284 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:36:45,290 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:36:45,291 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:36:45,291 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:31 [2021-03-25 20:36:45,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:36:45,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:36:45,307 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:36:45,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:36:45,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:36:45,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:36:45,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,325 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:36:45,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:36:45,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,327 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:36:45,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:36:45,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:36:45,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:36:45,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-03-25 20:36:45,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 20:36:45,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 20:36:45,335 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:36:45,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:36:45,348 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:41 [2021-03-25 20:36:45,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,381 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-25 20:36:45,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 20:36:45,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:36:45,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:36:45,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 20:36:45,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 20:36:45,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:36:45,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:36:45,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:36:45,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 20:36:45,420 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2021-03-25 20:36:45,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 20:36:45,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 20:36:45,421 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:36:45,429 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,430 INFO L142 QuantifierPusher]: treesize reduction 4, result has 87.1 percent of original size [2021-03-25 20:36:45,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:36:45,430 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:36:45,430 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:27 [2021-03-25 20:36:45,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:36:45,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:36:45,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,455 INFO L147 QuantifierPusher]: treesize reduction 2, result has 92.9 percent of original size 26 [2021-03-25 20:36:45,455 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.1 percent of original size [2021-03-25 20:36:45,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:36:45,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,457 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:36:45,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:36:45,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:36:45,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-03-25 20:36:45,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:36:45,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:36:45,461 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:36:45,465 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,465 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:36:45,465 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:12 [2021-03-25 20:36:45,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,481 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,482 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:36:45,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:36:45,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:36:45,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:36:45,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-03-25 20:36:45,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588758760] [2021-03-25 20:36:45,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-25 20:36:45,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:36:45,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-25 20:36:45,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2021-03-25 20:36:45,490 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2021-03-25 20:36:45,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 2890 transitions, 82973 flow. Second operand has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 17 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:36:45,491 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:36:45,491 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2021-03-25 20:36:45,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:37:36,635 INFO L129 PetriNetUnfolder]: 26949/53057 cut-off events. [2021-03-25 20:37:36,635 INFO L130 PetriNetUnfolder]: For 3122826/3122840 co-relation queries the response was YES. [2021-03-25 20:37:38,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 633909 conditions, 53057 events. 26949/53057 cut-off events. For 3122826/3122840 co-relation queries the response was YES. Maximal size of possible extension queue 2895. Compared 561992 event pairs, 2303 based on Foata normal form. 19/53076 useless extension candidates. Maximal degree in co-relation 631846. Up to 22702 conditions per place. [2021-03-25 20:37:38,489 INFO L132 encePairwiseOnDemand]: 45/54 looper letters, 2860 selfloop transitions, 723 changer transitions 41/3630 dead transitions. [2021-03-25 20:37:38,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 3630 transitions, 112344 flow [2021-03-25 20:37:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-03-25 20:37:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-03-25 20:37:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 359 transitions. [2021-03-25 20:37:38,490 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.34990253411306044 [2021-03-25 20:37:38,490 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 359 transitions. [2021-03-25 20:37:38,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 359 transitions. [2021-03-25 20:37:38,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:37:38,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 359 transitions. [2021-03-25 20:37:38,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 18.894736842105264) internal successors, (359), 19 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:37:38,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 54.0) internal successors, (1080), 20 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:37:38,492 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 54.0) internal successors, (1080), 20 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:37:38,493 INFO L185 Difference]: Start difference. First operand has 309 places, 2890 transitions, 82973 flow. Second operand 19 states and 359 transitions. [2021-03-25 20:37:38,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 3630 transitions, 112344 flow [2021-03-25 20:38:08,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 3630 transitions, 111677 flow, removed 274 selfloop flow, removed 7 redundant places. [2021-03-25 20:38:09,029 INFO L241 Difference]: Finished difference. Result has 330 places, 3168 transitions, 93487 flow [2021-03-25 20:38:09,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=82450, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=487, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=93487, PETRI_PLACES=330, PETRI_TRANSITIONS=3168} [2021-03-25 20:38:09,032 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 307 predicate places. [2021-03-25 20:38:09,032 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:38:09,032 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 3168 transitions, 93487 flow [2021-03-25 20:38:09,032 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 3168 transitions, 93487 flow [2021-03-25 20:38:09,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 328 places, 3168 transitions, 93487 flow [2021-03-25 20:38:11,770 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][1772], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, 537#(<= k (+ i 1)), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:38:11,770 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:38:11,770 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:38:11,770 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:38:11,770 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:38:11,770 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][187], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 537#(<= k (+ i 1)), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:38:11,771 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:38:11,771 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:38:11,771 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:38:11,771 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:38:22,531 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][1772], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1393#(and (<= N l) (<= k l)), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), 633#(and (<= N i) (<= k i)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-25 20:38:22,531 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 20:38:22,531 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 20:38:22,531 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 20:38:22,531 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 20:38:22,532 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][187], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), 633#(and (<= N i) (<= k i)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-25 20:38:22,532 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 20:38:22,532 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 20:38:22,532 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 20:38:22,532 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 20:38:26,614 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][1772], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1393#(and (<= N l) (<= k l)), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:38:26,615 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 20:38:26,615 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:38:26,615 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:38:26,615 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:38:26,615 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][187], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1393#(and (<= N l) (<= k l)), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true]) [2021-03-25 20:38:26,615 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 20:38:26,615 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:38:26,615 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:38:26,615 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:38:26,892 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][1772], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), 1040#(and (<= l i) (< l N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 1339#(<= k (+ l 1)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), 633#(and (<= N i) (<= k i)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-25 20:38:26,892 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 20:38:26,892 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 20:38:26,892 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 20:38:26,892 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 20:38:26,893 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][187], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), 1040#(and (<= l i) (< l N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1222#(<= N k), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1469#(<= N k), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1339#(<= k (+ l 1)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1905#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (<= (+ N asum) csum) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (< csum (+ N asum 1))), Black: 1338#(<= k l), Black: 1825#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), 633#(and (<= N i) (<= k i)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, 1262#(< l N)]) [2021-03-25 20:38:26,893 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-03-25 20:38:26,893 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 20:38:26,893 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 20:38:26,893 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-03-25 20:38:30,318 INFO L129 PetriNetUnfolder]: 17158/38499 cut-off events. [2021-03-25 20:38:30,319 INFO L130 PetriNetUnfolder]: For 2540423/2559619 co-relation queries the response was YES. [2021-03-25 20:38:31,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 448831 conditions, 38499 events. 17158/38499 cut-off events. For 2540423/2559619 co-relation queries the response was YES. Maximal size of possible extension queue 2562. Compared 447084 event pairs, 1004 based on Foata normal form. 3469/41206 useless extension candidates. Maximal degree in co-relation 448159. Up to 9912 conditions per place. [2021-03-25 20:38:32,015 INFO L142 LiptonReduction]: Number of co-enabled transitions 10432 [2021-03-25 20:38:35,019 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 20:38:35,019 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 20:38:35,019 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25987 [2021-03-25 20:38:35,019 INFO L480 AbstractCegarLoop]: Abstraction has has 327 places, 3167 transitions, 93511 flow [2021-03-25 20:38:35,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 15.588235294117647) internal successors, (265), 17 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:38:35,020 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:38:35,020 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:38:35,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-03-25 20:38:35,221 INFO L428 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:38:35,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:38:35,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2099220898, now seen corresponding path program 5 times [2021-03-25 20:38:35,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:38:35,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072780385] [2021-03-25 20:38:35,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:38:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:38:35,262 INFO L142 QuantifierPusher]: treesize reduction 11, result has 66.7 percent of original size [2021-03-25 20:38:35,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 20:38:35,276 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.0 percent of original size [2021-03-25 20:38:35,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:38:35,287 INFO L142 QuantifierPusher]: treesize reduction 46, result has 53.5 percent of original size [2021-03-25 20:38:35,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 20:38:35,311 INFO L142 QuantifierPusher]: treesize reduction 63, result has 45.7 percent of original size [2021-03-25 20:38:35,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 20:38:35,340 INFO L142 QuantifierPusher]: treesize reduction 63, result has 46.6 percent of original size [2021-03-25 20:38:35,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 20:38:35,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:38:35,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:38:35,393 INFO L142 QuantifierPusher]: treesize reduction 13, result has 64.9 percent of original size [2021-03-25 20:38:35,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:38:35,411 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:38:35,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:38:35,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072780385] [2021-03-25 20:38:35,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318939437] [2021-03-25 20:38:35,421 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:38:35,443 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-25 20:38:35,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:38:35,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 33 conjunts are in the unsatisfiable core [2021-03-25 20:38:35,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:38:35,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:38:35,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:38:35,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:38:35,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:38:35,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:38:35,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:38:35,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:38:35,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:38:35,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,452 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 20:38:35,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,471 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:38:35,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 20:38:35,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,472 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,473 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:38:35,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 20:38:35,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,474 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:38:35,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 20:38:35,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-03-25 20:38:35,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:38:35,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 20:38:35,479 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:38:35,486 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:38:35,487 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:38:35,487 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:32 [2021-03-25 20:38:35,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:38:35,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:38:35,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,509 INFO L147 QuantifierPusher]: treesize reduction 7, result has 84.4 percent of original size 38 [2021-03-25 20:38:35,509 INFO L142 QuantifierPusher]: treesize reduction 7, result has 84.8 percent of original size [2021-03-25 20:38:35,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:38:35,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:38:35,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:38:35,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:38:35,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:38:35,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:38:35,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:38:35,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,530 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:38:35,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 20:38:35,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,531 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:38:35,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 20:38:35,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,533 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 20:38:35,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 20:38:35,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-03-25 20:38:35,538 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2021-03-25 20:38:35,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:38:35,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:38:35,540 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:38:35,550 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:38:35,551 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:38:35,551 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:45 [2021-03-25 20:38:35,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:38:35,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:38:35,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:38:35,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:38:35,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:38:35,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:38:35,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 20:38:35,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,576 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:38:35,577 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:38:35,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,578 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:38:35,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:38:35,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2021-03-25 20:38:35,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:38:35,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 20:38:35,594 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:38:35,601 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:38:35,602 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:38:35,602 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:25 [2021-03-25 20:38:35,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:38:35,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:38:35,623 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,624 INFO L147 QuantifierPusher]: treesize reduction 2, result has 92.9 percent of original size 26 [2021-03-25 20:38:35,625 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.1 percent of original size [2021-03-25 20:38:35,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:38:35,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:38:35,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,626 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:38:35,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 20:38:35,630 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-03-25 20:38:35,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:38:35,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:38:35,635 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:38:35,639 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,640 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:38:35,640 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:12 [2021-03-25 20:38:35,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,666 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-25 20:38:35,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:38:35,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,667 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:38:35,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:38:35,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 20:38:35,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:38:35,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:38:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:38:35,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:38:35,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2021-03-25 20:38:35,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902790528] [2021-03-25 20:38:35,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-03-25 20:38:35,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:38:35,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-03-25 20:38:35,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-03-25 20:38:35,695 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2021-03-25 20:38:35,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 3167 transitions, 93511 flow. Second operand has 18 states, 18 states have (on average 15.5) internal successors, (279), 18 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:38:35,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:38:35,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2021-03-25 20:38:35,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 20:39:52,140 INFO L129 PetriNetUnfolder]: 37329/69100 cut-off events. [2021-03-25 20:39:52,140 INFO L130 PetriNetUnfolder]: For 4400868/4400882 co-relation queries the response was YES. [2021-03-25 20:39:54,352 INFO L84 FinitePrefix]: Finished finitePrefix Result has 853545 conditions, 69100 events. 37329/69100 cut-off events. For 4400868/4400882 co-relation queries the response was YES. Maximal size of possible extension queue 3669. Compared 710528 event pairs, 2704 based on Foata normal form. 18/69118 useless extension candidates. Maximal degree in co-relation 851976. Up to 30309 conditions per place. [2021-03-25 20:39:54,749 INFO L132 encePairwiseOnDemand]: 43/57 looper letters, 3706 selfloop transitions, 1043 changer transitions 19/4774 dead transitions. [2021-03-25 20:39:54,749 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 4774 transitions, 150719 flow [2021-03-25 20:39:54,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-25 20:39:54,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-03-25 20:39:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 364 transitions. [2021-03-25 20:39:54,750 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.35477582846003897 [2021-03-25 20:39:54,750 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 364 transitions. [2021-03-25 20:39:54,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 364 transitions. [2021-03-25 20:39:54,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 20:39:54,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 364 transitions. [2021-03-25 20:39:54,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 20.22222222222222) internal successors, (364), 18 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:39:54,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 57.0) internal successors, (1083), 19 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:39:54,752 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 57.0) internal successors, (1083), 19 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:39:54,752 INFO L185 Difference]: Start difference. First operand has 327 places, 3167 transitions, 93511 flow. Second operand 18 states and 364 transitions. [2021-03-25 20:39:54,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 4774 transitions, 150719 flow [2021-03-25 20:40:57,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 4774 transitions, 149645 flow, removed 520 selfloop flow, removed 9 redundant places. [2021-03-25 20:40:57,656 INFO L241 Difference]: Finished difference. Result has 345 places, 3780 transitions, 114524 flow [2021-03-25 20:40:57,658 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=92667, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=495, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=114524, PETRI_PLACES=345, PETRI_TRANSITIONS=3780} [2021-03-25 20:40:57,659 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 322 predicate places. [2021-03-25 20:40:57,659 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 20:40:57,659 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 345 places, 3780 transitions, 114524 flow [2021-03-25 20:40:57,659 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 345 places, 3780 transitions, 114524 flow [2021-03-25 20:40:57,703 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 345 places, 3780 transitions, 114524 flow [2021-03-25 20:40:59,271 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:40:59,271 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,271 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:40:59,271 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,271 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,272 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][3534], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 527#(<= k i), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 790#(<= k i), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 463#(<= (+ k 1) i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:40:59,272 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,272 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:40:59,272 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,272 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,272 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:40:59,272 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,272 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:40:59,272 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,272 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,662 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k))]) [2021-03-25 20:40:59,663 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][1681], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 527#(<= k i), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 790#(<= k i), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:40:59,663 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k))]) [2021-03-25 20:40:59,663 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:40:59,663 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 20:40:59,794 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][52], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-25 20:40:59,794 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,794 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:40:59,794 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:40:59,794 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,794 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k)), 1022#(< l N)]) [2021-03-25 20:40:59,795 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,795 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,795 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:40:59,795 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:40:59,795 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k)), 1022#(< l N)]) [2021-03-25 20:40:59,795 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,795 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,795 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:40:59,795 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:40:59,984 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:40:59,984 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:40:59,984 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,985 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:40:59,985 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:40:59,985 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:40:59,985 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:40:59,985 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:40:59,985 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:40:59,985 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,353 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][200], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 527#(<= k i), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 790#(<= k i), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 463#(<= (+ k 1) i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:00,353 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,353 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,353 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:41:00,353 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:00,353 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:00,353 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,353 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:41:00,353 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,353 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:00,354 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:00,354 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,354 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:00,354 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:41:00,354 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,492 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:00,492 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,492 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,492 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,492 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:00,492 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:00,492 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,492 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,492 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,492 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:00,510 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k))]) [2021-03-25 20:41:00,510 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:00,510 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:00,510 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 20:41:00,510 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,511 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][3126], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:00,511 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:00,511 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,511 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:00,511 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 20:41:00,511 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1532#(and (<= i (+ l 1)) (<= i k))]) [2021-03-25 20:41:00,511 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:00,511 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,511 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:00,511 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 20:41:00,742 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:00,742 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,743 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:00,743 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,743 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,743 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,743 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:00,743 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,743 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:00,743 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,743 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,743 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:00,833 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][2359], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-25 20:41:00,833 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-25 20:41:00,834 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-25 20:41:00,834 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:00,834 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:00,969 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][1889], [Black: 464#(<= k i), Black: 465#(<= N i), 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 790#(<= k i), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 569#(and (<= k i) (<= N (+ i 1))), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:00,969 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:00,969 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:00,969 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 20:41:00,969 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:01,142 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][799], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1558#(and (<= N k) (< i N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-25 20:41:01,142 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2021-03-25 20:41:01,142 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-25 20:41:01,142 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 20:41:01,142 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 20:41:01,870 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:01,871 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:01,871 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:01,871 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:41:01,871 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:01,871 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][477], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:01,871 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:01,871 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:01,871 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:41:01,871 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:01,871 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:01,871 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:01,872 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:01,872 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:41:01,872 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:01,888 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:01,888 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][3328], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:01,889 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:01,889 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:01,889 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:02,050 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:02,051 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:02,051 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:02,051 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:02,051 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:02,051 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:02,051 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:02,051 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:02,051 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:02,051 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:02,057 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:02,057 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:02,057 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:02,057 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:02,057 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:02,057 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:02,057 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:02,058 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:02,058 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:02,058 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:02,071 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][1091], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1558#(and (<= N k) (< i N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:02,071 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 20:41:02,071 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:02,071 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 20:41:02,071 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:02,418 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 1288#(and (<= (+ l 1) k) (< l N)), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:02,418 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 20:41:02,418 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:02,419 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:02,419 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:41:02,637 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][717], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1022#(< l N)]) [2021-03-25 20:41:02,637 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 20:41:02,637 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:41:02,637 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:02,637 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:02,664 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 1288#(and (<= (+ l 1) k) (< l N)), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:02,664 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is not cut-off event [2021-03-25 20:41:02,664 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 20:41:02,664 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-25 20:41:02,664 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is not cut-off event [2021-03-25 20:41:03,960 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][449], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 23#L23-1true, Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1558#(and (<= N k) (< i N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:03,960 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:03,960 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:03,960 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:03,960 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:03,964 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1570#(and (< i N) (<= i l)), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 48#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:03,964 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:03,964 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:03,964 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:03,964 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:03,965 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1570#(and (< i N) (<= i l)), Black: 1220#(<= i (+ k 1)), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 48#true, Black: 1040#(and (<= l i) (< l N)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, 1161#(<= i k), Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:03,965 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:03,965 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:03,965 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:03,965 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 20:41:03,967 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][1729], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 1550#(and (<= N k) (<= i k)), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 23#L23-1true, Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1222#(<= N k), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1160#(<= i (+ k 1)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:03,967 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 20:41:03,967 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:03,967 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:03,967 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:04,817 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([99] L34-1-->thread2EXIT: Formula: (not (< v_k_22 v_N_15)) InVars {N=v_N_15, k=v_k_22} OutVars{N=v_N_15, k=v_k_22} AuxVars[] AssignedVars[][2421], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 7#thread2EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 1302#(and (<= N k) (< (+ l 1) N)), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1564#(and (<= i (+ l 1)) (<= N k)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:04,817 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 20:41:04,817 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:04,817 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:04,817 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:04,817 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), 1480#(<= i (+ l 1)), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:04,817 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 20:41:04,817 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:04,817 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:04,817 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:04,818 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][3624], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:04,818 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 20:41:04,818 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:04,818 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:04,818 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:04,818 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1093#(<= i (+ l 1)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), 1480#(<= i (+ l 1)), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 460#true, Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:04,818 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 20:41:04,818 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 20:41:04,818 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:04,818 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:05,230 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:05,230 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 20:41:05,230 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:41:05,230 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 20:41:05,230 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:41:05,550 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:05,550 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2021-03-25 20:41:05,550 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 20:41:05,550 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-25 20:41:05,550 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 20:41:07,505 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([99] L34-1-->thread2EXIT: Formula: (not (< v_k_22 v_N_15)) InVars {N=v_N_15, k=v_k_22} OutVars{N=v_N_15, k=v_k_22} AuxVars[] AssignedVars[][2421], [Black: 464#(<= k i), 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 523#(<= N (+ i 1)), 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 1302#(and (<= N k) (< (+ l 1) N)), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1564#(and (<= i (+ l 1)) (<= N k)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 465#(<= N i), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:07,505 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 20:41:07,505 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:07,505 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:07,505 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:41:07,507 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([99] L34-1-->thread2EXIT: Formula: (not (< v_k_22 v_N_15)) InVars {N=v_N_15, k=v_k_22} OutVars{N=v_N_15, k=v_k_22} AuxVars[] AssignedVars[][2421], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 1302#(and (<= N k) (< (+ l 1) N)), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1564#(and (<= i (+ l 1)) (<= N k)), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:07,507 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 20:41:07,507 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:07,507 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:07,507 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:41:07,507 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), 1480#(<= i (+ l 1)), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:07,508 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 20:41:07,508 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:07,508 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:07,508 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:41:07,508 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 48#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), 633#(and (<= N i) (<= k i)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), 1480#(<= i (+ l 1)), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:07,508 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 20:41:07,508 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:07,508 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 20:41:07,508 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:41:08,275 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:08,275 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 20:41:08,275 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 20:41:08,275 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:41:08,275 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:41:08,275 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 15#L46-1true, Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1552#(and (< i N) (<= i k)), 1040#(and (<= l i) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:08,275 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 20:41:08,275 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 20:41:08,275 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 20:41:08,275 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:41:08,889 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 24#L47true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:08,889 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 20:41:08,889 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:08,889 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:41:08,889 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:41:08,890 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 465#(<= N i), 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 17#L34-1true, Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), 789#(<= k (+ i 1)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 537#(<= k (+ i 1)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 350#(<= k i), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1161#(<= i k), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1468#(<= i k), Black: 1160#(<= i (+ k 1)), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 464#(<= k i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:08,890 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 20:41:08,890 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:41:08,890 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:41:08,890 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:08,890 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][928], [Black: 464#(<= k i), Black: 465#(<= N i), 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 527#(<= k i), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 790#(<= k i), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), 1335#true, Black: 1469#(<= N k), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 48#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 1594#true, Black: 982#(<= (+ k 1) N), 59#true, Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), 463#(<= (+ k 1) i), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:08,890 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 20:41:08,890 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:41:08,890 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 20:41:08,890 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 20:41:10,154 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1402#true, Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-25 20:41:10,155 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 20:41:10,155 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 20:41:10,155 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 20:41:10,155 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 20:41:10,155 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [514#(and (<= N i) (<= k i)), Black: 464#(<= k i), Black: 465#(<= N i), 8#thread1EXITtrue, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1473#(<= i l), Black: 1282#(and (< l N) (<= l k)), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), 51#(<= (+ l 1) N), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1308#(and (<= N k) (<= l k)), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1468#(<= i k), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 48#true, 1335#true, Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 977#true, Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), 62#(<= N i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 537#(<= k (+ i 1)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 633#(and (<= N i) (<= k i)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1464#true, Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-25 20:41:10,155 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 20:41:10,155 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 20:41:10,155 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 20:41:10,155 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 20:41:10,713 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([99] L34-1-->thread2EXIT: Formula: (not (< v_k_22 v_N_15)) InVars {N=v_N_15, k=v_k_22} OutVars{N=v_N_15, k=v_k_22} AuxVars[] AssignedVars[][902], [Black: 464#(<= k i), 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 523#(<= N (+ i 1)), 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1296#(and (<= N k) (< l N)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1564#(and (<= i (+ l 1)) (<= N k)), 285#true, Black: 1217#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1480#(<= i (+ l 1)), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1548#(and (<= i l) (<= i k)), Black: 1226#(<= l k), Black: 1552#(and (< i N) (<= i k)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1469#(<= N k), Black: 50#(= i l), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), 62#(<= N i), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 527#(<= k i), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1339#(<= k (+ l 1)), Black: 1341#(<= N l), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1157#true, 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 465#(<= N i), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0)))]) [2021-03-25 20:41:10,713 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 20:41:10,713 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 20:41:10,713 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 20:41:10,713 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 20:41:25,369 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([83] L46-->L47: Formula: (< v_l_2 v_p_3) InVars {p=v_p_3, l=v_l_2} OutVars{p=v_p_3, l=v_l_2} AuxVars[] AssignedVars[][2162], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1040#(and (<= l i) (< l N)), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, 24#L47true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-25 20:41:25,369 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 20:41:25,369 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 20:41:25,369 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 20:41:25,369 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 20:41:25,369 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19) (= v_asum_11 (+ v_asum_12 (select v_A_15 v_i_16)))) InVars {A=v_A_15, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_15, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][2837], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, 13#L46true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), 1044#(and (<= (+ l 1) i) (< l N)), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1552#(and (< i N) (<= i k)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1040#(and (<= l i) (< l N)), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 1022#(< l N), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), 1402#true, Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1917#true, Black: 1093#(<= i (+ l 1)), Black: 1095#(<= N l), Black: 633#(and (<= N i) (<= k i)), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), Black: 1099#(<= i l), 643#true, Black: 1148#(and (<= N l) (<= i l)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 1160#(<= i (+ k 1)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1406#(<= p (+ l 1)), Black: 1407#(<= p l), 1467#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 1212#(and (<= (+ i 1) N) (<= i k)), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), 717#true, Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-25 20:41:25,369 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 20:41:25,369 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 20:41:25,369 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 20:41:25,370 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 20:41:25,370 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([84] L46-->L46-1: Formula: (not (< v_l_6 v_p_4)) InVars {p=v_p_4, l=v_l_6} OutVars{p=v_p_4, l=v_l_6} AuxVars[] AssignedVars[][219], [Black: 464#(<= k i), Black: 465#(<= N i), 518#true, 10#L63true, Black: 776#(and (= l 0) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1714#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 15#L46-1true, Black: 765#(and (< 0 N) (<= l 1) (= csum (+ asum 1))), Black: 1763#(and (<= (+ asum 2) csum) (<= i 2) (<= csum (+ asum 2)) (< csum (+ N asum 1))), 1040#(and (<= l i) (< l N)), 1552#(and (< i N) (<= i k)), Black: 749#(and (= l 0) (= l csum) (< l N) (= (+ l (select C l)) (+ asum 1))), Black: 1795#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 17#L34-1true, Black: 1716#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 1797#(and (<= (+ csum (select C 1)) (+ asum 2)) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (< (+ csum (select C 1)) (+ N asum 1)) (<= i 2) (<= (+ asum 2) (+ csum (select C 1))) (= l 1) (= csum (select C 0))), Black: 1799#(and (or (not (= k i)) (and (<= csum (+ i asum)) (< l (+ i 1)) (<= (+ k asum) csum) (<= i l))) (or (and (<= (+ k asum) (+ csum (select A k))) (= l k) (<= (+ csum (select A k) 1) (+ N asum))) (<= (+ k 2) N)) (< k (+ i 1))), Black: 1789#(and (not (= k i)) (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1791#(and (exists ((v_i_51 Int)) (and (<= i (+ v_i_51 1)) (<= v_i_51 1) (<= (+ k asum) (+ (select A (+ k (- 1))) (select A v_i_51) 1)) (<= (+ (select A (+ k (- 1))) (select A v_i_51) 1) (+ v_i_51 asum)) (< v_i_51 N))) (= k 1) (= l k) (or (and (<= csum (+ i asum)) (<= (+ k asum) csum)) (not (= k i))) (= (+ (select A (+ k (- 1))) 1) (select C (+ k (- 1)))) (= csum (select C (+ k (- 1)))) (< k (+ i 1))), 23#L23-1true, 1816#true, Black: 276#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 285#true, Black: 1568#(and (<= N k) (<= i l)), Black: 1217#true, Black: 1282#(and (< l N) (<= l k)), Black: 1473#(<= i l), Black: 1570#(and (< i N) (<= i l)), Black: 1314#(and (< l N) (<= i (+ k 1))), Black: 1538#(and (<= i (+ l 1)) (< i N) (<= i k)), Black: 1220#(<= i (+ k 1)), Black: 1540#(and (<= N k) (< i N) (<= i l)), Black: 1284#(and (<= (+ l 1) k) (< l N) (<= i (+ k 1))), Black: 1542#(and (<= i (+ l 1)) (<= N k) (< i N)), Black: 1222#(<= N k), Black: 1480#(<= i (+ l 1)), Black: 1286#(and (<= N k) (< l N) (<= i (+ k 1))), Black: 1544#(and (<= i (+ l 1)) (<= N k) (<= i k)), Black: 1288#(and (<= (+ l 1) k) (< l N)), Black: 1290#(and (<= (+ l 1) k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1546#(and (<= i (+ l 1)) (<= N k) (<= i (+ k 1))), Black: 1226#(<= l k), Black: 1548#(and (<= i l) (<= i k)), Black: 1296#(and (<= N k) (< l N)), Black: 1298#(and (<= (+ l 1) k) (< (+ l 1) N)), Black: 1556#(and (<= i (+ k 1)) (<= i l)), Black: 1056#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1558#(and (<= N k) (< i N)), Black: 1300#(and (<= N k) (< (+ l 1) N) (<= i (+ k 1))), Black: 1560#(and (<= i (+ k 1)) (< i N) (<= i l)), Black: 1302#(and (<= N k) (< (+ l 1) N)), Black: 1058#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1562#(and (<= N k) (<= i l) (<= i k)), Black: 1304#(and (<= l k) (<= i (+ k 1))), Black: 1467#(<= i (+ k 1)), Black: 1306#(and (<= N k) (<= l k) (<= i (+ k 1))), 51#(<= (+ l 1) N), Black: 1062#(and (<= l i) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1308#(and (<= N k) (<= l k)), Black: 1532#(and (<= i (+ l 1)) (<= i k)), Black: 1468#(<= i k), Black: 1278#(and (< l N) (<= l k) (<= i (+ k 1))), Black: 1310#(and (<= N k) (<= i (+ k 1))), Black: 1564#(and (<= i (+ l 1)) (<= N k)), Black: 1469#(<= N k), 1335#true, Black: 48#true, Black: 1038#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1534#(and (< i N) (<= i l) (<= i k)), Black: 50#(= i l), Black: 1566#(and (<= N k) (<= i (+ k 1)) (<= i l)), Black: 977#true, 1594#true, Black: 1044#(and (<= (+ l 1) i) (< l N)), 59#true, Black: 982#(<= (+ k 1) N), Black: 1048#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 986#(<= l i), Black: 1050#(and (<= (+ l 1) i) (< (+ l 1) N)), Black: 1052#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 537#(<= k (+ i 1)), Black: 573#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 1022#(< l N), Black: 1054#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 527#(<= k i), 1090#true, Black: 69#(= p l), Black: 789#(<= k (+ i 1)), Black: 838#(and (<= k i) (<= (+ k 1) N)), Black: 790#(<= k i), 843#true, Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 304#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (<= k (+ l 1)) (= l asum) (< l N) (= i csum)), 346#true, Black: 1824#(or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))), Black: 1856#(and (< 1 N) (= i 1) (= (select C 1) (+ (select A 1) 1)) (= (+ (select A 0) 1) csum) (= l 1) (= csum (select C 0)) (<= k 2) (= (select A (+ i (- 1))) asum)), Black: 1393#(and (<= N l) (<= k l)), Black: 1338#(<= k l), Black: 1339#(<= k (+ l 1)), Black: 1874#(and (< 1 N) (= (+ asum 2) csum) (<= N 2)), Black: 1895#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i)))))), Black: 1341#(<= N l), Black: 1391#(and (<= k (+ l 1)) (<= N (+ l 1))), Black: 1852#(and (= (+ (select A 0) 1) (select C 0)) (= k 1) (= i 1) (= l 1) (= csum (select C 0)) (= (select A (+ i (- 1))) asum)), Black: 1870#(and (< 1 N) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (= (select A (+ i (- 1))) asum) (<= N 2)), Black: 1822#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1903#(and (or (<= N i) (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ N asum (select A i)) (+ (select C l) csum)))) (< 1 N) (or (<= N i) (and (<= (+ N asum (select A i)) csum) (<= csum (+ N asum (select A i))))) (= (+ asum 2) csum) (<= N 2)), 1407#(<= p l), Black: 1093#(<= i (+ l 1)), Black: 633#(and (<= N i) (<= k i)), Black: 1095#(<= N l), Black: 1146#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 639#(and (<= N i) (<= k (+ i 1))), 643#true, Black: 1099#(<= i l), Black: 1148#(and (<= N l) (<= i l)), 1926#(or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)), Black: 875#(and (<= l (+ asum 1)) (= i asum) (= csum (+ (select A asum) asum 1)) (< asum N) (= asum 0)), 905#true, Black: 100#(and (< 0 N) (= l 0) (= k 0) (<= i 1) (= csum 0) (= asum (select A 0))), Black: 398#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 350#(<= k i), Black: 1601#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1681#(and (= (+ (select A (+ l (- 1))) 1) csum) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ l (- 1))) 1) (select C (+ l (- 1)))) (= (select C l) (+ (select A l) 1)) (= i 1) (= l 1) (< l N) (= asum (select A 0))), Black: 1602#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1683#(and (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1685#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (<= (+ k asum) (+ (select C l) csum)) (<= (+ k 1) N)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1687#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (<= (+ N asum) (+ (select C l) csum)) (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1656#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1675#(and (= l 0) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (or (not (= k i)) (and (<= (+ k asum) (select C l)) (<= p k) (= csum 0) (<= (select C l) (+ asum 1)))) (or (not (= k i)) (<= csum (+ l asum))) (or (not (= k i)) (and (= l k) (<= (+ csum 1) (+ N asum)) (<= (+ k asum) csum))) (< k (+ i 1))), Black: 1693#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1646#(and (= (select C (+ l (- 1))) csum) (= l 1) (= (+ asum 2) (+ (select C l) csum)) (< l N)), Black: 1679#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N))), Black: 1402#true, Black: 1406#(<= p (+ l 1)), 1212#(and (<= (+ i 1) N) (<= i k)), Black: 1160#(<= i (+ k 1)), Black: 1161#(<= i k), Black: 706#(and (= (+ asum 1) (select C 0)) (<= 0 l) (< 0 N) (<= k 1) (<= p k) (<= (+ k asum) (+ (select C l) csum)) (= csum 0) (<= (+ (select C l) csum) (+ N asum))), Black: 648#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (< csum (+ N asum 1))), Black: 964#(and (= l i) (<= (select C l) (+ N (select A i))) (<= (+ i asum) csum) (= l asum) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 681#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (< 0 k)), Black: 966#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 968#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 460#true, 717#true, Black: 937#(and (< 0 N) (<= k 1) (= i 0) (= (+ (select A 0) 1) csum) (= asum 0)), Black: 909#(and (<= (+ i asum (select A i) 1) csum) (<= csum (+ N asum (select A i)))), Black: 910#(and (or (<= (+ N asum) csum) (<= (+ i asum) csum)) (< csum (+ N asum 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), 212#true, Black: 1925#(or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)), Black: 2007#(and (< 1 N) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 1927#(and (<= (+ N asum) csum) (< csum (+ N asum 1))), Black: 2009#(and (< 1 N) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (<= (+ l asum (select A i)) csum) (= i 1) (= csum (+ (select A 1) (select A 0) 2)) (<= k 2) (= asum (select A 0))), Black: 2011#(and (< 1 N) (or (<= (+ N asum) csum) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum)), Black: 1917#true, Black: 2013#(and (< 1 N) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i)) (<= k 2) (= (+ asum 2) csum) (<= N 2)), Black: 1997#(and (or (and (<= (+ (select C l) csum) (+ N asum (select A i))) (<= (+ l asum (select A i) 1) (+ (select C l) csum))) (<= (+ l 1) i)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (or (and (<= (+ l asum (select A i)) csum) (<= csum (+ N asum (select A i)))) (<= l i))), Black: 1999#(and (= l 0) (= k (+ l 1)) (or (and (<= (+ N asum) csum) (< csum (+ N asum 1))) (<= (+ l 1) N)) (= (select C l) (+ (select A l) 1)) (= i 1) (= k p) (= csum 0) (= asum (select A 0))), 1262#(< l N)]) [2021-03-25 20:41:25,370 INFO L384 tUnfolder$Statistics]: this new event has 26 ancestors and is cut-off event [2021-03-25 20:41:25,370 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-03-25 20:41:25,370 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-03-25 20:41:25,370 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 20:41:26,844 INFO L129 PetriNetUnfolder]: 24289/50876 cut-off events. [2021-03-25 20:41:26,845 INFO L130 PetriNetUnfolder]: For 3541060/3564587 co-relation queries the response was YES. [2021-03-25 20:41:28,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 620940 conditions, 50876 events. 24289/50876 cut-off events. For 3541060/3564587 co-relation queries the response was YES. Maximal size of possible extension queue 3134. Compared 577649 event pairs, 1379 based on Foata normal form. 5407/55261 useless extension candidates. Maximal degree in co-relation 620082. Up to 12964 conditions per place. [2021-03-25 20:41:29,229 INFO L142 LiptonReduction]: Number of co-enabled transitions 12254 [2021-03-25 20:41:33,525 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-25 20:41:33,525 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 20:41:33,525 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35866 [2021-03-25 20:41:33,526 INFO L480 AbstractCegarLoop]: Abstraction has has 345 places, 3780 transitions, 114555 flow [2021-03-25 20:41:33,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 15.5) internal successors, (279), 18 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:41:33,526 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 20:41:33,526 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 20:41:33,735 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:41:33,735 INFO L428 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 20:41:33,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 20:41:33,736 INFO L82 PathProgramCache]: Analyzing trace with hash 137774974, now seen corresponding path program 6 times [2021-03-25 20:41:33,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 20:41:33,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742300277] [2021-03-25 20:41:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 20:41:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 20:41:33,779 INFO L142 QuantifierPusher]: treesize reduction 11, result has 66.7 percent of original size [2021-03-25 20:41:33,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 20:41:33,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:33,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 20:41:33,808 INFO L142 QuantifierPusher]: treesize reduction 31, result has 65.9 percent of original size [2021-03-25 20:41:33,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-25 20:41:33,844 INFO L142 QuantifierPusher]: treesize reduction 53, result has 51.4 percent of original size [2021-03-25 20:41:33,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-03-25 20:41:33,883 INFO L142 QuantifierPusher]: treesize reduction 53, result has 52.3 percent of original size [2021-03-25 20:41:33,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-03-25 20:41:33,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:33,922 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:41:33,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:33,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:41:33,948 INFO L142 QuantifierPusher]: treesize reduction 13, result has 64.9 percent of original size [2021-03-25 20:41:33,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:41:33,965 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 20:41:33,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:41:33,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742300277] [2021-03-25 20:41:33,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60988428] [2021-03-25 20:41:33,976 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:41:33,996 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-03-25 20:41:33,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 20:41:33,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 30 conjunts are in the unsatisfiable core [2021-03-25 20:41:33,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 20:41:33,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,000 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 20:41:34,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,017 INFO L147 QuantifierPusher]: treesize reduction 2, result has 90.9 percent of original size 20 [2021-03-25 20:41:34,017 INFO L142 QuantifierPusher]: treesize reduction 2, result has 90.9 percent of original size [2021-03-25 20:41:34,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 20:41:34,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,042 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 20:41:34,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 20:41:34,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,043 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 20:41:34,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 20:41:34,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,045 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 20:41:34,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-03-25 20:41:34,048 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2021-03-25 20:41:34,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:41:34,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:41:34,049 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:41:34,056 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:41:34,056 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:41:34,056 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2021-03-25 20:41:34,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:41:34,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,057 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:41:34,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:41:34,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:41:34,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:41:34,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 20:41:34,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 20:41:34,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 20:41:34,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 20:41:34,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 20:41:34,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:41:34,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:41:34,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:41:34,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:41:34,147 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-25 20:41:34,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 20:41:34,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,149 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 20:41:34,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:41:34,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:41:34,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-03-25 20:41:34,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,177 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:41:34,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:41:34,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,178 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 20:41:34,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:41:34,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,180 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:41:34,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 20:41:34,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 20:41:34,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 20:41:34,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 20:41:34,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 20:41:34,188 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2021-03-25 20:41:34,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:41:34,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 20:41:34,190 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:41:34,196 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2021-03-25 20:41:34,198 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-03-25 20:41:34,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:41:34,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 20:41:34,198 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-25 20:41:34,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:41:34,205 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:41:34,205 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:24 [2021-03-25 20:41:34,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:41:34,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:41:34,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:41:34,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:41:34,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:41:34,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 20:41:34,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 20:41:34,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,226 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:41:34,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:41:34,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,227 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 20:41:34,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 20:41:34,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 20:41:34,230 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2021-03-25 20:41:34,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:41:34,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 20:41:34,231 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 20:41:34,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,235 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 20:41:34,235 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:12 [2021-03-25 20:41:34,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 20:41:34,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 20:41:34,259 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 20:41:34,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 20:41:34,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-03-25 20:41:34,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103542610] [2021-03-25 20:41:34,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-25 20:41:34,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 20:41:34,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-25 20:41:34,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2021-03-25 20:41:34,260 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 58 [2021-03-25 20:41:34,261 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 3780 transitions, 114555 flow. Second operand has 19 states, 19 states have (on average 15.421052631578947) internal successors, (293), 19 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 20:41:34,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 20:41:34,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 58 [2021-03-25 20:41:34,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2021-03-25 20:43:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-03-25 20:43:20,747 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 20:43:20,748 WARN L545 AbstractCegarLoop]: Verification canceled [2021-03-25 20:43:20,750 WARN L224 ceAbstractionStarter]: Timeout [2021-03-25 20:43:20,751 INFO L202 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 08:43:20 BasicIcfg [2021-03-25 20:43:20,751 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 20:43:20,751 INFO L168 Benchmark]: Toolchain (without parser) took 789572.41 ms. Allocated memory was 255.9 MB in the beginning and 14.2 GB in the end (delta: 13.9 GB). Free memory was 236.6 MB in the beginning and 11.3 GB in the end (delta: -11.1 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. [2021-03-25 20:43:20,751 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 20:43:20,751 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.81 ms. Allocated memory is still 255.9 MB. Free memory was 236.5 MB in the beginning and 235.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 20:43:20,751 INFO L168 Benchmark]: Boogie Preprocessor took 13.18 ms. Allocated memory is still 255.9 MB. Free memory was 235.1 MB in the beginning and 234.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 20:43:20,751 INFO L168 Benchmark]: RCFGBuilder took 265.90 ms. Allocated memory is still 255.9 MB. Free memory was 234.0 MB in the beginning and 235.0 MB in the end (delta: -1.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.0 GB. [2021-03-25 20:43:20,752 INFO L168 Benchmark]: TraceAbstraction took 789267.87 ms. Allocated memory was 255.9 MB in the beginning and 14.2 GB in the end (delta: 13.9 GB). Free memory was 234.6 MB in the beginning and 11.3 GB in the end (delta: -11.1 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. [2021-03-25 20:43:20,752 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 21.81 ms. Allocated memory is still 255.9 MB. Free memory was 236.5 MB in the beginning and 235.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 13.18 ms. Allocated memory is still 255.9 MB. Free memory was 235.1 MB in the beginning and 234.1 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 265.90 ms. Allocated memory is still 255.9 MB. Free memory was 234.0 MB in the beginning and 235.0 MB in the end (delta: -1.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 789267.87 ms. Allocated memory was 255.9 MB in the beginning and 14.2 GB in the end (delta: 13.9 GB). Free memory was 234.6 MB in the beginning and 11.3 GB in the end (delta: -11.1 GB). Peak memory consumption was 7.2 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 232.8ms, 30 PlacesBefore, 23 PlacesAfterwards, 24 TransitionsBefore, 17 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 74, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 70, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 70, positive: 66, positive conditional: 0, positive unconditional: 66, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 74, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 70, unknown conditional: 0, unknown unconditional: 70] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.7ms, 22 PlacesBefore, 22 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.2ms, 30 PlacesBefore, 30 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7ms, 35 PlacesBefore, 33 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 122 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1ms, 31 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1ms, 38 PlacesBefore, 38 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 162 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.4ms, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 8, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.8ms, 56 PlacesBefore, 56 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 12 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 144.5ms, 67 PlacesBefore, 66 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 72, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 72, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 199.0ms, 70 PlacesBefore, 70 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 161 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 161, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, positive: 161, positive conditional: 0, positive unconditional: 161, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.7ms, 74 PlacesBefore, 74 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 144.0ms, 79 PlacesBefore, 79 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 57 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 54.4ms, 85 PlacesBefore, 85 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.5ms, 95 PlacesBefore, 95 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 790 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.8ms, 104 PlacesBefore, 104 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 796 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 93.5ms, 110 PlacesBefore, 110 PlacesAfterwards, 126 TransitionsBefore, 126 TransitionsAfterwards, 966 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 75.7ms, 121 PlacesBefore, 121 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 1082 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.2ms, 125 PlacesBefore, 125 PlacesAfterwards, 152 TransitionsBefore, 152 TransitionsAfterwards, 1160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 97.3ms, 132 PlacesBefore, 132 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 1202 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 95.7ms, 147 PlacesBefore, 147 PlacesAfterwards, 189 TransitionsBefore, 189 TransitionsAfterwards, 1386 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 360.4ms, 185 PlacesBefore, 185 PlacesAfterwards, 369 TransitionsBefore, 369 TransitionsAfterwards, 2194 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 620.1ms, 196 PlacesBefore, 195 PlacesAfterwards, 468 TransitionsBefore, 468 TransitionsAfterwards, 2422 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1354.9ms, 199 PlacesBefore, 199 PlacesAfterwards, 605 TransitionsBefore, 605 TransitionsAfterwards, 3226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5018.8ms, 239 PlacesBefore, 234 PlacesAfterwards, 1227 TransitionsBefore, 1227 TransitionsAfterwards, 5012 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9194.7ms, 236 PlacesBefore, 227 PlacesAfterwards, 1655 TransitionsBefore, 1655 TransitionsAfterwards, 6496 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11933.8ms, 217 PlacesBefore, 215 PlacesAfterwards, 1810 TransitionsBefore, 1810 TransitionsAfterwards, 6798 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17423.0ms, 260 PlacesBefore, 260 PlacesAfterwards, 2721 TransitionsBefore, 2721 TransitionsAfterwards, 9076 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17816.0ms, 291 PlacesBefore, 289 PlacesAfterwards, 2858 TransitionsBefore, 2858 TransitionsAfterwards, 9528 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17933.1ms, 311 PlacesBefore, 309 PlacesAfterwards, 2890 TransitionsBefore, 2890 TransitionsAfterwards, 9654 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25987.0ms, 330 PlacesBefore, 327 PlacesAfterwards, 3168 TransitionsBefore, 3167 TransitionsAfterwards, 10432 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 8, Positive conditional cache size: 0, Positive unconditional cache size: 8, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35866.0ms, 345 PlacesBefore, 345 PlacesAfterwards, 3780 TransitionsBefore, 3780 TransitionsAfterwards, 12254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 68). Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (19states, 14/58 universal loopers) in iteration 31,while PetriNetUnfolder was constructing finite prefix that currently has 864462 conditions, 67028 events (36988/67027 cut-off events. For 4586803/4586817 co-relation queries the response was YES. Maximal size of possible extension queue 3952. Compared 695991 event pairs, 2691 based on Foata normal form. 13/68088 useless extension candidates. Maximal degree in co-relation 862997. Up to 30539 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 9.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 789132.2ms, OverallIterations: 31, TraceHistogramMax: 2, EmptinessCheckTime: 0.0ms, AutomataDifference: 631079.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 323.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 269 SDtfs, 1361 SDslu, 205 SDs, 0 SdLazy, 9193 SolverSat, 597 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4386.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 744 GetRequests, 325 SyntacticMatches, 14 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1569 ImplicationChecksByTransitivity, 5562.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=114555occurred in iteration=30, InterpolantAutomatonStates: 326, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 109.6ms SsaConstructionTime, 457.9ms SatisfiabilityAnalysisTime, 6099.8ms InterpolantComputationTime, 950 NumberOfCodeBlocks, 950 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 893 ConstructedInterpolants, 1 QuantifiedInterpolants, 10728 SizeOfPredicates, 57 NumberOfNonLiveVariables, 1712 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 57 InterpolantComputations, 5 PerfectInterpolantSequences, 79/287 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown