/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-RepeatedVariableLbe.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 10:41:45,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 10:41:45,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 10:41:45,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 10:41:45,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 10:41:45,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 10:41:45,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 10:41:45,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 10:41:45,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 10:41:45,719 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 10:41:45,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 10:41:45,720 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 10:41:45,721 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 10:41:45,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 10:41:45,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 10:41:45,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 10:41:45,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 10:41:45,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 10:41:45,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 10:41:45,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 10:41:45,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 10:41:45,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 10:41:45,741 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 10:41:45,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 10:41:45,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 10:41:45,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 10:41:45,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 10:41:45,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 10:41:45,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 10:41:45,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 10:41:45,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 10:41:45,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 10:41:45,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 10:41:45,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 10:41:45,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 10:41:45,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 10:41:45,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 10:41:45,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 10:41:45,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 10:41:45,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 10:41:45,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 10:41:45,758 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-RepeatedVariableLbe.epf [2021-03-25 10:41:45,791 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 10:41:45,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 10:41:45,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 10:41:45,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 10:41:45,792 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 10:41:45,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 10:41:45,792 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 10:41:45,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 10:41:45,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 10:41:45,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 10:41:45,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 10:41:45,795 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 10:41:46,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 10:41:46,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 10:41:46,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 10:41:46,120 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2021-03-25 10:41:46,121 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2021-03-25 10:41:46,121 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 10:41:46,121 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 10:41:46,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 10:41:46,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-03-25 10:41:46,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 10:41:46,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 10:41:46,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 10:41:46,159 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 10:41:46" (1/1) ... [2021-03-25 10:41:46,164 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 10:41:46" (1/1) ... [2021-03-25 10:41:46,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 10:41:46,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 10:41:46,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 10:41:46,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 10:41:46,175 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 10:41:46" (1/1) ... [2021-03-25 10:41:46,176 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 10:41:46" (1/1) ... [2021-03-25 10:41:46,177 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 10:41:46" (1/1) ... [2021-03-25 10:41:46,178 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 10:41:46" (1/1) ... [2021-03-25 10:41:46,180 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 10:41:46" (1/1) ... [2021-03-25 10:41:46,182 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 10:41:46" (1/1) ... [2021-03-25 10:41:46,183 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 10:41:46" (1/1) ... [2021-03-25 10:41:46,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 10:41:46,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 10:41:46,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 10:41:46,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 10:41:46,185 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 10:41:46" (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 10:41:46,243 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2021-03-25 10:41:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-03-25 10:41:46,244 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-03-25 10:41:46,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2021-03-25 10:41:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-03-25 10:41:46,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-03-25 10:41:46,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2021-03-25 10:41:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 10:41:46,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 10:41:46,245 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2021-03-25 10:41:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-03-25 10:41:46,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-03-25 10:41:46,246 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 10:41:46,460 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 10:41:46,460 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-03-25 10:41:46,461 INFO L202 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 10:41:46 BoogieIcfgContainer [2021-03-25 10:41:46,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 10:41:46,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 10:41:46,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 10:41:46,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 10:41:46,465 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 10:41:46" (1/2) ... [2021-03-25 10:41:46,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650a8c7c and model type simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 10:41:46, skipping insertion in model container [2021-03-25 10:41:46,480 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 10:41:46" (2/2) ... [2021-03-25 10:41:46,481 INFO L111 eAbstractionObserver]: Analyzing ICFG simple-array-sum.wvr.bpl [2021-03-25 10:41:46,485 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 10:41:46,487 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-25 10:41:46,487 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 10:41:46,548 INFO L149 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-03-25 10:41:46,570 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-03-25 10:41:46,583 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 10:41:46,592 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 10:41:46,601 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 10:41:46,601 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 10:41:46,601 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 10:41:46,601 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 10:41:46,601 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 10:41:46,601 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 10:41:46,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 82 flow [2021-03-25 10:41:46,632 INFO L129 PetriNetUnfolder]: 4/26 cut-off events. [2021-03-25 10:41:46,632 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 10:41:46,634 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 10:41:46,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 29 transitions, 82 flow [2021-03-25 10:41:46,642 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 24 transitions, 66 flow [2021-03-25 10:41:46,643 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:46,651 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 66 flow [2021-03-25 10:41:46,657 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 66 flow [2021-03-25 10:41:46,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 66 flow [2021-03-25 10:41:46,676 INFO L129 PetriNetUnfolder]: 4/24 cut-off events. [2021-03-25 10:41:46,676 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 10:41:46,677 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 10:41:46,678 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-25 10:41:46,857 INFO L154 LiptonReduction]: Checked pairs total: 90 [2021-03-25 10:41:46,857 INFO L156 LiptonReduction]: Total number of compositions: 7 [2021-03-25 10:41:46,860 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 218 [2021-03-25 10:41:46,871 INFO L129 PetriNetUnfolder]: 4/16 cut-off events. [2021-03-25 10:41:46,872 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 10:41:46,872 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:46,872 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:46,873 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:46,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:46,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1603213337, now seen corresponding path program 1 times [2021-03-25 10:41:46,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:46,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668089477] [2021-03-25 10:41:46,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:46,997 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.7 percent of original size [2021-03-25 10:41:46,998 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:41:47,020 INFO L142 QuantifierPusher]: treesize reduction 13, result has 76.4 percent of original size [2021-03-25 10:41:47,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-03-25 10:41:47,044 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 10:41:47,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668089477] [2021-03-25 10:41:47,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 10:41:47,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 10:41:47,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665003700] [2021-03-25 10:41:47,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 10:41:47,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:47,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 10:41:47,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 10:41:47,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2021-03-25 10:41:47,061 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 10:41:47,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:47,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2021-03-25 10:41:47,062 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:47,131 INFO L129 PetriNetUnfolder]: 104/163 cut-off events. [2021-03-25 10:41:47,131 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2021-03-25 10:41:47,131 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 10:41:47,133 INFO L132 encePairwiseOnDemand]: 31/36 looper letters, 18 selfloop transitions, 5 changer transitions 1/30 dead transitions. [2021-03-25 10:41:47,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 30 transitions, 126 flow [2021-03-25 10:41:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 10:41:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 10:41:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2021-03-25 10:41:47,141 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2021-03-25 10:41:47,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 85 transitions. [2021-03-25 10:41:47,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 85 transitions. [2021-03-25 10:41:47,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:47,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 85 transitions. [2021-03-25 10:41:47,144 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 10:41:47,147 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 10:41:47,147 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 10:41:47,148 INFO L185 Difference]: Start difference. First operand has 23 places, 17 transitions, 52 flow. Second operand 4 states and 85 transitions. [2021-03-25 10:41:47,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 30 transitions, 126 flow [2021-03-25 10:41:47,151 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 10:41:47,152 INFO L241 Difference]: Finished difference. Result has 22 places, 21 transitions, 72 flow [2021-03-25 10:41:47,153 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 10:41:47,154 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2021-03-25 10:41:47,154 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:47,154 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 21 transitions, 72 flow [2021-03-25 10:41:47,154 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 21 transitions, 72 flow [2021-03-25 10:41:47,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 22 places, 21 transitions, 72 flow [2021-03-25 10:41:47,158 INFO L129 PetriNetUnfolder]: 10/35 cut-off events. [2021-03-25 10:41:47,158 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 10:41:47,159 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 10:41:47,159 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-25 10:41:47,160 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:41:47,160 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:41:47,160 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-25 10:41:47,161 INFO L480 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 72 flow [2021-03-25 10:41:47,161 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 10:41:47,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:47,161 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:47,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 10:41:47,162 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:47,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:47,162 INFO L82 PathProgramCache]: Analyzing trace with hash 2064833924, now seen corresponding path program 1 times [2021-03-25 10:41:47,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:47,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120357127] [2021-03-25 10:41:47,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:47,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:47,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:47,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:47,182 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 10:41:47,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120357127] [2021-03-25 10:41:47,182 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 10:41:47,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 10:41:47,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364069044] [2021-03-25 10:41:47,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 10:41:47,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:47,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 10:41:47,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 10:41:47,184 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2021-03-25 10:41:47,185 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 10:41:47,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:47,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2021-03-25 10:41:47,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:47,230 INFO L129 PetriNetUnfolder]: 104/175 cut-off events. [2021-03-25 10:41:47,230 INFO L130 PetriNetUnfolder]: For 46/51 co-relation queries the response was YES. [2021-03-25 10:41:47,231 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 10:41:47,232 INFO L132 encePairwiseOnDemand]: 30/36 looper letters, 23 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2021-03-25 10:41:47,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 37 transitions, 173 flow [2021-03-25 10:41:47,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 10:41:47,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 10:41:47,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2021-03-25 10:41:47,233 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6 [2021-03-25 10:41:47,233 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 108 transitions. [2021-03-25 10:41:47,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 108 transitions. [2021-03-25 10:41:47,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:47,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 108 transitions. [2021-03-25 10:41:47,234 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 10:41:47,235 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 10:41:47,235 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 10:41:47,235 INFO L185 Difference]: Start difference. First operand has 22 places, 21 transitions, 72 flow. Second operand 5 states and 108 transitions. [2021-03-25 10:41:47,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 37 transitions, 173 flow [2021-03-25 10:41:47,236 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 10:41:47,237 INFO L241 Difference]: Finished difference. Result has 30 places, 24 transitions, 123 flow [2021-03-25 10:41:47,237 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 10:41:47,237 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 7 predicate places. [2021-03-25 10:41:47,237 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:47,237 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 24 transitions, 123 flow [2021-03-25 10:41:47,238 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 123 flow [2021-03-25 10:41:47,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 123 flow [2021-03-25 10:41:47,242 INFO L129 PetriNetUnfolder]: 12/52 cut-off events. [2021-03-25 10:41:47,242 INFO L130 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2021-03-25 10:41:47,242 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 10:41:47,243 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-25 10:41:47,244 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:41:47,244 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:41:47,244 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 10:41:47,245 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 123 flow [2021-03-25 10:41:47,245 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 10:41:47,245 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:47,245 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:47,245 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 10:41:47,245 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:47,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:47,246 INFO L82 PathProgramCache]: Analyzing trace with hash -452810530, now seen corresponding path program 2 times [2021-03-25 10:41:47,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:47,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698876893] [2021-03-25 10:41:47,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:47,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:47,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:47,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:47,265 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 10:41:47,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698876893] [2021-03-25 10:41:47,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 10:41:47,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 10:41:47,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333591871] [2021-03-25 10:41:47,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 10:41:47,266 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:47,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 10:41:47,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 10:41:47,267 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 36 [2021-03-25 10:41:47,267 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 10:41:47,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:47,267 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 36 [2021-03-25 10:41:47,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:47,307 INFO L129 PetriNetUnfolder]: 90/155 cut-off events. [2021-03-25 10:41:47,307 INFO L130 PetriNetUnfolder]: For 188/205 co-relation queries the response was YES. [2021-03-25 10:41:47,308 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 10:41:47,308 INFO L132 encePairwiseOnDemand]: 30/36 looper letters, 24 selfloop transitions, 5 changer transitions 6/41 dead transitions. [2021-03-25 10:41:47,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 252 flow [2021-03-25 10:41:47,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 10:41:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 10:41:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2021-03-25 10:41:47,310 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6 [2021-03-25 10:41:47,310 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 108 transitions. [2021-03-25 10:41:47,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 108 transitions. [2021-03-25 10:41:47,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:47,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 108 transitions. [2021-03-25 10:41:47,311 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 10:41:47,311 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 10:41:47,311 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 10:41:47,312 INFO L185 Difference]: Start difference. First operand has 30 places, 24 transitions, 123 flow. Second operand 5 states and 108 transitions. [2021-03-25 10:41:47,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 252 flow [2021-03-25 10:41:47,313 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 10:41:47,314 INFO L241 Difference]: Finished difference. Result has 35 places, 22 transitions, 114 flow [2021-03-25 10:41:47,314 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 10:41:47,314 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 12 predicate places. [2021-03-25 10:41:47,314 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:47,314 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 114 flow [2021-03-25 10:41:47,314 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 22 transitions, 114 flow [2021-03-25 10:41:47,315 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 114 flow [2021-03-25 10:41:47,317 INFO L129 PetriNetUnfolder]: 8/31 cut-off events. [2021-03-25 10:41:47,317 INFO L130 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2021-03-25 10:41:47,317 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 10:41:47,317 INFO L142 LiptonReduction]: Number of co-enabled transitions 122 [2021-03-25 10:41:47,318 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:41:47,318 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:41:47,319 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5 [2021-03-25 10:41:47,319 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 114 flow [2021-03-25 10:41:47,319 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 10:41:47,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:47,319 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:47,319 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 10:41:47,319 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:47,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:47,320 INFO L82 PathProgramCache]: Analyzing trace with hash 99223701, now seen corresponding path program 1 times [2021-03-25 10:41:47,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:47,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004543467] [2021-03-25 10:41:47,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:47,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:47,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:47,332 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 10:41:47,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004543467] [2021-03-25 10:41:47,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 10:41:47,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 10:41:47,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433298286] [2021-03-25 10:41:47,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 10:41:47,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:47,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 10:41:47,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 10:41:47,334 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 36 [2021-03-25 10:41:47,334 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 10:41:47,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:47,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 36 [2021-03-25 10:41:47,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:47,344 INFO L129 PetriNetUnfolder]: 23/52 cut-off events. [2021-03-25 10:41:47,344 INFO L130 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2021-03-25 10:41:47,344 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 10:41:47,344 INFO L132 encePairwiseOnDemand]: 33/36 looper letters, 12 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2021-03-25 10:41:47,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 160 flow [2021-03-25 10:41:47,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 10:41:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 10:41:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2021-03-25 10:41:47,345 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7962962962962963 [2021-03-25 10:41:47,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 86 transitions. [2021-03-25 10:41:47,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 86 transitions. [2021-03-25 10:41:47,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:47,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 86 transitions. [2021-03-25 10:41:47,346 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 10:41:47,346 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 10:41:47,347 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 10:41:47,347 INFO L185 Difference]: Start difference. First operand has 33 places, 22 transitions, 114 flow. Second operand 3 states and 86 transitions. [2021-03-25 10:41:47,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 160 flow [2021-03-25 10:41:47,347 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 10:41:47,348 INFO L241 Difference]: Finished difference. Result has 31 places, 23 transitions, 109 flow [2021-03-25 10:41:47,348 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 10:41:47,348 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 8 predicate places. [2021-03-25 10:41:47,348 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:47,348 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 23 transitions, 109 flow [2021-03-25 10:41:47,349 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 23 transitions, 109 flow [2021-03-25 10:41:47,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 23 transitions, 109 flow [2021-03-25 10:41:47,351 INFO L129 PetriNetUnfolder]: 11/38 cut-off events. [2021-03-25 10:41:47,351 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-25 10:41:47,351 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 10:41:47,351 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-25 10:41:47,352 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:41:47,352 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:41:47,352 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4 [2021-03-25 10:41:47,353 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 109 flow [2021-03-25 10:41:47,353 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 10:41:47,353 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:47,353 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:47,353 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 10:41:47,353 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:47,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:47,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2029596539, now seen corresponding path program 1 times [2021-03-25 10:41:47,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:47,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061064014] [2021-03-25 10:41:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:47,407 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 10:41:47,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:47,411 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 10:41:47,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:47,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:47,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:47,420 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 10:41:47,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061064014] [2021-03-25 10:41:47,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 10:41:47,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 10:41:47,420 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878525280] [2021-03-25 10:41:47,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 10:41:47,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:47,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 10:41:47,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 10:41:47,421 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2021-03-25 10:41:47,422 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 10:41:47,422 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:47,422 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2021-03-25 10:41:47,422 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:47,470 INFO L129 PetriNetUnfolder]: 127/198 cut-off events. [2021-03-25 10:41:47,470 INFO L130 PetriNetUnfolder]: For 143/153 co-relation queries the response was YES. [2021-03-25 10:41:47,471 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 10:41:47,471 INFO L132 encePairwiseOnDemand]: 29/36 looper letters, 28 selfloop transitions, 10 changer transitions 1/45 dead transitions. [2021-03-25 10:41:47,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 285 flow [2021-03-25 10:41:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 10:41:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 10:41:47,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2021-03-25 10:41:47,473 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2021-03-25 10:41:47,473 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 120 transitions. [2021-03-25 10:41:47,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 120 transitions. [2021-03-25 10:41:47,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:47,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 120 transitions. [2021-03-25 10:41:47,473 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 10:41:47,474 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 10:41:47,474 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 10:41:47,474 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 109 flow. Second operand 6 states and 120 transitions. [2021-03-25 10:41:47,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 285 flow [2021-03-25 10:41:47,475 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 10:41:47,476 INFO L241 Difference]: Finished difference. Result has 38 places, 29 transitions, 178 flow [2021-03-25 10:41:47,476 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 10:41:47,476 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 15 predicate places. [2021-03-25 10:41:47,476 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:47,476 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 29 transitions, 178 flow [2021-03-25 10:41:47,476 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 29 transitions, 178 flow [2021-03-25 10:41:47,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 29 transitions, 178 flow [2021-03-25 10:41:47,480 INFO L129 PetriNetUnfolder]: 20/59 cut-off events. [2021-03-25 10:41:47,480 INFO L130 PetriNetUnfolder]: For 31/34 co-relation queries the response was YES. [2021-03-25 10:41:47,480 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 10:41:47,480 INFO L142 LiptonReduction]: Number of co-enabled transitions 162 [2021-03-25 10:41:47,482 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:41:47,482 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:41:47,482 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-25 10:41:47,482 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 178 flow [2021-03-25 10:41:47,482 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 10:41:47,482 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:47,482 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:47,483 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 10:41:47,483 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash -325290422, now seen corresponding path program 1 times [2021-03-25 10:41:47,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:47,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398226346] [2021-03-25 10:41:47,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:47,507 INFO L142 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size [2021-03-25 10:41:47,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:47,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:47,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:47,537 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:41:47,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,545 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 10:41:47,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398226346] [2021-03-25 10:41:47,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764792138] [2021-03-25 10:41:47,545 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 10:41:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:47,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 10:41:47,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:47,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,669 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.6 percent of original size [2021-03-25 10:41:47,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 10:41:47,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,675 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:47,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:47,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:47,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:47,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:47,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:47,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:41:47,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:47,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:47,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,707 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:47,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:47,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:47,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:47,710 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:47,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:47,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:47,747 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 10:41:47,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:47,748 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:47,749 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:47,755 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,771 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 10:41:47,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:47,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:47,772 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:47,778 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,780 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:47,780 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2021-03-25 10:41:47,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:47,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:47,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,806 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:47,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:47,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:47,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,808 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:47,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,808 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:47,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:47,811 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 10:41:47,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:47,812 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:47,813 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:47,816 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,817 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:47,817 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 10:41:47,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,832 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,833 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:47,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:47,839 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 10:41:47,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:47,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 10:41:47,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769917170] [2021-03-25 10:41:47,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 10:41:47,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:47,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 10:41:47,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 10:41:47,840 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2021-03-25 10:41:47,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 178 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 10:41:47,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:47,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2021-03-25 10:41:47,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:48,040 INFO L129 PetriNetUnfolder]: 173/289 cut-off events. [2021-03-25 10:41:48,041 INFO L130 PetriNetUnfolder]: For 388/405 co-relation queries the response was YES. [2021-03-25 10:41:48,042 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 10:41:48,044 INFO L132 encePairwiseOnDemand]: 29/36 looper letters, 34 selfloop transitions, 12 changer transitions 2/54 dead transitions. [2021-03-25 10:41:48,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 390 flow [2021-03-25 10:41:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 10:41:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 10:41:48,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2021-03-25 10:41:48,046 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2021-03-25 10:41:48,046 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 138 transitions. [2021-03-25 10:41:48,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 138 transitions. [2021-03-25 10:41:48,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:48,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 138 transitions. [2021-03-25 10:41:48,047 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 10:41:48,048 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 10:41:48,048 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 10:41:48,049 INFO L185 Difference]: Start difference. First operand has 38 places, 29 transitions, 178 flow. Second operand 7 states and 138 transitions. [2021-03-25 10:41:48,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 390 flow [2021-03-25 10:41:48,051 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 10:41:48,052 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 264 flow [2021-03-25 10:41:48,052 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 10:41:48,052 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 25 predicate places. [2021-03-25 10:41:48,052 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:48,052 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 264 flow [2021-03-25 10:41:48,053 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 264 flow [2021-03-25 10:41:48,053 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 264 flow [2021-03-25 10:41:48,063 INFO L129 PetriNetUnfolder]: 42/121 cut-off events. [2021-03-25 10:41:48,063 INFO L130 PetriNetUnfolder]: For 154/158 co-relation queries the response was YES. [2021-03-25 10:41:48,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 121 events. 42/121 cut-off events. For 154/158 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 497 event pairs, 6 based on Foata normal form. 3/123 useless extension candidates. Maximal degree in co-relation 369. Up to 35 conditions per place. [2021-03-25 10:41:48,065 INFO L142 LiptonReduction]: Number of co-enabled transitions 208 [2021-03-25 10:41:48,069 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:41:48,069 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:41:48,069 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 10:41:48,072 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 264 flow [2021-03-25 10:41:48,072 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 10:41:48,072 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:48,072 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:48,288 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-03-25 10:41:48,288 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1752726740, now seen corresponding path program 2 times [2021-03-25 10:41:48,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:48,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507857801] [2021-03-25 10:41:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:48,371 INFO L142 QuantifierPusher]: treesize reduction 15, result has 51.6 percent of original size [2021-03-25 10:41:48,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:48,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:41:48,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:48,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:48,439 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:41:48,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,447 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 10:41:48,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507857801] [2021-03-25 10:41:48,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598479470] [2021-03-25 10:41:48,448 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 10:41:48,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 10:41:48,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:41:48,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 10:41:48,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:48,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:48,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:48,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:48,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:48,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:48,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:48,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:48,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:48,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,597 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:48,603 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:48,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:48,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:41:48,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:48,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 10:41:48,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 10:41:48,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,610 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:48,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,611 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:48,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:48,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:48,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:48,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 10:41:48,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 10:41:48,627 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 10:41:48,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:48,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:48,629 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:48,638 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,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 11 treesize of output 10 [2021-03-25 10:41:48,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:48,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:48,659 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:48,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,666 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.0 percent of original size [2021-03-25 10:41:48,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,667 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:48,667 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:24 [2021-03-25 10:41:48,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,703 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.4 percent of original size [2021-03-25 10:41:48,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 10:41:48,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,704 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:48,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:48,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:41:48,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,737 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:48,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:48,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,744 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:48,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:48,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:48,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,746 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:48,747 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:48,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:48,751 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 10:41:48,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:48,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:48,753 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:48,773 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,775 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:48,775 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 10:41:48,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:48,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:48,805 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 10:41:48,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:48,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 10:41:48,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808953884] [2021-03-25 10:41:48,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 10:41:48,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:48,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 10:41:48,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-03-25 10:41:48,820 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2021-03-25 10:41:48,820 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 264 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 10:41:48,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:48,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2021-03-25 10:41:48,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:49,159 INFO L129 PetriNetUnfolder]: 231/391 cut-off events. [2021-03-25 10:41:49,159 INFO L130 PetriNetUnfolder]: For 1007/1024 co-relation queries the response was YES. [2021-03-25 10:41:49,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1631 conditions, 391 events. 231/391 cut-off events. For 1007/1024 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1495 event pairs, 35 based on Foata normal form. 10/400 useless extension candidates. Maximal degree in co-relation 1563. Up to 234 conditions per place. [2021-03-25 10:41:49,162 INFO L132 encePairwiseOnDemand]: 29/36 looper letters, 40 selfloop transitions, 22 changer transitions 1/69 dead transitions. [2021-03-25 10:41:49,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 595 flow [2021-03-25 10:41:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 10:41:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 10:41:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2021-03-25 10:41:49,163 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5753968253968254 [2021-03-25 10:41:49,163 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 145 transitions. [2021-03-25 10:41:49,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 145 transitions. [2021-03-25 10:41:49,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:49,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 145 transitions. [2021-03-25 10:41:49,164 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 10:41:49,165 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 10:41:49,165 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 10:41:49,165 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 264 flow. Second operand 7 states and 145 transitions. [2021-03-25 10:41:49,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 595 flow [2021-03-25 10:41:49,167 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 10:41:49,168 INFO L241 Difference]: Finished difference. Result has 56 places, 48 transitions, 422 flow [2021-03-25 10:41:49,168 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 10:41:49,173 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 33 predicate places. [2021-03-25 10:41:49,173 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:49,174 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 48 transitions, 422 flow [2021-03-25 10:41:49,174 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 48 transitions, 422 flow [2021-03-25 10:41:49,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 48 transitions, 422 flow [2021-03-25 10:41:49,200 INFO L129 PetriNetUnfolder]: 59/155 cut-off events. [2021-03-25 10:41:49,200 INFO L130 PetriNetUnfolder]: For 391/407 co-relation queries the response was YES. [2021-03-25 10:41:49,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 155 events. 59/155 cut-off events. For 391/407 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 643 event pairs, 4 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 551. Up to 42 conditions per place. [2021-03-25 10:41:49,202 INFO L142 LiptonReduction]: Number of co-enabled transitions 284 [2021-03-25 10:41:49,245 INFO L154 LiptonReduction]: Checked pairs total: 12 [2021-03-25 10:41:49,245 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 10:41:49,245 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-03-25 10:41:49,246 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 424 flow [2021-03-25 10:41:49,246 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 10:41:49,247 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:49,247 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:49,460 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:49,461 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:49,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:49,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1029344970, now seen corresponding path program 3 times [2021-03-25 10:41:49,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:49,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928064628] [2021-03-25 10:41:49,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:49,513 INFO L142 QuantifierPusher]: treesize reduction 15, result has 51.6 percent of original size [2021-03-25 10:41:49,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:41:49,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:49,547 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 10:41:49,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 10:41:49,559 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:41:49,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,567 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 10:41:49,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928064628] [2021-03-25 10:41:49,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914383149] [2021-03-25 10:41:49,567 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 10:41:49,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-25 10:41:49,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:41:49,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 10:41:49,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:49,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,618 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,619 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,620 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,641 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:49,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:49,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:41:49,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,643 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:49,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:49,645 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,645 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:49,646 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,646 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:49,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:49,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:49,647 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:49,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:49,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:49,651 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 10:41:49,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:49,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:49,652 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:49,657 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,659 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 10:41:49,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:49,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:49,660 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:49,665 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:49,666 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:49,666 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2021-03-25 10:41:49,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:49,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:49,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:49,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:49,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:49,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:49,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,681 INFO L147 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size 19 [2021-03-25 10:41:49,682 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-25 10:41:49,682 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:49,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:49,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,684 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:49,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:49,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:49,687 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 10:41:49,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:49,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:49,689 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:49,692 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,693 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:49,693 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 10:41:49,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,706 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-25 10:41:49,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 10:41:49,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:49,710 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:49,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:49,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,729 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,730 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:49,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:49,733 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 10:41:49,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:49,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 10:41:49,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862917223] [2021-03-25 10:41:49,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 10:41:49,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:49,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 10:41:49,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 10:41:49,734 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2021-03-25 10:41:49,735 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 424 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 10:41:49,735 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:49,735 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2021-03-25 10:41:49,735 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:49,981 INFO L129 PetriNetUnfolder]: 322/554 cut-off events. [2021-03-25 10:41:49,981 INFO L130 PetriNetUnfolder]: For 2237/2254 co-relation queries the response was YES. [2021-03-25 10:41:49,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 554 events. 322/554 cut-off events. For 2237/2254 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2368 event pairs, 39 based on Foata normal form. 15/569 useless extension candidates. Maximal degree in co-relation 2516. Up to 240 conditions per place. [2021-03-25 10:41:49,985 INFO L132 encePairwiseOnDemand]: 28/37 looper letters, 50 selfloop transitions, 35 changer transitions 1/92 dead transitions. [2021-03-25 10:41:49,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 92 transitions, 920 flow [2021-03-25 10:41:49,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 10:41:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 10:41:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2021-03-25 10:41:49,986 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2021-03-25 10:41:49,986 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 186 transitions. [2021-03-25 10:41:49,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 186 transitions. [2021-03-25 10:41:49,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:49,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 186 transitions. [2021-03-25 10:41:49,987 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 10:41:49,987 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 10:41:49,987 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 10:41:49,988 INFO L185 Difference]: Start difference. First operand has 56 places, 48 transitions, 424 flow. Second operand 9 states and 186 transitions. [2021-03-25 10:41:49,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 92 transitions, 920 flow [2021-03-25 10:41:49,992 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 10:41:49,993 INFO L241 Difference]: Finished difference. Result has 67 places, 62 transitions, 651 flow [2021-03-25 10:41:49,993 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 10:41:49,994 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 44 predicate places. [2021-03-25 10:41:49,994 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:49,994 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 62 transitions, 651 flow [2021-03-25 10:41:49,994 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 62 transitions, 651 flow [2021-03-25 10:41:49,994 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 62 transitions, 651 flow [2021-03-25 10:41:50,008 INFO L129 PetriNetUnfolder]: 94/226 cut-off events. [2021-03-25 10:41:50,008 INFO L130 PetriNetUnfolder]: For 1150/1208 co-relation queries the response was YES. [2021-03-25 10:41:50,009 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 226 events. 94/226 cut-off events. For 1150/1208 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1062 event pairs, 7 based on Foata normal form. 7/220 useless extension candidates. Maximal degree in co-relation 1009. Up to 74 conditions per place. [2021-03-25 10:41:50,011 INFO L142 LiptonReduction]: Number of co-enabled transitions 380 [2021-03-25 10:41:50,109 INFO L154 LiptonReduction]: Checked pairs total: 72 [2021-03-25 10:41:50,109 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 10:41:50,109 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 115 [2021-03-25 10:41:50,110 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 659 flow [2021-03-25 10:41:50,110 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 10:41:50,110 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:50,110 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:50,326 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:50,327 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:50,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:50,327 INFO L82 PathProgramCache]: Analyzing trace with hash -830654624, now seen corresponding path program 4 times [2021-03-25 10:41:50,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:50,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532299828] [2021-03-25 10:41:50,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:50,348 INFO L142 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size [2021-03-25 10:41:50,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,355 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-25 10:41:50,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:50,363 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-25 10:41:50,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:50,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:50,379 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:41:50,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,387 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 10:41:50,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532299828] [2021-03-25 10:41:50,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940736282] [2021-03-25 10:41:50,387 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 10:41:50,437 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-03-25 10:41:50,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:41:50,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 10:41:50,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:50,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,447 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:50,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:50,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:50,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:41:50,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,454 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:50,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:50,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:41:50,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:50,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:50,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:41:50,459 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 10:41:50,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:50,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:50,460 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:50,468 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:50,469 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:50,469 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-03-25 10:41:50,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:50,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:50,484 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 10:41:50,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:41:50,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:50,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:50,487 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 10:41:50,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:50,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,492 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:50,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:41:50,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,509 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:50,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:50,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:41:50,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,511 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:50,511 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:50,512 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:41:50,520 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 10:41:50,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:50,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:50,523 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:50,528 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,529 INFO L142 QuantifierPusher]: treesize reduction -1, result has 104.3 percent of original size [2021-03-25 10:41:50,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,529 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:50,529 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:24 [2021-03-25 10:41:50,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,543 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,547 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,551 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:50,554 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,556 INFO L147 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size 17 [2021-03-25 10:41:50,557 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.8 percent of original size [2021-03-25 10:41:50,558 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:50,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:50,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 10:41:50,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,559 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:50,559 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:50,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 10:41:50,562 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 5 treesize of output 3 [2021-03-25 10:41:50,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:50,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:50,564 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:50,568 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,568 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:50,568 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:12 [2021-03-25 10:41:50,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,582 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:50,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:50,586 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 10:41:50,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:50,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 10:41:50,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268747573] [2021-03-25 10:41:50,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 10:41:50,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:50,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 10:41:50,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 10:41:50,587 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2021-03-25 10:41:50,587 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 10:41:50,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:50,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2021-03-25 10:41:50,587 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:50,769 INFO L129 PetriNetUnfolder]: 359/618 cut-off events. [2021-03-25 10:41:50,769 INFO L130 PetriNetUnfolder]: For 4042/4048 co-relation queries the response was YES. [2021-03-25 10:41:50,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 618 events. 359/618 cut-off events. For 4042/4048 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2812 event pairs, 93 based on Foata normal form. 7/625 useless extension candidates. Maximal degree in co-relation 3305. Up to 506 conditions per place. [2021-03-25 10:41:50,774 INFO L132 encePairwiseOnDemand]: 35/41 looper letters, 71 selfloop transitions, 17 changer transitions 0/94 dead transitions. [2021-03-25 10:41:50,774 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 94 transitions, 1075 flow [2021-03-25 10:41:50,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 10:41:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 10:41:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2021-03-25 10:41:50,775 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5017421602787456 [2021-03-25 10:41:50,775 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 144 transitions. [2021-03-25 10:41:50,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 144 transitions. [2021-03-25 10:41:50,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:50,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 144 transitions. [2021-03-25 10:41:50,775 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 10:41:50,776 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 10:41:50,776 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 10:41:50,777 INFO L185 Difference]: Start difference. First operand has 66 places, 62 transitions, 659 flow. Second operand 7 states and 144 transitions. [2021-03-25 10:41:50,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 94 transitions, 1075 flow [2021-03-25 10:41:50,784 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 10:41:50,787 INFO L241 Difference]: Finished difference. Result has 70 places, 74 transitions, 776 flow [2021-03-25 10:41:50,787 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 10:41:50,787 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 47 predicate places. [2021-03-25 10:41:50,788 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:50,788 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 74 transitions, 776 flow [2021-03-25 10:41:50,788 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 74 transitions, 776 flow [2021-03-25 10:41:50,788 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 74 transitions, 776 flow [2021-03-25 10:41:50,803 INFO L129 PetriNetUnfolder]: 103/259 cut-off events. [2021-03-25 10:41:50,804 INFO L130 PetriNetUnfolder]: For 1358/1416 co-relation queries the response was YES. [2021-03-25 10:41:50,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1251 conditions, 259 events. 103/259 cut-off events. For 1358/1416 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1318 event pairs, 9 based on Foata normal form. 7/261 useless extension candidates. Maximal degree in co-relation 1184. Up to 84 conditions per place. [2021-03-25 10:41:50,807 INFO L142 LiptonReduction]: Number of co-enabled transitions 444 [2021-03-25 10:41:50,929 INFO L154 LiptonReduction]: Checked pairs total: 138 [2021-03-25 10:41:50,929 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 10:41:50,929 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 141 [2021-03-25 10:41:50,930 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 788 flow [2021-03-25 10:41:50,930 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 10:41:50,930 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:50,930 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:51,144 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:51,145 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:51,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:51,145 INFO L82 PathProgramCache]: Analyzing trace with hash 388538190, now seen corresponding path program 1 times [2021-03-25 10:41:51,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:51,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415242821] [2021-03-25 10:41:51,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:51,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:51,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,164 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,171 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 10:41:51,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415242821] [2021-03-25 10:41:51,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575411912] [2021-03-25 10:41:51,171 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:51,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 10:41:51,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:51,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,234 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:51,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:51,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,237 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:51,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:51,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:51,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:51,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:51,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:51,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:51,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:51,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,252 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:51,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:51,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,259 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-25 10:41:51,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,260 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,264 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 10:41:51,264 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:51,264 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-25 10:41:51,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166990932] [2021-03-25 10:41:51,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 10:41:51,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:51,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 10:41:51,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 10:41:51,265 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 47 [2021-03-25 10:41:51,265 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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 10:41:51,265 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:51,265 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 47 [2021-03-25 10:41:51,266 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:51,334 INFO L129 PetriNetUnfolder]: 298/581 cut-off events. [2021-03-25 10:41:51,335 INFO L130 PetriNetUnfolder]: For 3644/3714 co-relation queries the response was YES. [2021-03-25 10:41:51,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2971 conditions, 581 events. 298/581 cut-off events. For 3644/3714 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3021 event pairs, 38 based on Foata normal form. 24/592 useless extension candidates. Maximal degree in co-relation 2837. Up to 216 conditions per place. [2021-03-25 10:41:51,339 INFO L132 encePairwiseOnDemand]: 43/47 looper letters, 42 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2021-03-25 10:41:51,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 1070 flow [2021-03-25 10:41:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 10:41:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 10:41:51,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2021-03-25 10:41:51,340 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7021276595744681 [2021-03-25 10:41:51,340 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 165 transitions. [2021-03-25 10:41:51,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 165 transitions. [2021-03-25 10:41:51,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:51,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 165 transitions. [2021-03-25 10:41:51,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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 10:41:51,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 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 10:41:51,341 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 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 10:41:51,341 INFO L185 Difference]: Start difference. First operand has 70 places, 74 transitions, 788 flow. Second operand 5 states and 165 transitions. [2021-03-25 10:41:51,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 1070 flow [2021-03-25 10:41:51,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 90 transitions, 1020 flow, removed 21 selfloop flow, removed 2 redundant places. [2021-03-25 10:41:51,349 INFO L241 Difference]: Finished difference. Result has 74 places, 77 transitions, 853 flow [2021-03-25 10:41:51,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=740, 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=853, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2021-03-25 10:41:51,349 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 51 predicate places. [2021-03-25 10:41:51,350 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:51,350 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 77 transitions, 853 flow [2021-03-25 10:41:51,350 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 77 transitions, 853 flow [2021-03-25 10:41:51,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 77 transitions, 853 flow [2021-03-25 10:41:51,378 INFO L129 PetriNetUnfolder]: 143/358 cut-off events. [2021-03-25 10:41:51,378 INFO L130 PetriNetUnfolder]: For 2241/2340 co-relation queries the response was YES. [2021-03-25 10:41:51,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 358 events. 143/358 cut-off events. For 2241/2340 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1981 event pairs, 12 based on Foata normal form. 6/351 useless extension candidates. Maximal degree in co-relation 1735. Up to 109 conditions per place. [2021-03-25 10:41:51,382 INFO L142 LiptonReduction]: Number of co-enabled transitions 484 [2021-03-25 10:41:51,427 INFO L154 LiptonReduction]: Checked pairs total: 48 [2021-03-25 10:41:51,428 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 10:41:51,428 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 78 [2021-03-25 10:41:51,428 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 857 flow [2021-03-25 10:41:51,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 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 10:41:51,428 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:51,428 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:51,647 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-03-25 10:41:51,647 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:51,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1715736280, now seen corresponding path program 1 times [2021-03-25 10:41:51,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:51,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649269749] [2021-03-25 10:41:51,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:51,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:51,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,688 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 10:41:51,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649269749] [2021-03-25 10:41:51,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112049607] [2021-03-25 10:41:51,688 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 10:41:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:51,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 10:41:51,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:51,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,776 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:51,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:51,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,778 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:51,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:51,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:51,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,784 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:51,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:51,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,785 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:51,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:51,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,789 INFO L142 QuantifierPusher]: treesize reduction 1, result has 87.5 percent of original size [2021-03-25 10:41:51,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:51,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,792 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:51,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:51,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:51,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:51,800 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-25 10:41:51,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,802 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,802 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:51,805 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:51,806 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 10:41:51,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:51,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2021-03-25 10:41:51,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151643820] [2021-03-25 10:41:51,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 10:41:51,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 10:41:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 10:41:51,808 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 49 [2021-03-25 10:41:51,809 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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 10:41:51,809 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:51,809 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 49 [2021-03-25 10:41:51,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:51,893 INFO L129 PetriNetUnfolder]: 306/612 cut-off events. [2021-03-25 10:41:51,894 INFO L130 PetriNetUnfolder]: For 4171/4310 co-relation queries the response was YES. [2021-03-25 10:41:51,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3260 conditions, 612 events. 306/612 cut-off events. For 4171/4310 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3302 event pairs, 25 based on Foata normal form. 38/631 useless extension candidates. Maximal degree in co-relation 3133. Up to 204 conditions per place. [2021-03-25 10:41:51,899 INFO L132 encePairwiseOnDemand]: 44/49 looper letters, 51 selfloop transitions, 28 changer transitions 0/107 dead transitions. [2021-03-25 10:41:51,899 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 107 transitions, 1294 flow [2021-03-25 10:41:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 10:41:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 10:41:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 276 transitions. [2021-03-25 10:41:51,900 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7040816326530612 [2021-03-25 10:41:51,900 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 276 transitions. [2021-03-25 10:41:51,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 276 transitions. [2021-03-25 10:41:51,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:51,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 276 transitions. [2021-03-25 10:41:51,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 34.5) internal successors, (276), 8 states have internal predecessors, (276), 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 10:41:51,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 49.0) internal successors, (441), 9 states have internal predecessors, (441), 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 10:41:51,901 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 49.0) internal successors, (441), 9 states have internal predecessors, (441), 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 10:41:51,901 INFO L185 Difference]: Start difference. First operand has 74 places, 77 transitions, 857 flow. Second operand 8 states and 276 transitions. [2021-03-25 10:41:51,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 107 transitions, 1294 flow [2021-03-25 10:41:51,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 107 transitions, 1239 flow, removed 19 selfloop flow, removed 3 redundant places. [2021-03-25 10:41:51,914 INFO L241 Difference]: Finished difference. Result has 80 places, 86 transitions, 1011 flow [2021-03-25 10:41:51,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1011, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2021-03-25 10:41:51,915 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 57 predicate places. [2021-03-25 10:41:51,915 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:51,915 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 86 transitions, 1011 flow [2021-03-25 10:41:51,915 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 80 places, 86 transitions, 1011 flow [2021-03-25 10:41:51,917 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 80 places, 86 transitions, 1011 flow [2021-03-25 10:41:51,940 INFO L129 PetriNetUnfolder]: 135/366 cut-off events. [2021-03-25 10:41:51,940 INFO L130 PetriNetUnfolder]: For 2377/2487 co-relation queries the response was YES. [2021-03-25 10:41:51,942 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1903 conditions, 366 events. 135/366 cut-off events. For 2377/2487 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2160 event pairs, 12 based on Foata normal form. 8/367 useless extension candidates. Maximal degree in co-relation 1827. Up to 125 conditions per place. [2021-03-25 10:41:51,945 INFO L142 LiptonReduction]: Number of co-enabled transitions 592 [2021-03-25 10:41:51,953 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:41:51,953 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:41:51,953 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-25 10:41:51,953 INFO L480 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 1011 flow [2021-03-25 10:41:51,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 31.833333333333332) internal successors, (191), 6 states have internal predecessors, (191), 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 10:41:51,954 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:51,954 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:52,168 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:52,168 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash -971127613, now seen corresponding path program 1 times [2021-03-25 10:41:52,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:52,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498564157] [2021-03-25 10:41:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:52,212 INFO L142 QuantifierPusher]: treesize reduction 12, result has 61.3 percent of original size [2021-03-25 10:41:52,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:52,223 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.0 percent of original size [2021-03-25 10:41:52,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 10:41:52,232 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.0 percent of original size [2021-03-25 10:41:52,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 10:41:52,241 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-25 10:41:52,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:52,250 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:41:52,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,258 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 10:41:52,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498564157] [2021-03-25 10:41:52,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854497100] [2021-03-25 10:41:52,258 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:52,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 10:41:52,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:52,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,285 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:52,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,289 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:52,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:52,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:41:52,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,290 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:52,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:52,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:41:52,291 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,291 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:52,292 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:52,292 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:41:52,296 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 10:41:52,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:52,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:52,297 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:52,304 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,305 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:52,305 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-03-25 10:41:52,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,320 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,323 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,324 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,325 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 10:41:52,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:41:52,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,326 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:52,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:52,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 10:41:52,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:52,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:41:52,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:52,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:52,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:41:52,346 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,347 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:52,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:52,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:41:52,351 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 10:41:52,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:52,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:52,352 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:52,357 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:41:52,358 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:52,358 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2021-03-25 10:41:52,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:41:52,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:41:52,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:41:52,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:41:52,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:41:52,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:41:52,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,378 INFO L147 QuantifierPusher]: treesize reduction 4, result has 82.6 percent of original size 19 [2021-03-25 10:41:52,378 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-25 10:41:52,379 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:52,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:52,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:52,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,381 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:52,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:52,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:52,386 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 10:41:52,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:52,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:52,387 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:52,390 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,391 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:52,391 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 10:41:52,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,410 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:52,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:52,413 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 10:41:52,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:52,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 10:41:52,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591638864] [2021-03-25 10:41:52,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 10:41:52,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 10:41:52,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 10:41:52,414 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2021-03-25 10:41:52,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 1011 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 10:41:52,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:52,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2021-03-25 10:41:52,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:52,646 INFO L129 PetriNetUnfolder]: 463/847 cut-off events. [2021-03-25 10:41:52,647 INFO L130 PetriNetUnfolder]: For 6420/6431 co-relation queries the response was YES. [2021-03-25 10:41:52,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4772 conditions, 847 events. 463/847 cut-off events. For 6420/6431 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4476 event pairs, 152 based on Foata normal form. 10/857 useless extension candidates. Maximal degree in co-relation 4602. Up to 694 conditions per place. [2021-03-25 10:41:52,653 INFO L132 encePairwiseOnDemand]: 42/49 looper letters, 88 selfloop transitions, 17 changer transitions 0/111 dead transitions. [2021-03-25 10:41:52,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 111 transitions, 1372 flow [2021-03-25 10:41:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 10:41:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 10:41:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2021-03-25 10:41:52,674 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4402332361516035 [2021-03-25 10:41:52,674 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 151 transitions. [2021-03-25 10:41:52,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 151 transitions. [2021-03-25 10:41:52,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:52,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 151 transitions. [2021-03-25 10:41:52,675 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 10:41:52,676 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 10:41:52,676 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 10:41:52,676 INFO L185 Difference]: Start difference. First operand has 80 places, 86 transitions, 1011 flow. Second operand 7 states and 151 transitions. [2021-03-25 10:41:52,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 111 transitions, 1372 flow [2021-03-25 10:41:52,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 111 transitions, 1302 flow, removed 27 selfloop flow, removed 2 redundant places. [2021-03-25 10:41:52,687 INFO L241 Difference]: Finished difference. Result has 86 places, 90 transitions, 1029 flow [2021-03-25 10:41:52,687 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1029, PETRI_PLACES=86, PETRI_TRANSITIONS=90} [2021-03-25 10:41:52,687 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 63 predicate places. [2021-03-25 10:41:52,688 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:52,688 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 90 transitions, 1029 flow [2021-03-25 10:41:52,688 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 90 transitions, 1029 flow [2021-03-25 10:41:52,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 90 transitions, 1029 flow [2021-03-25 10:41:52,713 INFO L129 PetriNetUnfolder]: 138/369 cut-off events. [2021-03-25 10:41:52,713 INFO L130 PetriNetUnfolder]: For 2307/2396 co-relation queries the response was YES. [2021-03-25 10:41:52,720 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 369 events. 138/369 cut-off events. For 2307/2396 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2174 event pairs, 11 based on Foata normal form. 9/368 useless extension candidates. Maximal degree in co-relation 1773. Up to 111 conditions per place. [2021-03-25 10:41:52,726 INFO L142 LiptonReduction]: Number of co-enabled transitions 618 [2021-03-25 10:41:52,831 INFO L154 LiptonReduction]: Checked pairs total: 65 [2021-03-25 10:41:52,831 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 10:41:52,832 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 144 [2021-03-25 10:41:52,832 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 90 transitions, 1035 flow [2021-03-25 10:41:52,832 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 10:41:52,832 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:52,832 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:53,032 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:53,033 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:53,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:53,033 INFO L82 PathProgramCache]: Analyzing trace with hash -365462914, now seen corresponding path program 5 times [2021-03-25 10:41:53,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:53,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124717417] [2021-03-25 10:41:53,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:53,055 INFO L142 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size [2021-03-25 10:41:53,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,078 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-25 10:41:53,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:53,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:53,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:53,097 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:41:53,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,104 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 10:41:53,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124717417] [2021-03-25 10:41:53,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916679654] [2021-03-25 10:41:53,104 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 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 10:41:53,130 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-03-25 10:41:53,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:41:53,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 10:41:53,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:53,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:53,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:53,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:53,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:53,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:53,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:53,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:53,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,147 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 10:41:53,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:53,148 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:53,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:53,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 10:41:53,154 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:53,154 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:22 [2021-03-25 10:41:53,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 10:41:53,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 10:41:53,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,167 INFO L147 QuantifierPusher]: treesize reduction 2, result has 93.9 percent of original size 31 [2021-03-25 10:41:53,167 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.1 percent of original size [2021-03-25 10:41:53,168 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:53,168 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:53,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:41:53,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,169 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:53,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:53,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:41:53,172 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 10:41:53,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:53,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:53,174 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:53,179 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,179 INFO L142 QuantifierPusher]: treesize reduction -1, result has 104.3 percent of original size [2021-03-25 10:41:53,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,180 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:53,180 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:24 [2021-03-25 10:41:53,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,196 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.4 percent of original size [2021-03-25 10:41:53,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 10:41:53,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:53,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:53,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:41:53,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:53,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:53,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,222 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:53,222 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:53,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:53,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:53,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:53,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:53,227 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 10:41:53,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:53,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,228 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:53,228 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:53,231 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,232 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:53,232 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 10:41:53,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,232 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:53,248 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 10:41:53,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:53,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 10:41:53,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227638722] [2021-03-25 10:41:53,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 10:41:53,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:53,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 10:41:53,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2021-03-25 10:41:53,248 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2021-03-25 10:41:53,249 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 90 transitions, 1035 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 10:41:53,249 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:53,249 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2021-03-25 10:41:53,249 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:53,635 INFO L129 PetriNetUnfolder]: 576/1053 cut-off events. [2021-03-25 10:41:53,635 INFO L130 PetriNetUnfolder]: For 7950/7971 co-relation queries the response was YES. [2021-03-25 10:41:53,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 1053 events. 576/1053 cut-off events. For 7950/7971 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5865 event pairs, 166 based on Foata normal form. 15/1066 useless extension candidates. Maximal degree in co-relation 5645. Up to 717 conditions per place. [2021-03-25 10:41:53,644 INFO L132 encePairwiseOnDemand]: 42/52 looper letters, 103 selfloop transitions, 35 changer transitions 0/144 dead transitions. [2021-03-25 10:41:53,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 144 transitions, 1837 flow [2021-03-25 10:41:53,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 10:41:53,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 10:41:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2021-03-25 10:41:53,645 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.43653846153846154 [2021-03-25 10:41:53,645 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 227 transitions. [2021-03-25 10:41:53,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 227 transitions. [2021-03-25 10:41:53,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:53,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 227 transitions. [2021-03-25 10:41:53,646 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 10:41:53,646 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 10:41:53,646 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 10:41:53,646 INFO L185 Difference]: Start difference. First operand has 86 places, 90 transitions, 1035 flow. Second operand 10 states and 227 transitions. [2021-03-25 10:41:53,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 144 transitions, 1837 flow [2021-03-25 10:41:53,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 144 transitions, 1795 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-25 10:41:53,662 INFO L241 Difference]: Finished difference. Result has 97 places, 108 transitions, 1377 flow [2021-03-25 10:41:53,663 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=993, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1377, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2021-03-25 10:41:53,663 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 74 predicate places. [2021-03-25 10:41:53,663 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:53,663 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 108 transitions, 1377 flow [2021-03-25 10:41:53,663 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 108 transitions, 1377 flow [2021-03-25 10:41:53,664 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 108 transitions, 1377 flow [2021-03-25 10:41:53,691 INFO L129 PetriNetUnfolder]: 174/451 cut-off events. [2021-03-25 10:41:53,691 INFO L130 PetriNetUnfolder]: For 3834/3922 co-relation queries the response was YES. [2021-03-25 10:41:53,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2530 conditions, 451 events. 174/451 cut-off events. For 3834/3922 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2771 event pairs, 13 based on Foata normal form. 12/454 useless extension candidates. Maximal degree in co-relation 2397. Up to 138 conditions per place. [2021-03-25 10:41:53,717 INFO L142 LiptonReduction]: Number of co-enabled transitions 730 [2021-03-25 10:41:53,723 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:41:53,723 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:41:53,723 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-25 10:41:53,723 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 1377 flow [2021-03-25 10:41:53,723 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 10:41:53,723 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:53,723 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:53,937 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-03-25 10:41:53,940 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:53,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:53,940 INFO L82 PathProgramCache]: Analyzing trace with hash 129571036, now seen corresponding path program 1 times [2021-03-25 10:41:53,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:53,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175719873] [2021-03-25 10:41:53,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:53,964 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 10:41:53,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:53,968 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 10:41:53,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:53,972 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 10:41:53,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:53,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:53,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:53,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:53,981 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 10:41:53,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175719873] [2021-03-25 10:41:53,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919917428] [2021-03-25 10:41:53,981 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 10:41:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:54,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2021-03-25 10:41:54,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:54,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:54,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,012 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:54,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:54,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,013 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:54,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:54,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,020 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-25 10:41:54,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:54,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,021 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:54,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:54,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,029 INFO L142 QuantifierPusher]: treesize reduction 11, result has 8.3 percent of original size [2021-03-25 10:41:54,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 10:41:54,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:54,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2021-03-25 10:41:54,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066517752] [2021-03-25 10:41:54,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 10:41:54,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:54,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 10:41:54,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-03-25 10:41:54,036 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 52 [2021-03-25 10:41:54,036 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 1377 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 10:41:54,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:54,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 52 [2021-03-25 10:41:54,036 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:54,235 INFO L129 PetriNetUnfolder]: 715/1300 cut-off events. [2021-03-25 10:41:54,236 INFO L130 PetriNetUnfolder]: For 12854/12860 co-relation queries the response was YES. [2021-03-25 10:41:54,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7911 conditions, 1300 events. 715/1300 cut-off events. For 12854/12860 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7663 event pairs, 60 based on Foata normal form. 11/1311 useless extension candidates. Maximal degree in co-relation 7648. Up to 447 conditions per place. [2021-03-25 10:41:54,247 INFO L132 encePairwiseOnDemand]: 44/52 looper letters, 113 selfloop transitions, 54 changer transitions 0/173 dead transitions. [2021-03-25 10:41:54,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 173 transitions, 2390 flow [2021-03-25 10:41:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 10:41:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 10:41:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2021-03-25 10:41:54,248 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.43653846153846154 [2021-03-25 10:41:54,248 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 227 transitions. [2021-03-25 10:41:54,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 227 transitions. [2021-03-25 10:41:54,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:54,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 227 transitions. [2021-03-25 10:41:54,249 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 10:41:54,250 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 10:41:54,250 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 10:41:54,250 INFO L185 Difference]: Start difference. First operand has 97 places, 108 transitions, 1377 flow. Second operand 10 states and 227 transitions. [2021-03-25 10:41:54,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 173 transitions, 2390 flow [2021-03-25 10:41:54,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 173 transitions, 2189 flow, removed 82 selfloop flow, removed 4 redundant places. [2021-03-25 10:41:54,274 INFO L241 Difference]: Finished difference. Result has 105 places, 122 transitions, 1634 flow [2021-03-25 10:41:54,274 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1634, PETRI_PLACES=105, PETRI_TRANSITIONS=122} [2021-03-25 10:41:54,274 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 82 predicate places. [2021-03-25 10:41:54,274 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:54,274 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 122 transitions, 1634 flow [2021-03-25 10:41:54,274 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 122 transitions, 1634 flow [2021-03-25 10:41:54,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 122 transitions, 1634 flow [2021-03-25 10:41:54,307 INFO L129 PetriNetUnfolder]: 204/538 cut-off events. [2021-03-25 10:41:54,308 INFO L130 PetriNetUnfolder]: For 6367/6851 co-relation queries the response was YES. [2021-03-25 10:41:54,311 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 538 events. 204/538 cut-off events. For 6367/6851 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3485 event pairs, 17 based on Foata normal form. 14/543 useless extension candidates. Maximal degree in co-relation 3146. Up to 165 conditions per place. [2021-03-25 10:41:54,315 INFO L142 LiptonReduction]: Number of co-enabled transitions 912 [2021-03-25 10:41:54,345 INFO L154 LiptonReduction]: Checked pairs total: 47 [2021-03-25 10:41:54,346 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 10:41:54,346 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-03-25 10:41:54,347 INFO L480 AbstractCegarLoop]: Abstraction has has 105 places, 122 transitions, 1636 flow [2021-03-25 10:41:54,347 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 10:41:54,347 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:54,347 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:54,561 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:54,561 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1537781262, now seen corresponding path program 6 times [2021-03-25 10:41:54,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:54,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531681712] [2021-03-25 10:41:54,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:54,597 INFO L142 QuantifierPusher]: treesize reduction 8, result has 66.7 percent of original size [2021-03-25 10:41:54,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,604 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-25 10:41:54,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:41:54,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:54,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:41:54,624 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 10:41:54,624 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 10:41:54,633 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:41:54,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,641 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 10:41:54,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531681712] [2021-03-25 10:41:54,641 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043140047] [2021-03-25 10:41:54,641 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-25 10:41:54,665 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2021-03-25 10:41:54,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:54,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 10:41:54,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:54,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:41:54,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:54,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:41:54,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,677 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:54,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:41:54,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,678 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:54,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:41:54,681 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 10:41:54,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:54,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:54,682 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:54,689 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 10:41:54,690 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:54,690 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2021-03-25 10:41:54,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 10:41:54,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 10:41:54,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,706 INFO L147 QuantifierPusher]: treesize reduction 2, result has 93.3 percent of original size 28 [2021-03-25 10:41:54,706 INFO L142 QuantifierPusher]: treesize reduction 2, result has 93.5 percent of original size [2021-03-25 10:41:54,706 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,707 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:54,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:54,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,708 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:54,709 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:41:54,711 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 10:41:54,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:54,712 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:54,712 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:54,717 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,717 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.5 percent of original size [2021-03-25 10:41:54,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:54,718 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:54,718 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:21 [2021-03-25 10:41:54,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:54,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:54,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:54,731 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:54,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:54,732 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:54,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,733 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:54,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:54,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:54,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,735 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:54,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:54,749 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:54,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:54,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:41:54,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:41:54,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,752 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:54,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:54,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,754 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:41:54,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:41:54,757 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 10:41:54,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:54,758 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:41:54,761 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,762 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:41:54,762 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 10:41:54,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,778 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-25 10:41:54,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 10:41:54,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,779 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:54,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:54,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:41:54,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:54,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:54,800 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 10:41:54,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:54,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2021-03-25 10:41:54,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668447868] [2021-03-25 10:41:54,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-03-25 10:41:54,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:54,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-03-25 10:41:54,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-03-25 10:41:54,801 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2021-03-25 10:41:54,801 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 122 transitions, 1636 flow. Second operand has 13 states, 13 states have (on average 15.461538461538462) internal successors, (201), 13 states have internal predecessors, (201), 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 10:41:54,801 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:54,801 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2021-03-25 10:41:54,802 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:55,292 INFO L129 PetriNetUnfolder]: 879/1591 cut-off events. [2021-03-25 10:41:55,292 INFO L130 PetriNetUnfolder]: For 23187/23198 co-relation queries the response was YES. [2021-03-25 10:41:55,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10745 conditions, 1591 events. 879/1591 cut-off events. For 23187/23198 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9412 event pairs, 226 based on Foata normal form. 16/1607 useless extension candidates. Maximal degree in co-relation 10432. Up to 1016 conditions per place. [2021-03-25 10:41:55,307 INFO L132 encePairwiseOnDemand]: 42/53 looper letters, 134 selfloop transitions, 52 changer transitions 12/204 dead transitions. [2021-03-25 10:41:55,307 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 204 transitions, 3319 flow [2021-03-25 10:41:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 10:41:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 10:41:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 205 transitions. [2021-03-25 10:41:55,308 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.429769392033543 [2021-03-25 10:41:55,309 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 205 transitions. [2021-03-25 10:41:55,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 205 transitions. [2021-03-25 10:41:55,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:55,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 205 transitions. [2021-03-25 10:41:55,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 22.77777777777778) internal successors, (205), 9 states have internal predecessors, (205), 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 10:41:55,310 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 10:41:55,310 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 10:41:55,310 INFO L185 Difference]: Start difference. First operand has 105 places, 122 transitions, 1636 flow. Second operand 9 states and 205 transitions. [2021-03-25 10:41:55,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 204 transitions, 3319 flow [2021-03-25 10:41:55,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 204 transitions, 3033 flow, removed 135 selfloop flow, removed 3 redundant places. [2021-03-25 10:41:55,351 INFO L241 Difference]: Finished difference. Result has 114 places, 146 transitions, 2069 flow [2021-03-25 10:41:55,351 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2069, PETRI_PLACES=114, PETRI_TRANSITIONS=146} [2021-03-25 10:41:55,351 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 91 predicate places. [2021-03-25 10:41:55,352 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:55,352 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 146 transitions, 2069 flow [2021-03-25 10:41:55,352 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 146 transitions, 2069 flow [2021-03-25 10:41:55,353 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 146 transitions, 2069 flow [2021-03-25 10:41:55,403 INFO L129 PetriNetUnfolder]: 299/761 cut-off events. [2021-03-25 10:41:55,403 INFO L130 PetriNetUnfolder]: For 10395/10683 co-relation queries the response was YES. [2021-03-25 10:41:55,407 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 761 events. 299/761 cut-off events. For 10395/10683 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5239 event pairs, 39 based on Foata normal form. 23/754 useless extension candidates. Maximal degree in co-relation 4801. Up to 247 conditions per place. [2021-03-25 10:41:55,413 INFO L142 LiptonReduction]: Number of co-enabled transitions 1048 [2021-03-25 10:41:55,475 INFO L154 LiptonReduction]: Checked pairs total: 162 [2021-03-25 10:41:55,476 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 10:41:55,476 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-03-25 10:41:55,476 INFO L480 AbstractCegarLoop]: Abstraction has has 114 places, 146 transitions, 2075 flow [2021-03-25 10:41:55,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 15.461538461538462) internal successors, (201), 13 states have internal predecessors, (201), 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 10:41:55,476 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:55,476 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:55,693 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-03-25 10:41:55,694 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:55,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1733391314, now seen corresponding path program 1 times [2021-03-25 10:41:55,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:55,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656830790] [2021-03-25 10:41:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:55,710 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 10:41:55,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:55,714 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 10:41:55,714 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:55,718 INFO L142 QuantifierPusher]: treesize reduction 4, result has 69.2 percent of original size [2021-03-25 10:41:55,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:55,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,727 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 10:41:55,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656830790] [2021-03-25 10:41:55,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463524848] [2021-03-25 10:41:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:41:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:55,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 10:41:55,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:55,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,752 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,762 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:55,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:55,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:55,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,763 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:55,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:55,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:55,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:55,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:55,771 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-25 10:41:55,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:55,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,773 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:55,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:55,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:55,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:55,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:55,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:55,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:55,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:55,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:55,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:55,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:55,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:55,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:55,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:55,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:55,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:55,788 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-25 10:41:55,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,791 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,792 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,792 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:55,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:55,796 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 10:41:55,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:55,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-03-25 10:41:55,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893673519] [2021-03-25 10:41:55,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 10:41:55,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:55,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 10:41:55,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 10:41:55,797 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 56 [2021-03-25 10:41:55,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 146 transitions, 2075 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 10:41:55,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:55,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 56 [2021-03-25 10:41:55,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:56,117 INFO L129 PetriNetUnfolder]: 869/1650 cut-off events. [2021-03-25 10:41:56,117 INFO L130 PetriNetUnfolder]: For 21687/21698 co-relation queries the response was YES. [2021-03-25 10:41:56,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10846 conditions, 1650 events. 869/1650 cut-off events. For 21687/21698 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 10720 event pairs, 62 based on Foata normal form. 38/1688 useless extension candidates. Maximal degree in co-relation 10592. Up to 580 conditions per place. [2021-03-25 10:41:56,131 INFO L132 encePairwiseOnDemand]: 49/56 looper letters, 140 selfloop transitions, 64 changer transitions 5/215 dead transitions. [2021-03-25 10:41:56,131 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 215 transitions, 3216 flow [2021-03-25 10:41:56,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-25 10:41:56,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-25 10:41:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 251 transitions. [2021-03-25 10:41:56,132 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.4074675324675325 [2021-03-25 10:41:56,132 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 251 transitions. [2021-03-25 10:41:56,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 251 transitions. [2021-03-25 10:41:56,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:56,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 251 transitions. [2021-03-25 10:41:56,133 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 10:41:56,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 56.0) internal successors, (672), 12 states have internal predecessors, (672), 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 10:41:56,134 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 56.0) internal successors, (672), 12 states have internal predecessors, (672), 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 10:41:56,134 INFO L185 Difference]: Start difference. First operand has 114 places, 146 transitions, 2075 flow. Second operand 11 states and 251 transitions. [2021-03-25 10:41:56,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 215 transitions, 3216 flow [2021-03-25 10:41:56,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 215 transitions, 3023 flow, removed 84 selfloop flow, removed 3 redundant places. [2021-03-25 10:41:56,180 INFO L241 Difference]: Finished difference. Result has 123 places, 142 transitions, 2064 flow [2021-03-25 10:41:56,180 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2064, PETRI_PLACES=123, PETRI_TRANSITIONS=142} [2021-03-25 10:41:56,180 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 100 predicate places. [2021-03-25 10:41:56,180 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:56,180 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 142 transitions, 2064 flow [2021-03-25 10:41:56,180 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 142 transitions, 2064 flow [2021-03-25 10:41:56,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 142 transitions, 2064 flow [2021-03-25 10:41:56,231 INFO L129 PetriNetUnfolder]: 282/730 cut-off events. [2021-03-25 10:41:56,231 INFO L130 PetriNetUnfolder]: For 10625/10982 co-relation queries the response was YES. [2021-03-25 10:41:56,234 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4799 conditions, 730 events. 282/730 cut-off events. For 10625/10982 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5148 event pairs, 43 based on Foata normal form. 25/730 useless extension candidates. Maximal degree in co-relation 4667. Up to 243 conditions per place. [2021-03-25 10:41:56,240 INFO L142 LiptonReduction]: Number of co-enabled transitions 1030 [2021-03-25 10:41:56,319 INFO L154 LiptonReduction]: Checked pairs total: 196 [2021-03-25 10:41:56,319 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-25 10:41:56,319 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 139 [2021-03-25 10:41:56,319 INFO L480 AbstractCegarLoop]: Abstraction has has 123 places, 142 transitions, 2072 flow [2021-03-25 10:41:56,319 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 10:41:56,319 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:56,319 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:56,533 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-03-25 10:41:56,534 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:56,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:56,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1413701222, now seen corresponding path program 1 times [2021-03-25 10:41:56,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:56,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855451200] [2021-03-25 10:41:56,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:56,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:56,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,577 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 10:41:56,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855451200] [2021-03-25 10:41:56,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920584353] [2021-03-25 10:41:56,577 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 10:41:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:56,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 10:41:56,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:56,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,638 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:41:56,655 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,657 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:56,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:56,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:56,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,658 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:56,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,658 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:56,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:56,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:56,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,668 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:56,668 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:56,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:56,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,669 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:56,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:56,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:56,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,671 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:56,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:56,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:56,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,672 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:56,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:56,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:56,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:56,685 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-25 10:41:56,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:56,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:56,692 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 10:41:56,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:56,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2021-03-25 10:41:56,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220183415] [2021-03-25 10:41:56,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 10:41:56,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 10:41:56,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-03-25 10:41:56,693 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2021-03-25 10:41:56,693 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 142 transitions, 2072 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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 10:41:56,693 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:56,693 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2021-03-25 10:41:56,693 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:57,378 INFO L129 PetriNetUnfolder]: 2120/3677 cut-off events. [2021-03-25 10:41:57,378 INFO L130 PetriNetUnfolder]: For 69749/69760 co-relation queries the response was YES. [2021-03-25 10:41:57,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26912 conditions, 3677 events. 2120/3677 cut-off events. For 69749/69760 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 24500 event pairs, 140 based on Foata normal form. 43/3720 useless extension candidates. Maximal degree in co-relation 26412. Up to 1232 conditions per place. [2021-03-25 10:41:57,413 INFO L132 encePairwiseOnDemand]: 28/60 looper letters, 263 selfloop transitions, 263 changer transitions 7/539 dead transitions. [2021-03-25 10:41:57,413 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 539 transitions, 9360 flow [2021-03-25 10:41:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-25 10:41:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-25 10:41:57,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 372 transitions. [2021-03-25 10:41:57,414 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.3875 [2021-03-25 10:41:57,414 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 372 transitions. [2021-03-25 10:41:57,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 372 transitions. [2021-03-25 10:41:57,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:57,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 372 transitions. [2021-03-25 10:41:57,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 23.25) internal successors, (372), 16 states have internal predecessors, (372), 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 10:41:57,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 60.0) internal successors, (1020), 17 states have internal predecessors, (1020), 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 10:41:57,416 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 60.0) internal successors, (1020), 17 states have internal predecessors, (1020), 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 10:41:57,416 INFO L185 Difference]: Start difference. First operand has 123 places, 142 transitions, 2072 flow. Second operand 16 states and 372 transitions. [2021-03-25 10:41:57,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 539 transitions, 9360 flow [2021-03-25 10:41:57,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 539 transitions, 8647 flow, removed 133 selfloop flow, removed 8 redundant places. [2021-03-25 10:41:57,541 INFO L241 Difference]: Finished difference. Result has 141 places, 356 transitions, 6184 flow [2021-03-25 10:41:57,541 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=6184, PETRI_PLACES=141, PETRI_TRANSITIONS=356} [2021-03-25 10:41:57,541 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 118 predicate places. [2021-03-25 10:41:57,541 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:41:57,542 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 356 transitions, 6184 flow [2021-03-25 10:41:57,542 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 356 transitions, 6184 flow [2021-03-25 10:41:57,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 141 places, 356 transitions, 6184 flow [2021-03-25 10:41:57,815 INFO L129 PetriNetUnfolder]: 1229/2535 cut-off events. [2021-03-25 10:41:57,815 INFO L130 PetriNetUnfolder]: For 60953/62771 co-relation queries the response was YES. [2021-03-25 10:41:57,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19910 conditions, 2535 events. 1229/2535 cut-off events. For 60953/62771 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 19677 event pairs, 114 based on Foata normal form. 165/2580 useless extension candidates. Maximal degree in co-relation 19548. Up to 826 conditions per place. [2021-03-25 10:41:57,852 INFO L142 LiptonReduction]: Number of co-enabled transitions 1712 [2021-03-25 10:41:57,869 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:41:57,869 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:41:57,869 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 328 [2021-03-25 10:41:57,870 INFO L480 AbstractCegarLoop]: Abstraction has has 141 places, 356 transitions, 6184 flow [2021-03-25 10:41:57,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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 10:41:57,870 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:41:57,870 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:41:58,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-03-25 10:41:58,080 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:41:58,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:41:58,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2026516365, now seen corresponding path program 1 times [2021-03-25 10:41:58,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:41:58,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813121896] [2021-03-25 10:41:58,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:41:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:58,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:58,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,128 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,140 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 10:41:58,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813121896] [2021-03-25 10:41:58,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881332747] [2021-03-25 10:41:58,141 INFO L95 rtionOrderModulation]: Keeping assertion order 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 10:41:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:41:58,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-25 10:41:58,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:41:58,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:58,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,176 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:58,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:41:58,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:41:58,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,178 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:41:58,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:58,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:58,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:58,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:58,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:58,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:58,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,196 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:58,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:58,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:58,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,200 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:58,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:41:58,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:41:58,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,201 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,205 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,205 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,207 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,210 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:58,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:58,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:58,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,212 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:41:58,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:41:58,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:41:58,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:41:58,213 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-25 10:41:58,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,219 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:41:58,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:41:58,220 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 10:41:58,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:41:58,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-03-25 10:41:58,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207424285] [2021-03-25 10:41:58,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 10:41:58,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:41:58,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 10:41:58,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 10:41:58,222 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 60 [2021-03-25 10:41:58,222 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 356 transitions, 6184 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 10:41:58,223 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:41:58,223 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 60 [2021-03-25 10:41:58,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:41:59,744 INFO L129 PetriNetUnfolder]: 4877/8589 cut-off events. [2021-03-25 10:41:59,744 INFO L130 PetriNetUnfolder]: For 211188/211194 co-relation queries the response was YES. [2021-03-25 10:41:59,784 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75541 conditions, 8589 events. 4877/8589 cut-off events. For 211188/211194 co-relation queries the response was YES. Maximal size of possible extension queue 697. Compared 65038 event pairs, 464 based on Foata normal form. 207/8796 useless extension candidates. Maximal degree in co-relation 74667. Up to 2909 conditions per place. [2021-03-25 10:41:59,913 INFO L132 encePairwiseOnDemand]: 31/60 looper letters, 526 selfloop transitions, 311 changer transitions 1/844 dead transitions. [2021-03-25 10:41:59,913 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 844 transitions, 17063 flow [2021-03-25 10:41:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 10:41:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 10:41:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 223 transitions. [2021-03-25 10:41:59,928 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.412962962962963 [2021-03-25 10:41:59,928 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 223 transitions. [2021-03-25 10:41:59,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 223 transitions. [2021-03-25 10:41:59,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:41:59,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 223 transitions. [2021-03-25 10:41:59,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 states have internal predecessors, (223), 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 10:41:59,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 60.0) internal successors, (600), 10 states have internal predecessors, (600), 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 10:41:59,930 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 60.0) internal successors, (600), 10 states have internal predecessors, (600), 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 10:41:59,930 INFO L185 Difference]: Start difference. First operand has 141 places, 356 transitions, 6184 flow. Second operand 9 states and 223 transitions. [2021-03-25 10:41:59,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 844 transitions, 17063 flow [2021-03-25 10:42:00,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 844 transitions, 16562 flow, removed 247 selfloop flow, removed 3 redundant places. [2021-03-25 10:42:00,634 INFO L241 Difference]: Finished difference. Result has 152 places, 545 transitions, 10860 flow [2021-03-25 10:42:00,634 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=5917, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10860, PETRI_PLACES=152, PETRI_TRANSITIONS=545} [2021-03-25 10:42:00,634 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 129 predicate places. [2021-03-25 10:42:00,634 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:42:00,634 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 545 transitions, 10860 flow [2021-03-25 10:42:00,634 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 545 transitions, 10860 flow [2021-03-25 10:42:00,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 152 places, 545 transitions, 10860 flow [2021-03-25 10:42:00,995 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[][457], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 15#L46-1true, 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 17#L34-1true, 146#true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), 23#L23-1true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), Black: 69#(= p l), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 404#(<= N i), 585#true, 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N))]) [2021-03-25 10:42:00,996 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is cut-off event [2021-03-25 10:42:00,996 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:00,996 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:00,996 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:01,080 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][75], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), 515#true, Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 403#(<= k i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), 590#(<= N (+ i 1)), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 76#(<= (+ i 1) N), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N))]) [2021-03-25 10:42:01,080 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 10:42:01,080 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:01,081 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:01,081 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:01,391 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][75], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 15#L46-1true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), 590#(<= N (+ i 1)), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 76#(<= (+ i 1) N), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N))]) [2021-03-25 10:42:01,391 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:01,391 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:01,391 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:01,391 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:01,391 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= v_asum_11 (+ (select v_A_11 v_i_16) v_asum_12)) (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19)) InVars {A=v_A_11, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_11, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][420], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), 515#true, Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 10#L63true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 399#true, 15#L46-1true, Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 789#(<= (+ l 1) N), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), 23#L23-1true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 403#(<= k i), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, 585#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N))]) [2021-03-25 10:42:01,391 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:01,391 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:01,391 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:01,391 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:01,818 INFO L129 PetriNetUnfolder]: 3420/6852 cut-off events. [2021-03-25 10:42:01,818 INFO L130 PetriNetUnfolder]: For 195474/199043 co-relation queries the response was YES. [2021-03-25 10:42:01,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60498 conditions, 6852 events. 3420/6852 cut-off events. For 195474/199043 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 59333 event pairs, 254 based on Foata normal form. 343/6880 useless extension candidates. Maximal degree in co-relation 59783. Up to 2363 conditions per place. [2021-03-25 10:42:01,980 INFO L142 LiptonReduction]: Number of co-enabled transitions 2560 [2021-03-25 10:42:02,055 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:42:02,055 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:42:02,055 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1421 [2021-03-25 10:42:02,056 INFO L480 AbstractCegarLoop]: Abstraction has has 152 places, 545 transitions, 10860 flow [2021-03-25 10:42:02,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 states have internal predecessors, (117), 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 10:42:02,056 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:42:02,056 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:42:02,270 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-03-25 10:42:02,271 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:42:02,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:42:02,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2121670856, now seen corresponding path program 7 times [2021-03-25 10:42:02,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:42:02,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374119461] [2021-03-25 10:42:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:42:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:42:02,339 INFO L142 QuantifierPusher]: treesize reduction 19, result has 50.0 percent of original size [2021-03-25 10:42:02,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:42:02,352 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.7 percent of original size [2021-03-25 10:42:02,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:42:02,360 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-25 10:42:02,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:42:02,372 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-25 10:42:02,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:42:02,394 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:42:02,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,402 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 10:42:02,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374119461] [2021-03-25 10:42:02,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373371046] [2021-03-25 10:42:02,402 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-03-25 10:42:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:42:02,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-03-25 10:42:02,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:42:02,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:42:02,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,460 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,460 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,464 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,465 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:02,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,466 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:02,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:02,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 10:42:02,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:02,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:02,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 10:42:02,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,485 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:02,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:02,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 10:42:02,489 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 10:42:02,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:02,490 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:02,490 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:42:02,497 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,497 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,498 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:42:02,498 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:25 [2021-03-25 10:42:02,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,532 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,534 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,535 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-03-25 10:42:02,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,540 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:02,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 10:42:02,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:42:02,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,541 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:02,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 10:42:02,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:42:02,545 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 10:42:02,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:42:02,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:42:02,546 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:42:02,551 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,552 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:42:02,552 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:42:02,552 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2021-03-25 10:42:02,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:42:02,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:42:02,583 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-03-25 10:42:02,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:42:02,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,585 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:02,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:42:02,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:42:02,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:42:02,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:42:02,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:42:02,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,601 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:02,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:42:02,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:42:02,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,602 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:02,602 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:42:02,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:42:02,605 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 10:42:02,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:02,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:02,606 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:42:02,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,614 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:42:02,614 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 10:42:02,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,640 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:02,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:02,641 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 10:42:02,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:42:02,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 10:42:02,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546965589] [2021-03-25 10:42:02,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 10:42:02,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:42:02,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 10:42:02,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-03-25 10:42:02,642 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2021-03-25 10:42:02,642 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 545 transitions, 10860 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 10:42:02,642 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:42:02,642 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2021-03-25 10:42:02,642 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:42:04,905 INFO L129 PetriNetUnfolder]: 5095/8918 cut-off events. [2021-03-25 10:42:04,905 INFO L130 PetriNetUnfolder]: For 272850/272864 co-relation queries the response was YES. [2021-03-25 10:42:04,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86745 conditions, 8918 events. 5095/8918 cut-off events. For 272850/272864 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 67627 event pairs, 855 based on Foata normal form. 24/8942 useless extension candidates. Maximal degree in co-relation 85700. Up to 7714 conditions per place. [2021-03-25 10:42:05,007 INFO L132 encePairwiseOnDemand]: 52/60 looper letters, 562 selfloop transitions, 67 changer transitions 16/651 dead transitions. [2021-03-25 10:42:05,008 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 651 transitions, 14139 flow [2021-03-25 10:42:05,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 10:42:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 10:42:05,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 159 transitions. [2021-03-25 10:42:05,009 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.37857142857142856 [2021-03-25 10:42:05,009 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 159 transitions. [2021-03-25 10:42:05,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 159 transitions. [2021-03-25 10:42:05,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:42:05,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 159 transitions. [2021-03-25 10:42:05,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 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 10:42:05,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 60.0) internal successors, (480), 8 states have internal predecessors, (480), 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 10:42:05,010 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 60.0) internal successors, (480), 8 states have internal predecessors, (480), 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 10:42:05,010 INFO L185 Difference]: Start difference. First operand has 152 places, 545 transitions, 10860 flow. Second operand 7 states and 159 transitions. [2021-03-25 10:42:05,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 651 transitions, 14139 flow [2021-03-25 10:42:05,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 651 transitions, 13922 flow, removed 103 selfloop flow, removed 1 redundant places. [2021-03-25 10:42:05,814 INFO L241 Difference]: Finished difference. Result has 160 places, 583 transitions, 11537 flow [2021-03-25 10:42:05,814 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=10665, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=11537, PETRI_PLACES=160, PETRI_TRANSITIONS=583} [2021-03-25 10:42:05,815 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 137 predicate places. [2021-03-25 10:42:05,815 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:42:05,815 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 583 transitions, 11537 flow [2021-03-25 10:42:05,815 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 583 transitions, 11537 flow [2021-03-25 10:42:05,819 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 160 places, 583 transitions, 11537 flow [2021-03-25 10:42:06,278 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[][484], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), 515#true, Black: 604#(<= k (+ i 1)), 645#true, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, 15#L46-1true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 17#L34-1true, 146#true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, 585#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:06,278 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 10:42:06,279 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:06,279 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:06,279 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:06,309 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][82], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), 590#(<= N (+ i 1)), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:06,309 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 10:42:06,309 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:06,309 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:06,309 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:06,507 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= v_asum_11 (+ (select v_A_11 v_i_16) v_asum_12)) (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19)) InVars {A=v_A_11, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_11, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][124], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 779#(and (<= N i) (<= k (+ i 1))), 399#true, 15#L46-1true, Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 789#(<= (+ l 1) N), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), 23#L23-1true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), Black: 69#(= p l), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, 585#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:06,507 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:06,507 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:06,507 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:06,507 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:06,507 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][82], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), 515#true, Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 15#L46-1true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 403#(<= k i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), 590#(<= N (+ i 1)), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 76#(<= (+ i 1) N), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:06,507 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:06,507 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:06,507 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:06,507 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:06,727 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= v_asum_11 (+ (select v_A_11 v_i_16) v_asum_12)) (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19)) InVars {A=v_A_11, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_11, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][124], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), 515#true, Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 10#L63true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 404#(<= N i), 585#true, 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 76#(<= (+ i 1) N), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:06,727 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:42:06,727 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:42:06,727 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:06,727 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:42:06,728 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][243], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), 515#true, Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 403#(<= k i), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), 590#(<= N (+ i 1)), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 76#(<= (+ i 1) N), 210#true, 83#true, Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:06,728 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:42:06,728 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:42:06,728 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:06,728 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:42:06,976 INFO L129 PetriNetUnfolder]: 3577/7170 cut-off events. [2021-03-25 10:42:06,976 INFO L130 PetriNetUnfolder]: For 206021/209309 co-relation queries the response was YES. [2021-03-25 10:42:07,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64258 conditions, 7170 events. 3577/7170 cut-off events. For 206021/209309 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 62387 event pairs, 265 based on Foata normal form. 397/7260 useless extension candidates. Maximal degree in co-relation 63385. Up to 2490 conditions per place. [2021-03-25 10:42:07,091 INFO L142 LiptonReduction]: Number of co-enabled transitions 2636 [2021-03-25 10:42:07,131 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:42:07,132 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:42:07,132 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1317 [2021-03-25 10:42:07,132 INFO L480 AbstractCegarLoop]: Abstraction has has 160 places, 583 transitions, 11537 flow [2021-03-25 10:42:07,132 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 10:42:07,132 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:42:07,132 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:42:07,347 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:42:07,347 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:42:07,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:42:07,347 INFO L82 PathProgramCache]: Analyzing trace with hash 348545790, now seen corresponding path program 2 times [2021-03-25 10:42:07,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:42:07,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886008187] [2021-03-25 10:42:07,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:42:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:42:07,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:42:07,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:07,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,369 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 10:42:07,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886008187] [2021-03-25 10:42:07,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166619286] [2021-03-25 10:42:07,370 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 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 10:42:07,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 10:42:07,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:42:07,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 10:42:07,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:42:07,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:07,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:07,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:07,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:07,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:07,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:07,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:07,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:07,411 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:07,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:07,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:07,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:07,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:07,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:42:07,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:07,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,414 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:07,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:42:07,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:07,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:07,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:42:07,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:42:07,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:07,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:42:07,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:42:07,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:07,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:07,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:07,435 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 10:42:07,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:42:07,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2021-03-25 10:42:07,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608035323] [2021-03-25 10:42:07,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 10:42:07,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:42:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 10:42:07,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-03-25 10:42:07,436 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2021-03-25 10:42:07,437 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 583 transitions, 11537 flow. Second operand has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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 10:42:07,437 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:42:07,437 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2021-03-25 10:42:07,437 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:42:11,253 INFO L129 PetriNetUnfolder]: 8075/14193 cut-off events. [2021-03-25 10:42:11,253 INFO L130 PetriNetUnfolder]: For 425695/425723 co-relation queries the response was YES. [2021-03-25 10:42:11,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136705 conditions, 14193 events. 8075/14193 cut-off events. For 425695/425723 co-relation queries the response was YES. Maximal size of possible extension queue 1104. Compared 114801 event pairs, 385 based on Foata normal form. 255/14447 useless extension candidates. Maximal degree in co-relation 135199. Up to 4922 conditions per place. [2021-03-25 10:42:11,402 INFO L132 encePairwiseOnDemand]: 42/60 looper letters, 624 selfloop transitions, 985 changer transitions 15/1630 dead transitions. [2021-03-25 10:42:11,402 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 1630 transitions, 35088 flow [2021-03-25 10:42:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-03-25 10:42:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-03-25 10:42:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 609 transitions. [2021-03-25 10:42:11,403 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.3903846153846154 [2021-03-25 10:42:11,403 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 609 transitions. [2021-03-25 10:42:11,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 609 transitions. [2021-03-25 10:42:11,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:42:11,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 609 transitions. [2021-03-25 10:42:11,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 23.423076923076923) internal successors, (609), 26 states have internal predecessors, (609), 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 10:42:11,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 60.0) internal successors, (1620), 27 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 10:42:11,406 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 60.0) internal successors, (1620), 27 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 10:42:11,406 INFO L185 Difference]: Start difference. First operand has 160 places, 583 transitions, 11537 flow. Second operand 26 states and 609 transitions. [2021-03-25 10:42:11,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 1630 transitions, 35088 flow [2021-03-25 10:42:12,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 1630 transitions, 34810 flow, removed 126 selfloop flow, removed 2 redundant places. [2021-03-25 10:42:12,639 INFO L241 Difference]: Finished difference. Result has 203 places, 1268 transitions, 29737 flow [2021-03-25 10:42:12,639 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=11283, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=358, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=29737, PETRI_PLACES=203, PETRI_TRANSITIONS=1268} [2021-03-25 10:42:12,640 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 180 predicate places. [2021-03-25 10:42:12,640 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:42:12,640 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 203 places, 1268 transitions, 29737 flow [2021-03-25 10:42:12,640 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 203 places, 1268 transitions, 29737 flow [2021-03-25 10:42:12,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 203 places, 1268 transitions, 29737 flow [2021-03-25 10:42:13,408 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[][1000], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 399#true, 15#L46-1true, Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 17#L34-1true, 146#true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 1074#(and (<= p i) (<= l i)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 403#(<= k i), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, 457#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 203#(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))), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1003#(<= l i), 210#true, 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:13,409 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:13,409 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:13,409 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:13,409 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:13,409 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[][883], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 399#true, Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, 457#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 203#(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))), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1003#(<= l i)]) [2021-03-25 10:42:13,409 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:13,409 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:13,409 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:13,409 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:13,429 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[][883], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 10#L63true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 403#(<= k i), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 457#true, 585#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 203#(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))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1003#(<= l i), 210#true, Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:42:13,430 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:13,430 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:13,430 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:13,430 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:13,430 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][636], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 8#thread1EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), 13#L46true, Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 17#L34-1true, 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1088#(and (<= p i) (<= k (+ i 1))), 457#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), 590#(<= N (+ i 1)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 203#(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))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1003#(<= l i), 210#true, 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1004#(<= N i)]) [2021-03-25 10:42:13,430 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:13,430 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:13,430 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:13,430 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:13,627 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[][78], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), 515#true, Black: 604#(<= k (+ i 1)), 645#true, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 15#L46-1true, 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 17#L34-1true, 146#true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), 23#L23-1true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1088#(and (<= p i) (<= k (+ i 1))), 457#true, 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 203#(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))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1003#(<= l i), 210#true, 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:42:13,627 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is not cut-off event [2021-03-25 10:42:13,627 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 10:42:13,627 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-25 10:42:13,627 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-25 10:42:13,882 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1094], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), 515#true, Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 403#(<= k i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), 590#(<= N (+ i 1)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 203#(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))), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 1002#(<= p i), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), 210#true, 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1004#(<= N i)]) [2021-03-25 10:42:13,882 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 10:42:13,882 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:13,882 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:13,883 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:13,912 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[][676], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 789#(<= (+ l 1) N), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 403#(<= k i), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 203#(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))), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), 210#true, Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:42:13,912 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is not cut-off event [2021-03-25 10:42:13,912 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-25 10:42:13,912 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 10:42:13,912 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-25 10:42:13,984 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[][1000], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 399#true, Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 15#L46-1true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 17#L34-1true, 146#true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 1074#(and (<= p i) (<= l i)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 403#(<= k i), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, 457#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 203#(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))), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:13,985 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:13,985 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:13,985 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:13,985 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:13,985 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:13,985 INFO L382 tUnfolder$Statistics]: inserting event number 5 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[][883], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), 515#true, Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 10#L63true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 779#(and (<= N i) (<= k (+ i 1))), 399#true, Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 403#(<= k i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 404#(<= N i), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 203#(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))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1003#(<= l i)]) [2021-03-25 10:42:13,985 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:13,985 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:13,985 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:13,985 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:13,985 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:14,400 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1094], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 13#L46true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), 590#(<= N (+ i 1)), Black: 203#(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))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), 210#true, 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1004#(<= N i)]) [2021-03-25 10:42:14,400 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:14,400 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:14,400 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:14,401 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[][676], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 7#thread2EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 789#(<= (+ l 1) N), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 403#(<= k i), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 404#(<= N i), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), 210#true, Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:42:14,401 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:15,010 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[][300], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 773#(and (<= N i) (<= k i)), 8#thread1EXITtrue, 10#L63true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 15#L46-1true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 17#L34-1true, 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), Black: 69#(= p l), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), 210#true, Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 636#(and (<= k i) (<= N (+ i 1)))]) [2021-03-25 10:42:15,010 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:42:15,011 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 10:42:15,011 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:42:15,011 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:15,011 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[][676], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, 773#(and (<= N i) (<= k i)), 8#thread1EXITtrue, 10#L63true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 17#L34-1true, 146#true, 404#(<= N i), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 282#true, Black: 868#true, 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 870#(= k l), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 403#(<= k i), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 69#(= p l), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 457#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), 210#true, Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 325#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 636#(and (<= k i) (<= N (+ i 1)))]) [2021-03-25 10:42:15,011 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:42:15,011 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:15,011 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 10:42:15,012 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:42:15,843 INFO L129 PetriNetUnfolder]: 6748/12458 cut-off events. [2021-03-25 10:42:15,843 INFO L130 PetriNetUnfolder]: For 537072/541106 co-relation queries the response was YES. [2021-03-25 10:42:15,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 139135 conditions, 12458 events. 6748/12458 cut-off events. For 537072/541106 co-relation queries the response was YES. Maximal size of possible extension queue 1144. Compared 108108 event pairs, 507 based on Foata normal form. 621/12660 useless extension candidates. Maximal degree in co-relation 137790. Up to 4524 conditions per place. [2021-03-25 10:42:16,088 INFO L142 LiptonReduction]: Number of co-enabled transitions 4070 [2021-03-25 10:42:16,278 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:42:16,278 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:42:16,278 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3638 [2021-03-25 10:42:16,278 INFO L480 AbstractCegarLoop]: Abstraction has has 203 places, 1268 transitions, 29737 flow [2021-03-25 10:42:16,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 15.9) internal successors, (159), 10 states have internal predecessors, (159), 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 10:42:16,278 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:42:16,278 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:42:16,493 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:42:16,494 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:42:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:42:16,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1205590562, now seen corresponding path program 8 times [2021-03-25 10:42:16,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:42:16,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305917325] [2021-03-25 10:42:16,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:42:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:42:16,516 INFO L142 QuantifierPusher]: treesize reduction 19, result has 50.0 percent of original size [2021-03-25 10:42:16,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:42:16,529 INFO L142 QuantifierPusher]: treesize reduction 12, result has 70.7 percent of original size [2021-03-25 10:42:16,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:42:16,537 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-25 10:42:16,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 10:42:16,544 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 10:42:16,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 10:42:16,553 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:42:16,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,560 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 10:42:16,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305917325] [2021-03-25 10:42:16,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089431871] [2021-03-25 10:42:16,561 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 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 10:42:16,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 10:42:16,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:42:16,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core [2021-03-25 10:42:16,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:42:16,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:42:16,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,593 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:16,593 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:16,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:42:16,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,594 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:16,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:16,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:42:16,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,596 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:16,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:16,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:42:16,599 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 10:42:16,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:16,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:16,600 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:42:16,609 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,610 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:42:16,610 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:30 [2021-03-25 10:42:16,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,626 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,627 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,628 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,630 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,630 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,631 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,631 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,632 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:42:16,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,633 INFO L147 QuantifierPusher]: treesize reduction 2, result has 94.7 percent of original size 36 [2021-03-25 10:42:16,633 INFO L142 QuantifierPusher]: treesize reduction 2, result has 94.9 percent of original size [2021-03-25 10:42:16,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:16,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:42:16,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:42:16,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:16,635 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:42:16,636 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:42:16,639 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 10:42:16,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:42:16,639 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,640 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:42:16,640 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:42:16,646 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,646 INFO L142 QuantifierPusher]: treesize reduction 3, result has 88.5 percent of original size [2021-03-25 10:42:16,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:42:16,647 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:42:16,647 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:23 [2021-03-25 10:42:16,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,647 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:42:16,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,648 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:42:16,660 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,661 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:42:16,661 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,661 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:16,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:42:16,662 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:42:16,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,663 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:16,663 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:42:16,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:42:16,666 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 10:42:16,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:16,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:16,667 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:42:16,670 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,671 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:42:16,671 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2021-03-25 10:42:16,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,683 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,684 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-25 10:42:16,684 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 10:42:16,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,685 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:16,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:42:16,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:42:16,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,699 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,701 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,701 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,702 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,702 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:16,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:16,705 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 10:42:16,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:42:16,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 10:42:16,706 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726822494] [2021-03-25 10:42:16,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-03-25 10:42:16,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:42:16,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-03-25 10:42:16,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-03-25 10:42:16,706 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2021-03-25 10:42:16,707 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 1268 transitions, 29737 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 10:42:16,707 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:42:16,707 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2021-03-25 10:42:16,707 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:42:23,479 INFO L129 PetriNetUnfolder]: 8986/15507 cut-off events. [2021-03-25 10:42:23,479 INFO L130 PetriNetUnfolder]: For 701260/701277 co-relation queries the response was YES. [2021-03-25 10:42:23,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 187153 conditions, 15507 events. 8986/15507 cut-off events. For 701260/701277 co-relation queries the response was YES. Maximal size of possible extension queue 1214. Compared 125157 event pairs, 1104 based on Foata normal form. 20/15527 useless extension candidates. Maximal degree in co-relation 185594. Up to 12509 conditions per place. [2021-03-25 10:42:23,737 INFO L132 encePairwiseOnDemand]: 50/60 looper letters, 1361 selfloop transitions, 181 changer transitions 12/1560 dead transitions. [2021-03-25 10:42:23,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 1560 transitions, 39915 flow [2021-03-25 10:42:23,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-03-25 10:42:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-03-25 10:42:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 234 transitions. [2021-03-25 10:42:23,740 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.39 [2021-03-25 10:42:23,740 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 234 transitions. [2021-03-25 10:42:23,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 234 transitions. [2021-03-25 10:42:23,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:42:23,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 234 transitions. [2021-03-25 10:42:23,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 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 10:42:23,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 60.0) internal successors, (660), 11 states have internal predecessors, (660), 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 10:42:23,752 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 60.0) internal successors, (660), 11 states have internal predecessors, (660), 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 10:42:23,752 INFO L185 Difference]: Start difference. First operand has 203 places, 1268 transitions, 29737 flow. Second operand 10 states and 234 transitions. [2021-03-25 10:42:23,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 1560 transitions, 39915 flow [2021-03-25 10:42:27,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 1560 transitions, 37597 flow, removed 1154 selfloop flow, removed 2 redundant places. [2021-03-25 10:42:27,380 INFO L241 Difference]: Finished difference. Result has 216 places, 1381 transitions, 31367 flow [2021-03-25 10:42:27,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=27885, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=31367, PETRI_PLACES=216, PETRI_TRANSITIONS=1381} [2021-03-25 10:42:27,381 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 193 predicate places. [2021-03-25 10:42:27,381 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:42:27,381 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 1381 transitions, 31367 flow [2021-03-25 10:42:27,381 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 216 places, 1381 transitions, 31367 flow [2021-03-25 10:42:27,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 216 places, 1381 transitions, 31367 flow [2021-03-25 10:42:27,833 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[][73], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 773#(and (<= N i) (<= k i)), 8#thread1EXITtrue, 10#L63true, Black: 779#(and (<= N i) (<= k (+ i 1))), 15#L46-1true, 17#L34-1true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 453#(and (<= N i) (<= k i)), Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:27,833 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 10:42:27,833 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:27,833 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:27,833 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 10:42:27,833 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[][734], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 773#(and (<= N i) (<= k i)), 8#thread1EXITtrue, 10#L63true, Black: 779#(and (<= N i) (<= k (+ i 1))), 17#L34-1true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 453#(and (<= N i) (<= k i)), Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:27,833 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 10:42:27,833 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:27,833 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 10:42:27,833 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:27,834 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[][380], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 773#(and (<= N i) (<= k i)), 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 453#(and (<= N i) (<= k i)), Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:27,834 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is cut-off event [2021-03-25 10:42:27,834 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:27,834 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:27,834 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 10:42:28,125 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[][1089], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), 15#L46-1true, 17#L34-1true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 1074#(and (<= p i) (<= l i)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:28,125 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:28,125 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:28,125 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:28,125 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:28,125 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[][380], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 7#thread2EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1003#(<= l i)]) [2021-03-25 10:42:28,125 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:28,125 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:28,125 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:28,125 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:28,212 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[][73], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), 15#L46-1true, 17#L34-1true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:42:28,212 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:28,212 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:28,212 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:28,212 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:28,212 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[][380], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 7#thread2EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:42:28,212 INFO L384 tUnfolder$Statistics]: this new event has 15 ancestors and is cut-off event [2021-03-25 10:42:28,212 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:28,212 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:28,212 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:42:28,298 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][700], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 8#thread1EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), 17#L34-1true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), 590#(<= N (+ i 1)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1004#(<= N i)]) [2021-03-25 10:42:28,298 INFO L384 tUnfolder$Statistics]: this new event has 13 ancestors and is not cut-off event [2021-03-25 10:42:28,298 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-25 10:42:28,298 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is not cut-off event [2021-03-25 10:42:28,298 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is not cut-off event [2021-03-25 10:42:28,604 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[][1089], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), 15#L46-1true, 17#L34-1true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 1074#(and (<= p i) (<= l i)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:28,604 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:28,604 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:28,604 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:28,604 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:28,604 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:28,605 INFO L382 tUnfolder$Statistics]: inserting event number 5 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[][380], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 7#thread2EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1003#(<= l i)]) [2021-03-25 10:42:28,605 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:28,605 INFO L387 tUnfolder$Statistics]: existing Event has 11 ancestors and is cut-off event [2021-03-25 10:42:28,605 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:28,605 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:42:28,605 INFO L387 tUnfolder$Statistics]: existing Event has 9 ancestors and is cut-off event [2021-03-25 10:42:28,620 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1205], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), 590#(<= N (+ i 1)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1004#(<= N i)]) [2021-03-25 10:42:28,620 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:28,620 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:28,620 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:28,620 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:28,622 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[][734], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 7#thread2EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 789#(<= (+ l 1) N), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), 1116#true, Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:42:28,622 INFO L384 tUnfolder$Statistics]: this new event has 14 ancestors and is not cut-off event [2021-03-25 10:42:28,622 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-25 10:42:28,622 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is not cut-off event [2021-03-25 10:42:28,622 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is not cut-off event [2021-03-25 10:42:28,733 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[][73], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 773#(and (<= N i) (<= k i)), 8#thread1EXITtrue, 10#L63true, Black: 779#(and (<= N i) (<= k (+ i 1))), 15#L46-1true, 17#L34-1true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 453#(and (<= N i) (<= k i)), Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:28,733 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:28,733 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:28,733 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:28,733 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 10:42:28,733 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:28,733 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[][734], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 773#(and (<= N i) (<= k i)), 8#thread1EXITtrue, 10#L63true, Black: 779#(and (<= N i) (<= k (+ i 1))), 17#L34-1true, Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 453#(and (<= N i) (<= k i)), Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:42:28,733 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:28,733 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:28,733 INFO L387 tUnfolder$Statistics]: existing Event has 12 ancestors and is cut-off event [2021-03-25 10:42:28,733 INFO L387 tUnfolder$Statistics]: existing Event has 10 ancestors and is cut-off event [2021-03-25 10:42:28,733 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:29,073 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1205], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 7#thread2EXITtrue, 8#thread1EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), 590#(<= N (+ i 1)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1004#(<= N i)]) [2021-03-25 10:42:29,074 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:29,074 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:42:29,074 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:29,074 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:29,074 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:29,074 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[][734], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), 515#true, 7#thread2EXITtrue, 10#L63true, Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), 789#(<= (+ l 1) N), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 404#(<= N i), 457#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:42:29,074 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:42:29,074 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:29,074 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:29,074 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:42:29,074 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:42:30,870 INFO L129 PetriNetUnfolder]: 7479/13751 cut-off events. [2021-03-25 10:42:30,870 INFO L130 PetriNetUnfolder]: For 595364/599989 co-relation queries the response was YES. [2021-03-25 10:42:31,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 150373 conditions, 13751 events. 7479/13751 cut-off events. For 595364/599989 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 121239 event pairs, 630 based on Foata normal form. 725/13968 useless extension candidates. Maximal degree in co-relation 148672. Up to 4798 conditions per place. [2021-03-25 10:42:31,220 INFO L142 LiptonReduction]: Number of co-enabled transitions 4414 [2021-03-25 10:42:31,459 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:42:31,460 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:42:31,460 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4079 [2021-03-25 10:42:31,460 INFO L480 AbstractCegarLoop]: Abstraction has has 216 places, 1381 transitions, 31367 flow [2021-03-25 10:42:31,460 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 10:42:31,460 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:42:31,460 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:42:31,676 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:42:31,676 INFO L428 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:42:31,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:42:31,676 INFO L82 PathProgramCache]: Analyzing trace with hash -147549270, now seen corresponding path program 1 times [2021-03-25 10:42:31,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:42:31,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404918943] [2021-03-25 10:42:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:42:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:42:31,687 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 10:42:31,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:42:31,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 10:42:31,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404918943] [2021-03-25 10:42:31,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088289457] [2021-03-25 10:42:31,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 10:42:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:42:31,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 10:42:31,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:42:31,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,756 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,759 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,760 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:31,760 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:31,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:31,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,761 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:31,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,761 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:31,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:31,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,770 INFO L142 QuantifierPusher]: treesize reduction 1, result has 90.0 percent of original size [2021-03-25 10:42:31,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:31,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:31,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:42:31,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:42:31,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,780 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:42:31,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,781 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:31,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:42:31,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:31,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:42:31,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:42:31,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:42:31,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:42:31,784 INFO L142 QuantifierPusher]: treesize reduction 6, result has 14.3 percent of original size [2021-03-25 10:42:31,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,786 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,788 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,789 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:42:31,789 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:42:31,789 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 10:42:31,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:42:31,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2021-03-25 10:42:31,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086720462] [2021-03-25 10:42:31,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-03-25 10:42:31,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:42:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-03-25 10:42:31,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-03-25 10:42:31,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2021-03-25 10:42:31,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 1381 transitions, 31367 flow. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 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 10:42:31,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:42:31,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2021-03-25 10:42:31,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:42:48,132 INFO L129 PetriNetUnfolder]: 20273/35392 cut-off events. [2021-03-25 10:42:48,133 INFO L130 PetriNetUnfolder]: For 1626459/1626465 co-relation queries the response was YES. [2021-03-25 10:42:48,815 INFO L84 FinitePrefix]: Finished finitePrefix Result has 419283 conditions, 35392 events. 20273/35392 cut-off events. For 1626459/1626465 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 318645 event pairs, 677 based on Foata normal form. 885/36277 useless extension candidates. Maximal degree in co-relation 418489. Up to 12135 conditions per place. [2021-03-25 10:42:49,034 INFO L132 encePairwiseOnDemand]: 42/60 looper letters, 2648 selfloop transitions, 2273 changer transitions 196/5123 dead transitions. [2021-03-25 10:42:49,035 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 5123 transitions, 129957 flow [2021-03-25 10:42:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-03-25 10:42:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-03-25 10:42:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 557 transitions. [2021-03-25 10:42:49,036 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.37133333333333335 [2021-03-25 10:42:49,036 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 557 transitions. [2021-03-25 10:42:49,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 557 transitions. [2021-03-25 10:42:49,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:42:49,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 557 transitions. [2021-03-25 10:42:49,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 22.28) internal successors, (557), 25 states have internal predecessors, (557), 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 10:42:49,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 60.0) internal successors, (1560), 26 states have internal predecessors, (1560), 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 10:42:49,040 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 60.0) internal successors, (1560), 26 states have internal predecessors, (1560), 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 10:42:49,040 INFO L185 Difference]: Start difference. First operand has 216 places, 1381 transitions, 31367 flow. Second operand 25 states and 557 transitions. [2021-03-25 10:42:49,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 5123 transitions, 129957 flow [2021-03-25 10:43:04,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 5123 transitions, 128545 flow, removed 688 selfloop flow, removed 3 redundant places. [2021-03-25 10:43:04,910 INFO L241 Difference]: Finished difference. Result has 259 places, 3664 transitions, 100743 flow [2021-03-25 10:43:04,911 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=28316, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=488, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=100743, PETRI_PLACES=259, PETRI_TRANSITIONS=3664} [2021-03-25 10:43:04,911 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 236 predicate places. [2021-03-25 10:43:04,911 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:43:04,911 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 259 places, 3664 transitions, 100743 flow [2021-03-25 10:43:04,911 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 259 places, 3664 transitions, 100743 flow [2021-03-25 10:43:04,952 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 246 places, 3664 transitions, 100743 flow [2021-03-25 10:43:10,520 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1320], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), 7#thread2EXITtrue, Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), 590#(<= N (+ i 1)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:43:10,521 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:43:10,521 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:43:10,521 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:43:10,521 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:43:10,521 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[][2802], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), 7#thread2EXITtrue, Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), 789#(<= (+ l 1) N), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:43:10,521 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:43:10,521 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:43:10,521 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:43:10,521 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:43:12,624 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1320], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), 590#(<= N (+ i 1)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:43:12,624 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:43:12,624 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:43:12,624 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:43:12,624 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:43:12,624 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[][2802], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), 789#(<= (+ l 1) N), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 282#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 399#true, Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:43:12,624 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:43:12,624 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:43:12,624 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:43:12,624 INFO L387 tUnfolder$Statistics]: existing Event has 13 ancestors and is cut-off event [2021-03-25 10:43:20,933 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[][2912], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), 773#(and (<= N i) (<= k i)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), 15#L46-1true, Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), 17#L34-1true, Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), 83#true, Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), 873#(<= (+ l 1) N), 636#(and (<= k i) (<= N (+ i 1))), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1193#(<= k (+ l 1)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:43:20,933 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 10:43:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 10:43:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:43:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 10:43:20,933 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[][2802], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 490#(and (= i asum) (= i 0) (<= N (+ i 1)) (< i N) (= (+ i (select A i) 1) csum)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), 773#(and (<= N i) (<= k i)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), 17#L34-1true, Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 275#(and (< 0 N) (= csum (+ asum 1)) (<= N 1) (<= i 1)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 576#(and (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 578#(and (< csum N) (<= i (+ csum 1)) (= l 0) (<= N (+ csum 1)) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 564#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1088#(and (<= p i) (<= k (+ i 1))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1092#(and (<= p i) (<= N i) (<= k (+ i 1))), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1094#(and (<= p i) (<= N i)), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), 83#true, Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), 873#(<= (+ l 1) N), 636#(and (<= k i) (<= N (+ i 1))), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 132#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 119#(and (= (+ asum 1) (select C 0)) (< 0 N) (= l 0) (<= N 1) (= csum 0)), 146#true, 404#(<= N i), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 1177#(and (= i asum) (= i 0) (<= k (+ i 1)) (<= (+ l i (select A i)) csum) (< i N) (= (+ i (select A i) 1) csum)), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1193#(<= k (+ l 1)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 712#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), Black: 205#(and (= l 0) (<= i (+ l 1)) (<= N (+ l 1)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum)) (= (+ l (select C l)) (+ asum 1))), Black: 189#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 993#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (<= N 1) (= (+ (select A 0) 1) csum)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:43:20,933 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 10:43:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is cut-off event [2021-03-25 10:43:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 10:43:20,933 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:43:23,183 INFO L129 PetriNetUnfolder]: 16834/30625 cut-off events. [2021-03-25 10:43:23,183 INFO L130 PetriNetUnfolder]: For 2035746/2048238 co-relation queries the response was YES. [2021-03-25 10:43:23,727 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392849 conditions, 30625 events. 16834/30625 cut-off events. For 2035746/2048238 co-relation queries the response was YES. Maximal size of possible extension queue 2309. Compared 291823 event pairs, 1021 based on Foata normal form. 2192/32129 useless extension candidates. Maximal degree in co-relation 392577. Up to 10879 conditions per place. [2021-03-25 10:43:24,305 INFO L142 LiptonReduction]: Number of co-enabled transitions 8614 [2021-03-25 10:43:25,969 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:43:25,969 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:43:25,969 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21058 [2021-03-25 10:43:25,969 INFO L480 AbstractCegarLoop]: Abstraction has has 246 places, 3664 transitions, 100743 flow [2021-03-25 10:43:25,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 9 states have internal predecessors, (143), 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 10:43:25,969 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:43:25,969 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:43:26,183 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-03-25 10:43:26,184 INFO L428 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:43:26,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:43:26,184 INFO L82 PathProgramCache]: Analyzing trace with hash 584105453, now seen corresponding path program 1 times [2021-03-25 10:43:26,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:43:26,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164839560] [2021-03-25 10:43:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:43:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:43:26,213 INFO L142 QuantifierPusher]: treesize reduction 8, result has 46.7 percent of original size [2021-03-25 10:43:26,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:43:26,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:43:26,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:43:26,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:43:26,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:43:26,223 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:43:26,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:43:26,227 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:43:26,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:43:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 10:43:26,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164839560] [2021-03-25 10:43:26,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 10:43:26,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 10:43:26,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148157036] [2021-03-25 10:43:26,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 10:43:26,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:43:26,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 10:43:26,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 10:43:26,228 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2021-03-25 10:43:26,228 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 3664 transitions, 100743 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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 10:43:26,228 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:43:26,228 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2021-03-25 10:43:26,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:43:58,581 INFO L129 PetriNetUnfolder]: 14435/25638 cut-off events. [2021-03-25 10:43:58,582 INFO L130 PetriNetUnfolder]: For 1767411/1767417 co-relation queries the response was YES. [2021-03-25 10:43:59,088 INFO L84 FinitePrefix]: Finished finitePrefix Result has 348820 conditions, 25638 events. 14435/25638 cut-off events. For 1767411/1767417 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 218992 event pairs, 899 based on Foata normal form. 1654/27292 useless extension candidates. Maximal degree in co-relation 348697. Up to 15133 conditions per place. [2021-03-25 10:43:59,230 INFO L132 encePairwiseOnDemand]: 48/60 looper letters, 2071 selfloop transitions, 742 changer transitions 160/2980 dead transitions. [2021-03-25 10:43:59,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 2980 transitions, 89497 flow [2021-03-25 10:43:59,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 10:43:59,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 10:43:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2021-03-25 10:43:59,231 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.40555555555555556 [2021-03-25 10:43:59,231 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 146 transitions. [2021-03-25 10:43:59,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 146 transitions. [2021-03-25 10:43:59,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:43:59,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 146 transitions. [2021-03-25 10:43:59,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.333333333333332) internal successors, (146), 6 states have internal predecessors, (146), 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 10:43:59,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 60.0) internal successors, (420), 7 states have internal predecessors, (420), 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 10:43:59,233 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 60.0) internal successors, (420), 7 states have internal predecessors, (420), 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 10:43:59,233 INFO L185 Difference]: Start difference. First operand has 246 places, 3664 transitions, 100743 flow. Second operand 6 states and 146 transitions. [2021-03-25 10:43:59,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 2980 transitions, 89497 flow [2021-03-25 10:44:10,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 2980 transitions, 79087 flow, removed 4887 selfloop flow, removed 19 redundant places. [2021-03-25 10:44:10,896 INFO L241 Difference]: Finished difference. Result has 231 places, 2632 transitions, 68440 flow [2021-03-25 10:44:10,897 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=58649, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=463, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=68440, PETRI_PLACES=231, PETRI_TRANSITIONS=2632} [2021-03-25 10:44:10,897 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 208 predicate places. [2021-03-25 10:44:10,898 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:44:10,898 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 2632 transitions, 68440 flow [2021-03-25 10:44:10,898 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 231 places, 2632 transitions, 68440 flow [2021-03-25 10:44:10,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 228 places, 2632 transitions, 68440 flow [2021-03-25 10:44:13,550 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][874], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:44:13,550 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:44:13,550 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:44:13,550 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:13,550 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:44:13,551 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[][611], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), 789#(<= (+ l 1) N), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 399#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:44:13,551 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:44:13,551 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:44:13,551 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:13,551 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:44:13,723 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][874], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:44:13,724 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:44:13,724 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:44:13,724 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:13,724 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:44:13,724 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:44:13,724 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[][611], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), 789#(<= (+ l 1) N), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 1002#(<= p i), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 399#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:44:13,724 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is cut-off event [2021-03-25 10:44:13,724 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:44:13,724 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:13,724 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:44:13,724 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:44:14,857 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([101] L23-1-->L23-1: Formula: (and (= v_asum_11 (+ (select v_A_11 v_i_16) v_asum_12)) (= (+ v_i_16 1) v_i_15) (< v_i_16 v_N_19)) InVars {A=v_A_11, N=v_N_19, i=v_i_16, asum=v_asum_12} OutVars{A=v_A_11, N=v_N_19, i=v_i_15, asum=v_asum_11} AuxVars[] AssignedVars[i, asum][737], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), 15#L46-1true, Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), 789#(<= (+ l 1) N), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1308#(<= p l), Black: 1303#true, Black: 1307#(<= p (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 399#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), 1189#true, Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:44:14,858 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:44:14,858 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:14,858 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:44:14,858 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:44:14,858 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][874], [Black: 497#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), 15#L46-1true, Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1308#(<= p l), Black: 1303#true, Black: 1307#(<= p (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1002#(<= p i), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 853#(and (<= p (+ i 1)) (<= (+ l 1) N)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:44:14,858 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:44:14,858 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:14,858 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:44:14,858 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:44:19,500 INFO L129 PetriNetUnfolder]: 11830/22603 cut-off events. [2021-03-25 10:44:19,501 INFO L130 PetriNetUnfolder]: For 1258690/1265568 co-relation queries the response was YES. [2021-03-25 10:44:19,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 263162 conditions, 22603 events. 11830/22603 cut-off events. For 1258690/1265568 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 210231 event pairs, 696 based on Foata normal form. 1324/23277 useless extension candidates. Maximal degree in co-relation 261548. Up to 7454 conditions per place. [2021-03-25 10:44:20,053 INFO L142 LiptonReduction]: Number of co-enabled transitions 6346 [2021-03-25 10:44:21,035 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:44:21,035 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:44:21,035 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10137 [2021-03-25 10:44:21,035 INFO L480 AbstractCegarLoop]: Abstraction has has 228 places, 2632 transitions, 68440 flow [2021-03-25 10:44:21,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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 10:44:21,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:44:21,035 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:44:21,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-03-25 10:44:21,035 INFO L428 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:44:21,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:44:21,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2079112524, now seen corresponding path program 2 times [2021-03-25 10:44:21,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:44:21,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778116011] [2021-03-25 10:44:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:44:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:44:21,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 10:44:21,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778116011] [2021-03-25 10:44:21,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277526535] [2021-03-25 10:44:21,050 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 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 10:44:21,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 10:44:21,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:44:21,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2021-03-25 10:44:21,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:44:21,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:44:21,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:44:21,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:44:21,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:44:21,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,078 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,079 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:44:21,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:44:21,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:44:21,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:44:21,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:44:21,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:44:21,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:44:21,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,089 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:44:21,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:44:21,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:44:21,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,090 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:44:21,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:44:21,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:44:21,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,092 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,092 INFO L142 QuantifierPusher]: treesize reduction 1, result has 87.5 percent of original size [2021-03-25 10:44:21,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:44:21,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,093 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:44:21,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:44:21,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:44:21,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:44:21,095 INFO L142 QuantifierPusher]: treesize reduction 7, result has 12.5 percent of original size [2021-03-25 10:44:21,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:44:21,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:44:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 10:44:21,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:44:21,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2021-03-25 10:44:21,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695572535] [2021-03-25 10:44:21,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 10:44:21,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:44:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 10:44:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-03-25 10:44:21,103 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 60 [2021-03-25 10:44:21,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 2632 transitions, 68440 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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 10:44:21,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:44:21,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 60 [2021-03-25 10:44:21,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:44:42,181 INFO L129 PetriNetUnfolder]: 14777/26607 cut-off events. [2021-03-25 10:44:42,182 INFO L130 PetriNetUnfolder]: For 1601675/1601681 co-relation queries the response was YES. [2021-03-25 10:44:42,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 338306 conditions, 26607 events. 14777/26607 cut-off events. For 1601675/1601681 co-relation queries the response was YES. Maximal size of possible extension queue 1432. Compared 233345 event pairs, 439 based on Foata normal form. 456/27063 useless extension candidates. Maximal degree in co-relation 337415. Up to 9653 conditions per place. [2021-03-25 10:44:42,656 INFO L132 encePairwiseOnDemand]: 50/60 looper letters, 1679 selfloop transitions, 1474 changer transitions 103/3262 dead transitions. [2021-03-25 10:44:42,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 3262 transitions, 90926 flow [2021-03-25 10:44:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 10:44:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 10:44:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2021-03-25 10:44:42,657 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.3638888888888889 [2021-03-25 10:44:42,657 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 131 transitions. [2021-03-25 10:44:42,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 131 transitions. [2021-03-25 10:44:42,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:44:42,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 131 transitions. [2021-03-25 10:44:42,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 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 10:44:42,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 60.0) internal successors, (420), 7 states have internal predecessors, (420), 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 10:44:42,658 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 60.0) internal successors, (420), 7 states have internal predecessors, (420), 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 10:44:42,658 INFO L185 Difference]: Start difference. First operand has 228 places, 2632 transitions, 68440 flow. Second operand 6 states and 131 transitions. [2021-03-25 10:44:42,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 3262 transitions, 90926 flow [2021-03-25 10:44:53,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 3262 transitions, 89479 flow, removed 474 selfloop flow, removed 5 redundant places. [2021-03-25 10:44:53,236 INFO L241 Difference]: Finished difference. Result has 232 places, 2867 transitions, 80190 flow [2021-03-25 10:44:53,238 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=62596, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80190, PETRI_PLACES=232, PETRI_TRANSITIONS=2867} [2021-03-25 10:44:53,238 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 209 predicate places. [2021-03-25 10:44:53,238 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:44:53,238 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 232 places, 2867 transitions, 80190 flow [2021-03-25 10:44:53,238 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 232 places, 2867 transitions, 80190 flow [2021-03-25 10:44:53,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 229 places, 2867 transitions, 80190 flow [2021-03-25 10:44:57,266 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][908], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), 13#L46true, Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:44:57,266 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:44:57,266 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:44:57,266 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:44:57,266 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:57,267 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[][1051], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), 789#(<= (+ l 1) N), Black: 1279#(and (<= i (+ l 1)) (<= N l)), 23#L23-1true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 399#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:44:57,267 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:44:57,267 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:44:57,267 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:44:57,267 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:57,783 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][908], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:44:57,783 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:44:57,783 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:44:57,783 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:44:57,783 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:57,783 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:44:57,783 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[][1051], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), 789#(<= (+ l 1) N), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 399#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1181#(and (< 0 N) (<= k 1) (= csum (+ asum 1)) (<= N 1)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 976#(and (< 0 N) (= csum (+ asum 1)) (<= N 1)), Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:44:57,783 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:44:57,783 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:44:57,783 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:44:57,783 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:44:57,783 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:45:03,147 INFO L129 PetriNetUnfolder]: 12209/23417 cut-off events. [2021-03-25 10:45:03,147 INFO L130 PetriNetUnfolder]: For 1448637/1456643 co-relation queries the response was YES. [2021-03-25 10:45:03,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 287389 conditions, 23417 events. 12209/23417 cut-off events. For 1448637/1456643 co-relation queries the response was YES. Maximal size of possible extension queue 1386. Compared 218602 event pairs, 520 based on Foata normal form. 1632/24374 useless extension candidates. Maximal degree in co-relation 286960. Up to 7497 conditions per place. [2021-03-25 10:45:04,031 INFO L142 LiptonReduction]: Number of co-enabled transitions 6858 [2021-03-25 10:45:05,077 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:45:05,077 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:45:05,078 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11840 [2021-03-25 10:45:05,078 INFO L480 AbstractCegarLoop]: Abstraction has has 229 places, 2867 transitions, 80190 flow [2021-03-25 10:45:05,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 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 10:45:05,078 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:45:05,078 INFO L263 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 10:45:05,293 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-03-25 10:45:05,293 INFO L428 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:45:05,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:45:05,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1542970601, now seen corresponding path program 9 times [2021-03-25 10:45:05,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:45:05,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583043861] [2021-03-25 10:45:05,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:45:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:45:05,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:45:05,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,313 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 10:45:05,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583043861] [2021-03-25 10:45:05,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801739015] [2021-03-25 10:45:05,313 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 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 10:45:05,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-03-25 10:45:05,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:45:05,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 10:45:05,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:45:05,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:45:05,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:45:05,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:45:05,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:45:05,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:45:05,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:45:05,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,370 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:45:05,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:45:05,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:45:05,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,371 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:45:05,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:45:05,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:45:05,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,372 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,378 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:45:05,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,385 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:45:05,385 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:45:05,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:45:05,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,386 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:45:05,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:45:05,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:45:05,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:45:05,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:45:05,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:45:05,398 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 10:45:05,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:45:05,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2021-03-25 10:45:05,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865821847] [2021-03-25 10:45:05,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-03-25 10:45:05,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:45:05,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-03-25 10:45:05,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-03-25 10:45:05,399 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2021-03-25 10:45:05,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 2867 transitions, 80190 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 10:45:05,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:45:05,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2021-03-25 10:45:05,400 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:45:35,938 INFO L129 PetriNetUnfolder]: 18100/32932 cut-off events. [2021-03-25 10:45:35,938 INFO L130 PetriNetUnfolder]: For 2200829/2200846 co-relation queries the response was YES. [2021-03-25 10:45:36,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 443626 conditions, 32932 events. 18100/32932 cut-off events. For 2200829/2200846 co-relation queries the response was YES. Maximal size of possible extension queue 1763. Compared 300924 event pairs, 1022 based on Foata normal form. 276/33208 useless extension candidates. Maximal degree in co-relation 442940. Up to 11129 conditions per place. [2021-03-25 10:45:36,667 INFO L132 encePairwiseOnDemand]: 49/60 looper letters, 3541 selfloop transitions, 1418 changer transitions 75/5040 dead transitions. [2021-03-25 10:45:36,667 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 5040 transitions, 154259 flow [2021-03-25 10:45:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-03-25 10:45:36,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-03-25 10:45:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 327 transitions. [2021-03-25 10:45:36,669 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.340625 [2021-03-25 10:45:36,669 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 327 transitions. [2021-03-25 10:45:36,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 327 transitions. [2021-03-25 10:45:36,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:45:36,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 327 transitions. [2021-03-25 10:45:36,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 20.4375) internal successors, (327), 16 states have internal predecessors, (327), 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 10:45:36,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 60.0) internal successors, (1020), 17 states have internal predecessors, (1020), 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 10:45:36,670 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 60.0) internal successors, (1020), 17 states have internal predecessors, (1020), 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 10:45:36,670 INFO L185 Difference]: Start difference. First operand has 229 places, 2867 transitions, 80190 flow. Second operand 16 states and 327 transitions. [2021-03-25 10:45:36,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 5040 transitions, 154259 flow [2021-03-25 10:45:51,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 5040 transitions, 152812 flow, removed 723 selfloop flow, removed 3 redundant places. [2021-03-25 10:45:51,972 INFO L241 Difference]: Finished difference. Result has 250 places, 3213 transitions, 94093 flow [2021-03-25 10:45:51,974 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=79422, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2864, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1071, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=94093, PETRI_PLACES=250, PETRI_TRANSITIONS=3213} [2021-03-25 10:45:51,974 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 227 predicate places. [2021-03-25 10:45:51,974 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:45:51,974 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 3213 transitions, 94093 flow [2021-03-25 10:45:51,974 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 3213 transitions, 94093 flow [2021-03-25 10:45:52,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 250 places, 3213 transitions, 94093 flow [2021-03-25 10:45:57,769 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1642], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:45:57,770 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:45:57,770 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:45:57,770 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:45:57,770 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:45:57,771 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[][2139], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 789#(<= (+ l 1) N), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 399#true, 1433#(< l N), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1455#(and (<= (+ l 1) i) (< l N)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:45:57,771 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:45:57,771 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:45:57,771 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:45:57,771 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:46:01,369 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1104], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), 13#L46true, Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), 1189#true, Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:46:01,369 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 10:46:01,369 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:46:01,371 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:46:01,371 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:46:01,677 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][2421], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), 13#L46true, Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 1279#(and (<= i (+ l 1)) (<= N l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), 347#(<= k i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), 1189#true, Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 453#(and (<= N i) (<= k i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:46:01,678 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 10:46:01,678 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:46:01,678 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:46:01,678 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:46:06,724 INFO L129 PetriNetUnfolder]: 15059/29369 cut-off events. [2021-03-25 10:46:06,724 INFO L130 PetriNetUnfolder]: For 1930762/1941255 co-relation queries the response was YES. [2021-03-25 10:46:07,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 370501 conditions, 29369 events. 15059/29369 cut-off events. For 1930762/1941255 co-relation queries the response was YES. Maximal size of possible extension queue 1830. Compared 289552 event pairs, 746 based on Foata normal form. 2744/31360 useless extension candidates. Maximal degree in co-relation 369059. Up to 9310 conditions per place. [2021-03-25 10:46:07,833 INFO L142 LiptonReduction]: Number of co-enabled transitions 7620 [2021-03-25 10:46:09,140 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:46:09,140 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:46:09,140 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17166 [2021-03-25 10:46:09,141 INFO L480 AbstractCegarLoop]: Abstraction has has 250 places, 3213 transitions, 94093 flow [2021-03-25 10:46:09,141 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 10:46:09,141 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:46:09,141 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 10:46:09,355 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-03-25 10:46:09,355 INFO L428 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:46:09,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:46:09,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1537554997, now seen corresponding path program 1 times [2021-03-25 10:46:09,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:46:09,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690666982] [2021-03-25 10:46:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:46:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:46:09,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:46:09,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,368 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,369 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,372 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,375 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-03-25 10:46:09,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690666982] [2021-03-25 10:46:09,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715667259] [2021-03-25 10:46:09,375 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 10:46:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:46:09,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2021-03-25 10:46:09,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:46:09,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,396 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,399 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:46:09,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:46:09,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:46:09,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,406 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:46:09,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:46:09,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:46:09,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,412 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,412 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,413 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,415 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:46:09,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:46:09,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:46:09,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:46:09,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:46:09,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:46:09,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:46:09,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,418 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:46:09,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:46:09,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 10:46:09,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 10:46:09,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-03-25 10:46:09,426 INFO L142 QuantifierPusher]: treesize reduction 9, result has 10.0 percent of original size [2021-03-25 10:46:09,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,427 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,427 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,430 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,431 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:46:09,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:46:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 10:46:09,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:46:09,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2021-03-25 10:46:09,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395473883] [2021-03-25 10:46:09,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 10:46:09,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:46:09,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 10:46:09,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-03-25 10:46:09,434 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2021-03-25 10:46:09,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 3213 transitions, 94093 flow. Second operand has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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 10:46:09,435 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:46:09,435 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2021-03-25 10:46:09,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:47:11,867 INFO L129 PetriNetUnfolder]: 31116/57881 cut-off events. [2021-03-25 10:47:11,867 INFO L130 PetriNetUnfolder]: For 4253915/4253921 co-relation queries the response was YES. [2021-03-25 10:47:12,958 INFO L84 FinitePrefix]: Finished finitePrefix Result has 807878 conditions, 57881 events. 31116/57881 cut-off events. For 4253915/4253921 co-relation queries the response was YES. Maximal size of possible extension queue 2931. Compared 583054 event pairs, 2146 based on Foata normal form. 1325/59206 useless extension candidates. Maximal degree in co-relation 804110. Up to 20235 conditions per place. [2021-03-25 10:47:13,301 INFO L132 encePairwiseOnDemand]: 49/60 looper letters, 4416 selfloop transitions, 2062 changer transitions 147/6631 dead transitions. [2021-03-25 10:47:13,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 6631 transitions, 209228 flow [2021-03-25 10:47:13,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-03-25 10:47:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-03-25 10:47:13,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 376 transitions. [2021-03-25 10:47:13,302 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.3686274509803922 [2021-03-25 10:47:13,302 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 376 transitions. [2021-03-25 10:47:13,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 376 transitions. [2021-03-25 10:47:13,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:47:13,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 376 transitions. [2021-03-25 10:47:13,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 22.11764705882353) internal successors, (376), 17 states have internal predecessors, (376), 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 10:47:13,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 60.0) internal successors, (1080), 18 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 10:47:13,304 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 60.0) internal successors, (1080), 18 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 10:47:13,304 INFO L185 Difference]: Start difference. First operand has 250 places, 3213 transitions, 94093 flow. Second operand 17 states and 376 transitions. [2021-03-25 10:47:13,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 6631 transitions, 209228 flow [2021-03-25 10:47:52,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 6631 transitions, 206195 flow, removed 1496 selfloop flow, removed 4 redundant places. [2021-03-25 10:47:52,963 INFO L241 Difference]: Finished difference. Result has 274 places, 4587 transitions, 145442 flow [2021-03-25 10:47:52,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=85965, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2990, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=602, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=145442, PETRI_PLACES=274, PETRI_TRANSITIONS=4587} [2021-03-25 10:47:52,966 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 251 predicate places. [2021-03-25 10:47:52,966 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:47:52,966 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 274 places, 4587 transitions, 145442 flow [2021-03-25 10:47:52,966 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 274 places, 4587 transitions, 145442 flow [2021-03-25 10:47:53,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 274 places, 4587 transitions, 145442 flow [2021-03-25 10:48:02,417 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1645], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:48:02,418 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:48:02,418 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:02,418 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:48:02,418 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:48: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[][3028], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), 789#(<= (+ l 1) N), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 399#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 1433#(< l N), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 1455#(and (<= (+ l 1) i) (< l N)), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:48:02,418 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:48:02,418 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:48:02,418 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:02,418 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:48:03,525 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1645], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), 1303#true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:48:03,525 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:48:03,525 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:03,525 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:48:03,525 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:03,525 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:48:03,526 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[][3028], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), 789#(<= (+ l 1) N), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), 1303#true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 399#true, 1433#(< l N), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 1455#(and (<= (+ l 1) i) (< l N)), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:48:03,526 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:48:03,526 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:03,526 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:48:03,526 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:03,526 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:48:03,960 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[][1864], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), 773#(and (<= N i) (<= k i)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1269#(and (<= N l) (<= i l)), 15#L46-1true, Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), 17#L34-1true, Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1308#(<= p l), Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1303#true, Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), 1374#(and (<= p k) (<= (+ l 1) k)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), 1189#true, Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), 453#(and (<= N i) (<= k i)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 404#(<= N i), 1480#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:48:03,960 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:48:03,960 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:48:03,960 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:03,960 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:48:03,960 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[][3028], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), 773#(and (<= N i) (<= k i)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), 17#L34-1true, Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), 1374#(and (<= p k) (<= (+ l 1) k)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), 1189#true, Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), 453#(and (<= N i) (<= k i)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 404#(<= N i), 1480#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:48:03,960 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:48:03,960 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:48:03,960 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:03,960 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:48:05,750 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1645], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 404#(<= N i), 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:48:05,750 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:48:05,750 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:48:05,750 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:05,751 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:06,119 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[][3028], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), 789#(<= (+ l 1) N), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 1303#true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), 1116#true, Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 399#true, 1433#(< l N), 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 1455#(and (<= (+ l 1) i) (< l N)), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:48:06,119 INFO L384 tUnfolder$Statistics]: this new event has 16 ancestors and is not cut-off event [2021-03-25 10:48:06,119 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 10:48:06,119 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 10:48:06,119 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is not cut-off event [2021-03-25 10:48:06,713 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[][1864], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), 773#(and (<= N i) (<= k i)), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1269#(and (<= N l) (<= i l)), 15#L46-1true, Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), 17#L34-1true, Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, 1308#(<= p l), Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1303#true, Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), 1374#(and (<= p k) (<= (+ l 1) k)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), 1189#true, Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 453#(and (<= N i) (<= k i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:48:06,713 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 10:48:06,713 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:06,713 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:06,713 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:06,713 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[][3028], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), 773#(and (<= N i) (<= k i)), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), 17#L34-1true, Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1559#(and (<= i (+ k 1)) (<= i l)), 1062#(and (<= p i) (<= N i) (<= k i) (<= l i)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), 1374#(and (<= p k) (<= (+ l 1) k)), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 873#(<= (+ l 1) N), 1189#true, Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), 453#(and (<= N i) (<= k i)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:48:06,713 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 10:48:06,713 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:06,713 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:06,713 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:10,841 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1645], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), 1303#true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 404#(<= N i), 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:48:10,842 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 10:48:10,842 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:10,842 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:48:10,842 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:10,842 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:10,842 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[][3028], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 789#(<= (+ l 1) N), 1303#true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 74#(and (= l i) (= l k)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 399#true, 1433#(< l N), 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 1455#(and (<= (+ l 1) i) (< l N)), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:48:10,842 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 10:48:10,842 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:10,842 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:10,842 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:10,842 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1645], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:48:11,859 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L382 tUnfolder$Statistics]: inserting event number 6 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[][3028], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), 515#true, Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 789#(<= (+ l 1) N), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, 23#L23-1true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 24#L47true, 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 399#true, 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), 1433#(< l N), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 1455#(and (<= (+ l 1) i) (< l N)), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:48:11,859 INFO L384 tUnfolder$Statistics]: this new event has 19 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:11,859 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:48:11,915 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][889], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), 343#true, Black: 1074#(and (<= p i) (<= l i)), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), 1189#true, Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), 1484#(<= i k), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:48:11,915 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 10:48:11,915 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:48:11,915 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:48:11,915 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:13,736 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][889], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), 7#thread2EXITtrue, Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 8#thread1EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 404#(<= N i), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), 1189#true, Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), 1480#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:48:13,737 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 10:48:13,737 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:48:13,737 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:48:13,737 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:16,244 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][2570], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1307#(<= p (+ l 1)), Black: 1489#(<= i l), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 347#(<= k i), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), 1189#true, Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 453#(and (<= N i) (<= k i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), 1484#(<= i k), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:48:16,245 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 10:48:16,245 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:48:16,245 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:48:16,245 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:48:19,785 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][2570], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, 8#thread1EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), 13#L46true, Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1275#(and (<= i (+ l 1)) (<= N l) (<= k (+ l 1))), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1307#(<= p (+ l 1)), Black: 1489#(<= i l), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), 347#(<= k i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), 1189#true, Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 453#(and (<= N i) (<= k i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 404#(<= N i), 1480#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:48:19,785 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 10:48:19,785 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:48:19,785 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:48:19,785 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 10:48:32,054 INFO L129 PetriNetUnfolder]: 25879/51642 cut-off events. [2021-03-25 10:48:32,054 INFO L130 PetriNetUnfolder]: For 3949453/3966726 co-relation queries the response was YES. [2021-03-25 10:48:33,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 696820 conditions, 51642 events. 25879/51642 cut-off events. For 3949453/3966726 co-relation queries the response was YES. Maximal size of possible extension queue 3101. Compared 561292 event pairs, 1464 based on Foata normal form. 4128/54483 useless extension candidates. Maximal degree in co-relation 694598. Up to 16595 conditions per place. [2021-03-25 10:48:34,245 INFO L142 LiptonReduction]: Number of co-enabled transitions 10890 [2021-03-25 10:48:37,217 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:48:37,218 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 10:48:37,218 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 44252 [2021-03-25 10:48:37,218 INFO L480 AbstractCegarLoop]: Abstraction has has 274 places, 4587 transitions, 145442 flow [2021-03-25 10:48:37,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 16.375) internal successors, (131), 8 states have internal predecessors, (131), 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 10:48:37,218 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:48:37,218 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 10:48:37,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-03-25 10:48:37,432 INFO L428 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:48:37,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:48:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash 379282000, now seen corresponding path program 2 times [2021-03-25 10:48:37,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:48:37,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732837711] [2021-03-25 10:48:37,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:48:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:48:37,478 INFO L142 QuantifierPusher]: treesize reduction 15, result has 55.9 percent of original size [2021-03-25 10:48:37,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:48:37,490 INFO L142 QuantifierPusher]: treesize reduction 3, result has 91.2 percent of original size [2021-03-25 10:48:37,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,505 INFO L142 QuantifierPusher]: treesize reduction 36, result has 57.1 percent of original size [2021-03-25 10:48:37,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-25 10:48:37,528 INFO L142 QuantifierPusher]: treesize reduction 51, result has 48.0 percent of original size [2021-03-25 10:48:37,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 10:48:37,556 INFO L142 QuantifierPusher]: treesize reduction 51, result has 49.0 percent of original size [2021-03-25 10:48:37,556 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:48:37,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,587 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:48:37,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,601 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:48:37,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:48:37,685 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:48:37,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,696 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 10:48:37,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732837711] [2021-03-25 10:48:37,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179600716] [2021-03-25 10:48:37,696 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 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 10:48:37,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-03-25 10:48:37,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:48:37,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 30 conjunts are in the unsatisfiable core [2021-03-25 10:48:37,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:48:37,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,724 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:48:37,726 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,726 INFO L147 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size 22 [2021-03-25 10:48:37,726 INFO L142 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-03-25 10:48:37,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 10:48:37,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 10:48:37,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 10:48:37,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,740 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:48:37,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 10:48:37,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,741 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:48:37,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 10:48:37,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,742 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 10:48:37,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-03-25 10:48:37,746 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 10:48:37,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:48:37,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:48:37,746 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:48:37,754 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,754 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,755 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:48:37,755 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:33 [2021-03-25 10:48:37,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 10:48:37,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,777 INFO L147 QuantifierPusher]: treesize reduction 5, result has 89.1 percent of original size 41 [2021-03-25 10:48:37,777 INFO L142 QuantifierPusher]: treesize reduction 5, result has 89.1 percent of original size [2021-03-25 10:48:37,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:48:37,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:48:37,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:48:37,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 10:48:37,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 10:48:37,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 10:48:37,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 10:48:37,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 10:48:37,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 10:48:37,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 10:48:37,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-03-25 10:48:37,825 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 10:48:37,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,826 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:48:37,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-03-25 10:48:37,827 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:48:37,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 10:48:37,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:48:37,837 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:51, output treesize:52 [2021-03-25 10:48:37,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 10:48:37,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 10:48:37,861 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 10:48:37,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 10:48:37,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 10:48:37,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 10:48:37,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,865 INFO L147 QuantifierPusher]: treesize reduction 2, result has 96.3 percent of original size 52 [2021-03-25 10:48:37,865 INFO L142 QuantifierPusher]: treesize reduction 2, result has 96.4 percent of original size [2021-03-25 10:48:37,865 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,865 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 10:48:37,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-25 10:48:37,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-25 10:48:37,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-25 10:48:37,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-03-25 10:48:37,870 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 46 treesize of output 30 [2021-03-25 10:48:37,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,871 INFO L147 QuantifierPusher]: treesize reduction 6, result has 80.6 percent of original size 25 [2021-03-25 10:48:37,872 INFO L142 QuantifierPusher]: treesize reduction 6, result has 80.6 percent of original size [2021-03-25 10:48:37,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:48:37,872 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:48:37,877 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,878 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:48:37,878 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:52, output treesize:31 [2021-03-25 10:48:37,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,879 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,879 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,900 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-25 10:48:37,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,902 INFO L147 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size 23 [2021-03-25 10:48:37,903 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.0 percent of original size [2021-03-25 10:48:37,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:48:37,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:48:37,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:48:37,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:48:37,907 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 11 treesize of output 7 [2021-03-25 10:48:37,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:48:37,908 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:48:37,909 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:48:37,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,913 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:48:37,913 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2021-03-25 10:48:37,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,913 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,929 INFO L142 QuantifierPusher]: treesize reduction 1, result has 93.8 percent of original size [2021-03-25 10:48:37,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 10:48:37,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,930 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:48:37,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 10:48:37,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 10:48:37,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,932 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,932 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,949 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,952 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,953 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:48:37,953 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:48:37,953 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 10:48:37,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:48:37,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2021-03-25 10:48:37,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96568012] [2021-03-25 10:48:37,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-03-25 10:48:37,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:48:37,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-03-25 10:48:37,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2021-03-25 10:48:37,954 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 60 [2021-03-25 10:48:37,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 4587 transitions, 145442 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 10:48:37,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:48:37,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 60 [2021-03-25 10:48:37,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 10:50:44,526 INFO L129 PetriNetUnfolder]: 31885/59409 cut-off events. [2021-03-25 10:50:44,526 INFO L130 PetriNetUnfolder]: For 4752507/4752513 co-relation queries the response was YES. [2021-03-25 10:50:46,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 868146 conditions, 59409 events. 31885/59409 cut-off events. For 4752507/4752513 co-relation queries the response was YES. Maximal size of possible extension queue 3103. Compared 602575 event pairs, 3286 based on Foata normal form. 7/59416 useless extension candidates. Maximal degree in co-relation 865233. Up to 51111 conditions per place. [2021-03-25 10:50:46,692 INFO L132 encePairwiseOnDemand]: 49/60 looper letters, 4675 selfloop transitions, 288 changer transitions 57/5026 dead transitions. [2021-03-25 10:50:46,692 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 5026 transitions, 168378 flow [2021-03-25 10:50:46,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-03-25 10:50:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-03-25 10:50:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 437 transitions. [2021-03-25 10:50:46,694 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.33106060606060606 [2021-03-25 10:50:46,694 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 437 transitions. [2021-03-25 10:50:46,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 437 transitions. [2021-03-25 10:50:46,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 10:50:46,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 437 transitions. [2021-03-25 10:50:46,695 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 10:50:46,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 60.0) internal successors, (1380), 23 states have internal predecessors, (1380), 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 10:50:46,696 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 60.0) internal successors, (1380), 23 states have internal predecessors, (1380), 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 10:50:46,696 INFO L185 Difference]: Start difference. First operand has 274 places, 4587 transitions, 145442 flow. Second operand 22 states and 437 transitions. [2021-03-25 10:50:46,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 5026 transitions, 168378 flow [2021-03-25 10:52:12,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 5026 transitions, 165881 flow, removed 1238 selfloop flow, removed 3 redundant places. [2021-03-25 10:52:12,685 INFO L241 Difference]: Finished difference. Result has 305 places, 4795 transitions, 151209 flow [2021-03-25 10:52:12,688 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=143161, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=151209, PETRI_PLACES=305, PETRI_TRANSITIONS=4795} [2021-03-25 10:52:12,688 INFO L343 CegarLoopForPetriNet]: 23 programPoint places, 282 predicate places. [2021-03-25 10:52:12,688 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 10:52:12,688 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 305 places, 4795 transitions, 151209 flow [2021-03-25 10:52:12,688 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 305 places, 4795 transitions, 151209 flow [2021-03-25 10:52:12,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 303 places, 4795 transitions, 151209 flow [2021-03-25 10:52:23,942 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1675], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), 1578#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 1665#(and (= l i) (= (+ (select A i) 1) (select C i)) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (< l N) (= csum (+ (select A (+ i (- 1))) 1)) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1667#(and (not (= k i)) (< k (+ i 1))), Black: 1669#(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)) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1671#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (<= (+ N asum) (+ (select C l) csum)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1640#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1673#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 404#(<= N i), Black: 1677#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1615#(and (= csum (select C (+ i (- 1)))) (= k i) (= l i) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1585#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1586#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1659#(and (not (= k i)) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1630#(and (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1663#(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: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:52:23,942 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:52:23,943 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:52:23,943 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:52:23,943 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:52:23,943 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[][3160], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1277#(and (<= N l) (<= k (+ l 1))), 789#(<= (+ l 1) N), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 23#L23-1true, 1303#true, 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), 1578#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), 585#true, Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), 1116#true, Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 347#(<= k i), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 1665#(and (= l i) (= (+ (select A i) 1) (select C i)) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (< l N) (= csum (+ (select A (+ i (- 1))) 1)) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), 399#true, Black: 1667#(and (not (= k i)) (< k (+ i 1))), Black: 1669#(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)) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1671#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (<= (+ N asum) (+ (select C l) csum)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1640#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1673#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1677#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1615#(and (= csum (select C (+ i (- 1)))) (= k i) (= l i) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1585#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1586#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 1433#(< l N), Black: 1659#(and (not (= k i)) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1630#(and (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1663#(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: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 1455#(and (<= (+ l 1) i) (< l N)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:52:23,943 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 10:52:23,943 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:52:23,943 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:52:23,943 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:52:25,556 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][1675], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), 13#L46true, Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), 1303#true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), 1578#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 1665#(and (= l i) (= (+ (select A i) 1) (select C i)) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (< l N) (= csum (+ (select A (+ i (- 1))) 1)) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1667#(and (not (= k i)) (< k (+ i 1))), Black: 1669#(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)) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1671#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (<= (+ N asum) (+ (select C l) csum)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1640#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1673#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 404#(<= N i), Black: 1677#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1615#(and (= csum (select C (+ i (- 1)))) (= k i) (= l i) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1585#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1586#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1659#(and (not (= k i)) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1630#(and (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1663#(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: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1004#(<= N i)]) [2021-03-25 10:52:25,556 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:52:25,556 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:52:25,556 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:52:25,556 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:52:25,556 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:52:25,556 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[][3160], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 779#(and (<= N i) (<= k (+ i 1))), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1277#(and (<= N l) (<= k (+ l 1))), 789#(<= (+ l 1) N), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), 1303#true, 23#L23-1true, Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 24#L47true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), 1578#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), Black: 48#true, Black: 50#(= i l), 59#true, Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 585#true, Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 640#(and (<= N (+ i 1)) (<= k (+ i 1))), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), 399#true, Black: 1665#(and (= l i) (= (+ (select A i) 1) (select C i)) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (< l N) (= csum (+ (select A (+ i (- 1))) 1)) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1667#(and (not (= k i)) (< k (+ i 1))), Black: 1669#(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)) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1671#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (<= (+ N asum) (+ (select C l) csum)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1640#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1673#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1677#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1615#(and (= csum (select C (+ i (- 1)))) (= k i) (= l i) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1585#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1586#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1659#(and (not (= k i)) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 1433#(< l N), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1630#(and (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1663#(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: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1209#(<= i (+ l 1)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 1455#(and (<= (+ l 1) i) (< l N)), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum)), 998#true]) [2021-03-25 10:52:25,556 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 10:52:25,556 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:52:25,556 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:52:25,556 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:52:25,556 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:52:44,535 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][872], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, 8#thread1EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), 1578#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 1665#(and (= l i) (= (+ (select A i) 1) (select C i)) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (< l N) (= csum (+ (select A (+ i (- 1))) 1)) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1667#(and (not (= k i)) (< k (+ i 1))), Black: 1669#(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)) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1671#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (<= (+ N asum) (+ (select C l) csum)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1640#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), 404#(<= N i), Black: 1673#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1677#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1615#(and (= csum (select C (+ i (- 1)))) (= k i) (= l i) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1585#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1586#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1659#(and (not (= k i)) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1630#(and (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1663#(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: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), 1189#true, Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), 1484#(<= i k), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:52:44,535 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is cut-off event [2021-03-25 10:52:44,535 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:52:44,535 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:52:44,535 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:52:45,083 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][872], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, Black: 1195#(<= N l), 8#thread1EXITtrue, Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1307#(<= p (+ l 1)), Black: 1489#(<= i l), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), 1578#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), 343#true, Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 787#(<= p i), Black: 1086#(and (<= p i) (<= k i) (< k N)), 1116#true, Black: 788#(<= l i), Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 347#(<= k i), Black: 1665#(and (= l i) (= (+ (select A i) 1) (select C i)) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (< l N) (= csum (+ (select A (+ i (- 1))) 1)) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1667#(and (not (= k i)) (< k (+ i 1))), Black: 1669#(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)) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1671#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (<= (+ N asum) (+ (select C l) csum)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1640#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1673#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), 404#(<= N i), Black: 1677#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1615#(and (= csum (select C (+ i (- 1)))) (= k i) (= l i) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1585#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1586#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1659#(and (not (= k i)) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1630#(and (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1663#(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: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), 1189#true, Black: 877#(<= l k), Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), 1480#true, Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:52:45,083 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 10:52:45,083 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:52:45,083 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:52:45,083 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:52:50,579 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][2653], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, 8#thread1EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 773#(and (<= N i) (<= k i)), 13#L46true, Black: 1265#(and (<= N l) (<= k l) (<= i l)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1307#(<= p (+ l 1)), Black: 1489#(<= i l), Black: 1555#(and (<= i l) (<= i k)), Black: 1308#(<= p l), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), 1578#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 69#(= p l), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), Black: 1080#(and (<= p i) (<= k i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 851#(and (<= p i) (<= l i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 787#(<= p i), 347#(<= k i), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 1665#(and (= l i) (= (+ (select A i) 1) (select C i)) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (< l N) (= csum (+ (select A (+ i (- 1))) 1)) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1667#(and (not (= k i)) (< k (+ i 1))), Black: 1669#(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)) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1671#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (<= (+ N asum) (+ (select C l) csum)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1640#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1673#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1677#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1615#(and (= csum (select C (+ i (- 1)))) (= k i) (= l i) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1585#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1586#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), Black: 1659#(and (not (= k i)) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1630#(and (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1663#(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: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 868#true, Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), 1189#true, Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), 453#(and (<= N i) (<= k i)), Black: 1451#(and (<= l i) (< l N)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), 1484#(<= i k), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:52:50,579 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-03-25 10:52:50,579 INFO L387 tUnfolder$Statistics]: existing Event has 16 ancestors and is cut-off event [2021-03-25 10:52:50,579 INFO L387 tUnfolder$Statistics]: existing Event has 14 ancestors and is cut-off event [2021-03-25 10:52:50,579 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 10:52:54,584 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([97] L23-1-->thread1EXIT: Formula: (not (< v_i_13 v_N_11)) InVars {N=v_N_11, i=v_i_13} OutVars{N=v_N_11, i=v_i_13} AuxVars[] AssignedVars[][2653], [Black: 1249#(and (<= k (+ l 1)) (<= i l)), Black: 1251#(and (<= i (+ l 1)) (<= k (+ l 1))), Black: 1253#(and (<= i (+ l 1)) (<= k l) (<= N (+ l 1))), 515#true, Black: 1255#(and (<= k (+ l 1)) (<= N (+ l 1)) (<= i l)), Black: 1192#(<= k l), Black: 1193#(<= k (+ l 1)), Black: 1257#(and (<= i (+ l 1)) (<= k (+ l 1)) (<= N (+ l 1))), 7#thread2EXITtrue, 8#thread1EXITtrue, Black: 1195#(<= N l), Black: 1259#(and (<= i (+ l 1)) (<= N (+ l 1))), Black: 1261#(and (<= k (+ l 1)) (<= N (+ l 1))), 10#L63true, Black: 1199#(<= i l), Black: 1263#(and (<= k l) (<= i l)), Black: 1265#(and (<= N l) (<= k l) (<= i l)), 13#L46true, Black: 773#(and (<= N i) (<= k i)), Black: 1267#(and (<= N l) (<= k (+ l 1)) (<= i l)), Black: 1269#(and (<= N l) (<= i l)), Black: 1271#(and (<= i (+ l 1)) (<= N l) (<= k l)), Black: 1273#(and (<= N l) (<= k l)), Black: 1209#(<= i (+ l 1)), Black: 1277#(and (<= N l) (<= k (+ l 1))), Black: 273#(and (or (<= (+ N asum) csum) (<= (+ k asum) csum)) (= csum (+ asum 1)) (<= i 1) (< csum (+ N asum 1))), Black: 1247#(and (<= i (+ l 1)) (<= k l)), Black: 246#(and (< 0 N) (= csum (+ asum 1)) (<= i 1)), 1303#true, Black: 267#(and (= k i) (= i asum) (= l k) (= i 0) (< csum (+ N asum 1)) (= i csum)), 282#true, Black: 1545#(and (<= i (+ l 1)) (<= i (+ k 1))), Black: 1483#(<= i (+ k 1)), Black: 1547#(and (<= (+ i 1) N) (<= i l) (<= i k)), Black: 1484#(<= i k), Black: 1549#(and (<= i (+ l 1)) (<= i k)), Black: 1553#(and (<= i (+ l 1)) (<= (+ i 1) N) (<= i k)), Black: 1489#(<= i l), Black: 1307#(<= p (+ l 1)), Black: 1308#(<= p l), Black: 1555#(and (<= i l) (<= i k)), Black: 1557#(and (<= (+ i 1) N) (<= i k)), Black: 1559#(and (<= i (+ k 1)) (<= i l)), Black: 1561#(and (<= (+ i 1) N) (<= i (+ k 1)) (<= i l)), Black: 1563#(and (<= (+ i 1) N) (<= i l)), Black: 1502#(<= i (+ l 1)), 1578#true, Black: 41#(and (= l 0) (<= 0 N) (or (= (+ N asum) csum) (not (= (+ N asum) 0))) (= asum 0)), 51#(<= (+ l 1) N), 1078#(and (<= N i) (<= p (+ i 1)) (<= k (+ i 1))), Black: 48#true, Black: 50#(= i l), 62#(<= N i), Black: 541#(and (< csum N) (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum)), Black: 69#(= p l), Black: 574#(and (<= i (+ csum 1)) (= l 0) (= (+ asum 1) (+ (select C l) csum)) (= l csum) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1090#(and (<= p i) (<= N i) (< k N)), Black: 1058#(and (<= p i) (<= N i) (<= l i) (< k N)), 843#(and (<= (+ l 1) i) (<= (+ l 1) N)), Black: 1060#(and (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 1064#(and (<= p i) (<= k i) (<= l i)), Black: 1066#(and (<= N i) (<= p (+ i 1)) (<= l i) (<= k (+ i 1))), Black: 74#(and (= l i) (= l k)), Black: 76#(<= (+ i 1) N), Black: 1003#(<= l i), Black: 1004#(<= N i), Black: 1068#(and (<= N i) (<= l i)), Black: 1070#(and (<= p i) (<= l i) (<= k (+ i 1))), Black: 301#(and (= l i) (= l 0) (= (select C l) (+ (select A l) 1)) (= i asum) (<= k (+ l 1)) (< l N) (= i csum)), Black: 1072#(and (<= p (+ i 1)) (<= k (+ i 1))), Black: 1074#(and (<= p i) (<= l i)), Black: 849#(and (<= p i) (<= l i) (<= (+ l 1) N)), Black: 1080#(and (<= p i) (<= k i)), Black: 1084#(and (<= p i) (<= N i) (<= k i)), Black: 851#(and (<= p i) (<= l i)), Black: 787#(<= p i), 347#(<= k i), Black: 1086#(and (<= p i) (<= k i) (< k N)), Black: 788#(<= l i), 1116#true, Black: 789#(<= (+ l 1) N), Black: 839#(and (<= p i) (<= (+ l 1) i) (<= (+ l 1) N)), Black: 855#(and (<= p i) (<= (+ l 1) N)), Black: 841#(and (<= p (+ i 1)) (<= l i) (<= (+ l 1) N)), 1378#(and (<= N k) (<= p k) (<= (+ l 1) k)), Black: 845#(and (<= l i) (<= (+ l 1) N)), Black: 1381#(and (<= N k) (<= p k) (<= l k)), Black: 1372#(and (<= p k) (<= l k)), Black: 1374#(and (<= p k) (<= (+ l 1) k)), Black: 594#(<= k i), Black: 604#(<= k (+ i 1)), 645#true, Black: 395#(and (<= (+ k 1) N) (<= (+ k 1) i)), Black: 99#(and (= k 0) (= k csum) (= l k) (= asum (+ k (select A k))) (<= i (+ k 1)) (< k N)), Black: 1665#(and (= l i) (= (+ (select A i) 1) (select C i)) (<= (+ k asum (select A i)) (+ (select C l) csum)) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (< l N) (= csum (+ (select A (+ i (- 1))) 1)) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1667#(and (not (= k i)) (< k (+ i 1))), Black: 1669#(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)) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1671#(and (or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))) (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (<= (+ N asum) (+ (select C l) csum)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1640#(and (< 1 N) (<= l 2) (= (+ asum 2) csum)), Black: 1673#(and (<= (+ N asum) (+ (select C l) csum)) (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))), Black: 1677#(and (< 1 N) (<= l 2) (= (+ asum 2) csum) (<= N 2)), Black: 1615#(and (= csum (select C (+ i (- 1)))) (= k i) (= l i) (= (+ (select A (+ i (- 1))) 1) (select C (+ i (- 1)))) (= i 1) (= (+ i (select A (+ i (- 1)))) (+ asum 1))), Black: 1585#(or (<= k i) (and (<= (+ k asum (select A i)) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum (select A i))))), Black: 1586#(or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)), 921#(and (<= (+ l 1) k) (<= (+ l 1) N)), Black: 1659#(and (not (= k i)) (or (and (<= (+ k asum) (+ (select C l) csum)) (<= (+ (select C l) csum) (+ N asum))) (<= (+ k 1) N)) (< k (+ i 1))), Black: 1630#(and (= (+ l (select C l) (select C (+ l (- 1)))) (+ asum 3)) (= (+ asum 3) (+ l (select C l) csum)) (= l 1) (< l N)), Black: 1663#(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: 1120#(and (= i asum) (<= csum (+ N i (select A i))) (<= (+ l i (select A i)) csum)), Black: 1121#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 868#true, Black: 1175#(and (<= (+ l asum) csum) (= l i) (= i asum) (<= (select C l) (+ N (select A i))) (= l csum) (<= (+ l (select A i) 1) (select C l)) (< csum (+ N asum 1))), Black: 870#(= k l), Black: 1179#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 873#(<= (+ l 1) N), Black: 877#(<= l k), 1189#true, Black: 925#(and (<= (+ l 2) N) (<= (+ l 1) k)), Black: 927#(and (<= l k) (<= (+ l 1) N)), 936#true, 1455#(and (<= (+ l 1) i) (< l N)), Black: 1459#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N)), Black: 1397#(<= l i), Black: 1463#(and (<= (+ l 1) i) (< (+ l 1) N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1465#(and (<= l i) (< l N) (<= (+ k 1) N)), Black: 1449#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1467#(and (<= l i) (< l N) (<= (+ k 1) N) (<= (+ k 1) i)), Black: 1451#(and (<= l i) (< l N)), 453#(and (<= N i) (<= k i)), Black: 1469#(and (<= (+ l 1) i) (< l N) (<= (+ k 1) N)), Black: 403#(<= k i), 1480#true, Black: 404#(<= N i), Black: 710#(and (<= k 1) (= csum (+ asum 1)) (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 651#(and (or (<= (+ l asum) csum) (<= (+ N asum) csum)) (< csum (+ N asum 1))), Black: 203#(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))), 210#true, Black: 968#(and (< 0 N) (<= l 1) (= i asum) (= i 0) (= (+ (select A 0) 1) csum))]) [2021-03-25 10:52:54,584 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-03-25 10:52:54,584 INFO L387 tUnfolder$Statistics]: existing Event has 15 ancestors and is cut-off event [2021-03-25 10:52:54,584 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 10:52:54,584 INFO L387 tUnfolder$Statistics]: existing Event has 19 ancestors and is cut-off event [2021-03-25 10:53:10,074 INFO L129 PetriNetUnfolder]: 26565/53102 cut-off events. [2021-03-25 10:53:10,074 INFO L130 PetriNetUnfolder]: For 4096255/4113836 co-relation queries the response was YES. [2021-03-25 10:53:11,559 INFO L84 FinitePrefix]: Finished finitePrefix Result has 717030 conditions, 53102 events. 26565/53102 cut-off events. For 4096255/4113836 co-relation queries the response was YES. Maximal size of possible extension queue 3242. Compared 581234 event pairs, 1540 based on Foata normal form. 4262/56027 useless extension candidates. Maximal degree in co-relation 716207. Up to 17150 conditions per place. [2021-03-25 10:53:12,630 INFO L142 LiptonReduction]: Number of co-enabled transitions 11386 [2021-03-25 10:53:19,614 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 10:53:19,614 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 10:53:19,615 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66927 [2021-03-25 10:53:19,615 INFO L480 AbstractCegarLoop]: Abstraction has has 303 places, 4795 transitions, 151240 flow [2021-03-25 10:53:19,615 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 10:53:19,615 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 10:53:19,615 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 10:53:19,829 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-03-25 10:53:19,829 INFO L428 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2021-03-25 10:53:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 10:53:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1025563438, now seen corresponding path program 3 times [2021-03-25 10:53:19,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 10:53:19,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512549737] [2021-03-25 10:53:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 10:53:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 10:53:19,847 INFO L142 QuantifierPusher]: treesize reduction 15, result has 55.9 percent of original size [2021-03-25 10:53:19,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:53:19,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:19,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-03-25 10:53:19,874 INFO L142 QuantifierPusher]: treesize reduction 34, result has 59.0 percent of original size [2021-03-25 10:53:19,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:19,901 INFO L142 QuantifierPusher]: treesize reduction 51, result has 49.0 percent of original size [2021-03-25 10:53:19,901 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:19,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:19,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:53:19,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:19,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:53:19,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:19,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 10:53:19,967 INFO L142 QuantifierPusher]: treesize reduction 13, result has 48.0 percent of original size [2021-03-25 10:53:19,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:19,977 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 10:53:19,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512549737] [2021-03-25 10:53:19,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579160064] [2021-03-25 10:53:19,977 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 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 10:53:19,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-03-25 10:53:20,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-03-25 10:53:20,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 30 conjunts are in the unsatisfiable core [2021-03-25 10:53:20,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-03-25 10:53:20,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:53:20,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:53:20,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:53:20,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:53:20,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:53:20,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:53:20,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:53:20,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 10:53:20,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,007 INFO L147 QuantifierPusher]: treesize reduction 1, result has 96.3 percent of original size 26 [2021-03-25 10:53:20,008 INFO L142 QuantifierPusher]: treesize reduction 1, result has 96.3 percent of original size [2021-03-25 10:53:20,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,009 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,023 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,024 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,024 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 10:53:20,026 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 10:53:20,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,027 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 10:53:20,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 10:53:20,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,028 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 10:53:20,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-25 10:53:20,032 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 10:53:20,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:53:20,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 10:53:20,033 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:53:20,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,041 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,041 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:53:20,042 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:41 [2021-03-25 10:53:20,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,061 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,062 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,062 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,066 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-25 10:53:20,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,085 INFO L147 QuantifierPusher]: treesize reduction -1, result has 102.1 percent of original size 49 [2021-03-25 10:53:20,085 INFO L142 QuantifierPusher]: treesize reduction -1, result has 102.1 percent of original size [2021-03-25 10:53:20,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:20,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:20,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:20,107 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-25 10:53:20,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 10:53:20,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 10:53:20,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-25 10:53:20,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:20,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,110 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:20,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:20,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:20,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:20,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,135 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-03-25 10:53:20,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,136 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:53:20,137 INFO L147 QuantifierPusher]: treesize reduction 3, result has 93.8 percent of original size 45 [2021-03-25 10:53:20,138 INFO L142 QuantifierPusher]: treesize reduction 3, result has 93.9 percent of original size [2021-03-25 10:53:20,138 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 10:53:20,139 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 10:53:20,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,140 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 10:53:20,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,141 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,141 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 10:53:20,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,142 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-03-25 10:53:20,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-25 10:53:20,146 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 10:53:20,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,147 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 10:53:20,147 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:53:20,156 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,158 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 35 treesize of output 25 [2021-03-25 10:53:20,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,159 INFO L147 QuantifierPusher]: treesize reduction 2, result has 91.3 percent of original size 21 [2021-03-25 10:53:20,159 INFO L142 QuantifierPusher]: treesize reduction 2, result has 91.3 percent of original size [2021-03-25 10:53:20,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 10:53:20,159 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-03-25 10:53:20,165 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,166 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:53:20,166 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:30 [2021-03-25 10:53:20,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 10:53:20,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-25 10:53:20,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,188 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:53:20,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:53:20,189 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-03-25 10:53:20,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 10:53:20,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 10:53:20,192 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 11 treesize of output 7 [2021-03-25 10:53:20,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:53:20,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,193 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 10:53:20,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-03-25 10:53:20,197 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,197 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,197 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-03-25 10:53:20,197 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:12 [2021-03-25 10:53:20,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,215 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 10:53:20,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 10:53:20,219 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 10:53:20,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-03-25 10:53:20,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2021-03-25 10:53:20,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306913785] [2021-03-25 10:53:20,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-03-25 10:53:20,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 10:53:20,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-03-25 10:53:20,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-03-25 10:53:20,220 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 61 [2021-03-25 10:53:20,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 4795 transitions, 151240 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 10:53:20,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 10:53:20,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 61 [2021-03-25 10:53:20,220 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2021-03-25 10:55:45,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-03-25 10:55:45,851 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-03-25 10:55:45,852 WARN L545 AbstractCegarLoop]: Verification canceled [2021-03-25 10:55:45,865 WARN L224 ceAbstractionStarter]: Timeout [2021-03-25 10:55:45,865 INFO L202 PluginConnector]: Adding new model simple-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 10:55:45 BasicIcfg [2021-03-25 10:55:45,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 10:55:45,866 INFO L168 Benchmark]: Toolchain (without parser) took 839715.86 ms. Allocated memory was 358.6 MB in the beginning and 13.2 GB in the end (delta: 12.8 GB). Free memory was 338.9 MB in the beginning and 7.6 GB in the end (delta: -7.2 GB). Peak memory consumption was 5.9 GB. Max. memory is 16.0 GB. [2021-03-25 10:55:45,866 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.12 ms. Allocated memory is still 358.6 MB. Free memory was 340.1 MB in the beginning and 340.0 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 10:55:45,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.44 ms. Allocated memory is still 358.6 MB. Free memory was 338.8 MB in the beginning and 337.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 10:55:45,867 INFO L168 Benchmark]: Boogie Preprocessor took 13.46 ms. Allocated memory is still 358.6 MB. Free memory was 337.4 MB in the beginning and 336.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 10:55:45,867 INFO L168 Benchmark]: RCFGBuilder took 277.60 ms. Allocated memory is still 358.6 MB. Free memory was 336.3 MB in the beginning and 322.5 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. [2021-03-25 10:55:45,867 INFO L168 Benchmark]: TraceAbstraction took 839402.65 ms. Allocated memory was 358.6 MB in the beginning and 13.2 GB in the end (delta: 12.8 GB). Free memory was 322.0 MB in the beginning and 7.6 GB in the end (delta: -7.2 GB). Peak memory consumption was 5.9 GB. Max. memory is 16.0 GB. [2021-03-25 10:55:45,868 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.12 ms. Allocated memory is still 358.6 MB. Free memory was 340.1 MB in the beginning and 340.0 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 18.44 ms. Allocated memory is still 358.6 MB. Free memory was 338.8 MB in the beginning and 337.4 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.46 ms. Allocated memory is still 358.6 MB. Free memory was 337.4 MB in the beginning and 336.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.0 GB. * RCFGBuilder took 277.60 ms. Allocated memory is still 358.6 MB. Free memory was 336.3 MB in the beginning and 322.5 MB in the end (delta: 13.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 839402.65 ms. Allocated memory was 358.6 MB in the beginning and 13.2 GB in the end (delta: 12.8 GB). Free memory was 322.0 MB in the beginning and 7.6 GB in the end (delta: -7.2 GB). Peak memory consumption was 5.9 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 200.5ms, 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: 60, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 60, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 74, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 60, unknown conditional: 0, unknown unconditional: 60] , 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.9ms, 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: 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] , 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.4ms, 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: 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] , 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: 4.1ms, 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: 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] , 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: 3.9ms, 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: 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] , 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.3ms, 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: 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] , 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: 16.3ms, 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: 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] , 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: 71.6ms, 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: 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] , 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: 115.2ms, 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: 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] , 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: 141.5ms, 70 PlacesBefore, 70 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 138 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 138, positive conditional: 0, positive unconditional: 138, 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: 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] , Cache Queries: [ total: 138, positive: 138, positive conditional: 0, positive unconditional: 138, 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: 77.9ms, 74 PlacesBefore, 74 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 48 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 48, positive conditional: 0, positive unconditional: 48, 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: 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] , Cache Queries: [ total: 48, positive: 48, positive conditional: 0, positive unconditional: 48, 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: 38.1ms, 80 PlacesBefore, 80 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 592 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: 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] , 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): 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: 143.5ms, 86 PlacesBefore, 86 PlacesAfterwards, 90 TransitionsBefore, 90 TransitionsAfterwards, 618 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 65 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 65, positive: 65, positive conditional: 0, positive unconditional: 65, 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: 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] , Cache Queries: [ total: 65, positive: 62, positive conditional: 0, positive unconditional: 62, 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: 59.8ms, 97 PlacesBefore, 97 PlacesAfterwards, 108 TransitionsBefore, 108 TransitionsAfterwards, 730 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: 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] , 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: 71.4ms, 105 PlacesBefore, 105 PlacesAfterwards, 122 TransitionsBefore, 122 TransitionsAfterwards, 912 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 47 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 47, positive conditional: 0, positive unconditional: 47, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 47, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , 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: 123.8ms, 114 PlacesBefore, 114 PlacesAfterwards, 146 TransitionsBefore, 146 TransitionsAfterwards, 1048 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 162, positive: 162, positive conditional: 0, positive unconditional: 162, 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: 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] , Cache Queries: [ total: 162, positive: 162, positive conditional: 0, positive unconditional: 162, 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: 138.6ms, 123 PlacesBefore, 123 PlacesAfterwards, 142 TransitionsBefore, 142 TransitionsAfterwards, 1030 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 196 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 196, positive conditional: 0, positive unconditional: 196, 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: 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] , Cache Queries: [ total: 196, positive: 196, positive conditional: 0, positive unconditional: 196, 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: 327.7ms, 141 PlacesBefore, 141 PlacesAfterwards, 356 TransitionsBefore, 356 TransitionsAfterwards, 1712 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: 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] , 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: 1421.1ms, 152 PlacesBefore, 152 PlacesAfterwards, 545 TransitionsBefore, 545 TransitionsAfterwards, 2560 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: 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] , 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: 1316.7ms, 160 PlacesBefore, 160 PlacesAfterwards, 583 TransitionsBefore, 583 TransitionsAfterwards, 2636 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: 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] , 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: 3637.9ms, 203 PlacesBefore, 203 PlacesAfterwards, 1268 TransitionsBefore, 1268 TransitionsAfterwards, 4070 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: 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] , 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: 4078.9ms, 216 PlacesBefore, 216 PlacesAfterwards, 1381 TransitionsBefore, 1381 TransitionsAfterwards, 4414 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: 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] , 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: 21057.4ms, 259 PlacesBefore, 246 PlacesAfterwards, 3664 TransitionsBefore, 3664 TransitionsAfterwards, 8614 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: 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] , 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: 10137.0ms, 231 PlacesBefore, 228 PlacesAfterwards, 2632 TransitionsBefore, 2632 TransitionsAfterwards, 6346 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: 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] , 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: 11839.1ms, 232 PlacesBefore, 229 PlacesAfterwards, 2867 TransitionsBefore, 2867 TransitionsAfterwards, 6858 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: 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] , 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: 17166.2ms, 250 PlacesBefore, 250 PlacesAfterwards, 3213 TransitionsBefore, 3213 TransitionsAfterwards, 7620 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: 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] , 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: 44251.5ms, 274 PlacesBefore, 274 PlacesAfterwards, 4587 TransitionsBefore, 4587 TransitionsAfterwards, 10890 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: 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] , 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: 66926.0ms, 305 PlacesBefore, 303 PlacesAfterwards, 4795 TransitionsBefore, 4795 TransitionsAfterwards, 11386 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 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] , 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 - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 68). Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was enhancing Floyd-Hoare automaton (17states, 14/61 universal loopers) in iteration 28,while PetriNetUnfolder was constructing finite prefix that currently has 815365 conditions, 54991 events (29827/54990 cut-off events. For 4529720/4529726 co-relation queries the response was YES. Maximal size of possible extension queue 3155. Compared 568080 event pairs, 3329 based on Foata normal form. 10/55816 useless extension candidates. Maximal degree in co-relation 814498. Up to 48449 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 7.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: TIMEOUT, OverallTime: 839271.5ms, OverallIterations: 28, TraceHistogramMax: 2, EmptinessCheckTime: 0.0ms, AutomataDifference: 645845.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 262.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 271 SDtfs, 1349 SDslu, 167 SDs, 0 SdLazy, 7290 SolverSat, 737 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3110.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 277 SyntacticMatches, 15 SemanticMatches, 337 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 3438.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=151240occurred in iteration=27, InterpolantAutomatonStates: 273, 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: 115.3ms SsaConstructionTime, 349.6ms SatisfiabilityAnalysisTime, 4058.9ms InterpolantComputationTime, 809 NumberOfCodeBlocks, 809 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 759 ConstructedInterpolants, 0 QuantifiedInterpolants, 8164 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1419 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 50 InterpolantComputations, 6 PerfectInterpolantSequences, 75/223 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