/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-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 14:52:22,450 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 14:52:22,452 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 14:52:22,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 14:52:22,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 14:52:22,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 14:52:22,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 14:52:22,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 14:52:22,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 14:52:22,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 14:52:22,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 14:52:22,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 14:52:22,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 14:52:22,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 14:52:22,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 14:52:22,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 14:52:22,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 14:52:22,552 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 14:52:22,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 14:52:22,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 14:52:22,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 14:52:22,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 14:52:22,567 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 14:52:22,568 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 14:52:22,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 14:52:22,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 14:52:22,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 14:52:22,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 14:52:22,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 14:52:22,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 14:52:22,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 14:52:22,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 14:52:22,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 14:52:22,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 14:52:22,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 14:52:22,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 14:52:22,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 14:52:22,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 14:52:22,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 14:52:22,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 14:52:22,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 14:52:22,583 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-NoLbe-After.epf [2022-01-19 14:52:22,612 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 14:52:22,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 14:52:22,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 14:52:22,614 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 14:52:22,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 14:52:22,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 14:52:22,614 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 14:52:22,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 14:52:22,615 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 14:52:22,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 14:52:22,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 14:52:22,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 14:52:22,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 14:52:22,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 14:52:22,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 14:52:22,616 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 14:52:22,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 14:52:22,616 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 14:52:22,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 14:52:22,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 14:52:22,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 14:52:22,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 14:52:22,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 14:52:22,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 14:52:22,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 14:52:22,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 14:52:22,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 14:52:22,619 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 14:52:22,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 14:52:22,619 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 14:52:22,619 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 14:52:22,619 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 14:52:22,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-01-19 14:52:22,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 14:52:22,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 14:52:22,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 14:52:22,835 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 14:52:22,836 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 14:52:22,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-01-19 14:52:22,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a4aaa93/c817aa3056d14536a3ea7d364d17efd5/FLAGaa9b55fcc [2022-01-19 14:52:23,220 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 14:52:23,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-01-19 14:52:23,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a4aaa93/c817aa3056d14536a3ea7d364d17efd5/FLAGaa9b55fcc [2022-01-19 14:52:23,635 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45a4aaa93/c817aa3056d14536a3ea7d364d17efd5 [2022-01-19 14:52:23,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 14:52:23,638 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 14:52:23,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 14:52:23,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 14:52:23,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 14:52:23,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c8e011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23, skipping insertion in model container [2022-01-19 14:52:23,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 14:52:23,667 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 14:52:23,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-01-19 14:52:23,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 14:52:23,829 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 14:52:23,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c[2611,2624] [2022-01-19 14:52:23,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 14:52:23,862 INFO L208 MainTranslator]: Completed translation [2022-01-19 14:52:23,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23 WrapperNode [2022-01-19 14:52:23,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 14:52:23,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 14:52:23,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 14:52:23,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 14:52:23,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,899 INFO L137 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2022-01-19 14:52:23,899 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 14:52:23,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 14:52:23,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 14:52:23,900 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 14:52:23,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,920 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 14:52:23,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 14:52:23,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 14:52:23,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 14:52:23,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (1/1) ... [2022-01-19 14:52:23,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 14:52:23,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:52:23,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 14:52:23,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 14:52:23,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 14:52:23,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 14:52:23,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 14:52:23,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 14:52:23,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 14:52:23,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 14:52:23,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 14:52:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 14:52:23,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 14:52:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 14:52:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 14:52:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 14:52:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 14:52:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 14:52:23,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 14:52:23,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 14:52:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 14:52:23,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 14:52:23,987 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 14:52:24,049 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 14:52:24,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 14:52:24,233 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 14:52:24,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 14:52:24,315 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 14:52:24,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:52:24 BoogieIcfgContainer [2022-01-19 14:52:24,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 14:52:24,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 14:52:24,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 14:52:24,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 14:52:24,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 02:52:23" (1/3) ... [2022-01-19 14:52:24,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7384f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:52:24, skipping insertion in model container [2022-01-19 14:52:24,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:52:23" (2/3) ... [2022-01-19 14:52:24,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7384f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:52:24, skipping insertion in model container [2022-01-19 14:52:24,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:52:24" (3/3) ... [2022-01-19 14:52:24,343 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-01-19 14:52:24,349 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 14:52:24,349 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 14:52:24,349 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 14:52:24,404 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,405 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,405 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,405 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,405 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,405 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,406 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,406 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,407 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,408 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,408 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,408 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,408 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,408 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,408 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,411 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,411 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,412 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,412 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,412 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,412 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,412 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,412 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,413 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,413 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,413 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,413 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,416 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,416 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,416 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,417 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,418 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,418 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,418 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,418 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,419 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,419 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,432 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,434 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:52:24,440 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 14:52:24,501 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 14:52:24,512 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 14:52:24,512 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 14:52:24,529 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 131 transitions, 294 flow [2022-01-19 14:52:24,603 INFO L129 PetriNetUnfolder]: 10/127 cut-off events. [2022-01-19 14:52:24,604 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 14:52:24,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 127 events. 10/127 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-01-19 14:52:24,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 131 transitions, 294 flow [2022-01-19 14:52:24,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 114 transitions, 252 flow [2022-01-19 14:52:24,665 INFO L129 PetriNetUnfolder]: 10/113 cut-off events. [2022-01-19 14:52:24,665 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 14:52:24,666 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:24,666 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:24,667 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:24,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1069838279, now seen corresponding path program 1 times [2022-01-19 14:52:24,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:24,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174274744] [2022-01-19 14:52:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:24,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:24,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:24,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174274744] [2022-01-19 14:52:24,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174274744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:24,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:52:24,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 14:52:24,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761885100] [2022-01-19 14:52:24,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:24,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 14:52:24,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:25,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 14:52:25,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 14:52:25,020 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 131 [2022-01-19 14:52:25,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 114 transitions, 252 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:25,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 131 [2022-01-19 14:52:25,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:25,098 INFO L129 PetriNetUnfolder]: 16/120 cut-off events. [2022-01-19 14:52:25,098 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 14:52:25,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 120 events. 16/120 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 18/132 useless extension candidates. Maximal degree in co-relation 98. Up to 25 conditions per place. [2022-01-19 14:52:25,102 INFO L132 encePairwiseOnDemand]: 125/131 looper letters, 12 selfloop transitions, 0 changer transitions 2/108 dead transitions. [2022-01-19 14:52:25,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 264 flow [2022-01-19 14:52:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 14:52:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 14:52:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2022-01-19 14:52:25,117 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2022-01-19 14:52:25,118 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 242 transitions. [2022-01-19 14:52:25,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 242 transitions. [2022-01-19 14:52:25,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:25,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 242 transitions. [2022-01-19 14:52:25,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 121.0) internal successors, (242), 2 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,135 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,137 INFO L186 Difference]: Start difference. First operand has 117 places, 114 transitions, 252 flow. Second operand 2 states and 242 transitions. [2022-01-19 14:52:25,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 264 flow [2022-01-19 14:52:25,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 108 transitions, 248 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 14:52:25,146 INFO L242 Difference]: Finished difference. Result has 110 places, 106 transitions, 220 flow [2022-01-19 14:52:25,148 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=220, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2022-01-19 14:52:25,153 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -7 predicate places. [2022-01-19 14:52:25,153 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 220 flow [2022-01-19 14:52:25,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,154 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:25,154 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:25,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 14:52:25,155 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:25,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:25,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1574494246, now seen corresponding path program 1 times [2022-01-19 14:52:25,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:25,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384005490] [2022-01-19 14:52:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:25,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:25,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:25,435 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:25,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384005490] [2022-01-19 14:52:25,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384005490] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:25,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:52:25,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 14:52:25,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717886563] [2022-01-19 14:52:25,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:25,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 14:52:25,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 14:52:25,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 14:52:25,444 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2022-01-19 14:52:25,445 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,445 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:25,445 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2022-01-19 14:52:25,445 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:25,603 INFO L129 PetriNetUnfolder]: 23/173 cut-off events. [2022-01-19 14:52:25,603 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 14:52:25,604 INFO L84 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 173 events. 23/173 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 225 event pairs, 0 based on Foata normal form. 9/174 useless extension candidates. Maximal degree in co-relation 231. Up to 36 conditions per place. [2022-01-19 14:52:25,605 INFO L132 encePairwiseOnDemand]: 123/131 looper letters, 25 selfloop transitions, 3 changer transitions 5/118 dead transitions. [2022-01-19 14:52:25,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 317 flow [2022-01-19 14:52:25,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 14:52:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 14:52:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2022-01-19 14:52:25,611 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8259541984732824 [2022-01-19 14:52:25,611 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2022-01-19 14:52:25,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2022-01-19 14:52:25,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:25,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2022-01-19 14:52:25,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,618 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,618 INFO L186 Difference]: Start difference. First operand has 110 places, 106 transitions, 220 flow. Second operand 5 states and 541 transitions. [2022-01-19 14:52:25,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 317 flow [2022-01-19 14:52:25,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 118 transitions, 317 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 14:52:25,622 INFO L242 Difference]: Finished difference. Result has 115 places, 108 transitions, 247 flow [2022-01-19 14:52:25,622 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=115, PETRI_TRANSITIONS=108} [2022-01-19 14:52:25,623 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2022-01-19 14:52:25,623 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 247 flow [2022-01-19 14:52:25,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,624 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:25,625 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:25,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 14:52:25,625 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash -575216244, now seen corresponding path program 1 times [2022-01-19 14:52:25,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:25,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716185037] [2022-01-19 14:52:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:25,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:25,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:25,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716185037] [2022-01-19 14:52:25,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716185037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:25,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:52:25,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 14:52:25,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358403604] [2022-01-19 14:52:25,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:25,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 14:52:25,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:25,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 14:52:25,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-19 14:52:25,945 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 14:52:25,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 108 transitions, 247 flow. Second operand has 9 states, 9 states have (on average 87.55555555555556) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:25,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:25,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 14:52:25,946 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:26,626 INFO L129 PetriNetUnfolder]: 2030/3464 cut-off events. [2022-01-19 14:52:26,627 INFO L130 PetriNetUnfolder]: For 591/703 co-relation queries the response was YES. [2022-01-19 14:52:26,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7351 conditions, 3464 events. 2030/3464 cut-off events. For 591/703 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20192 event pairs, 486 based on Foata normal form. 0/2481 useless extension candidates. Maximal degree in co-relation 7344. Up to 782 conditions per place. [2022-01-19 14:52:26,653 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 107 selfloop transitions, 12 changer transitions 0/187 dead transitions. [2022-01-19 14:52:26,653 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 187 transitions, 714 flow [2022-01-19 14:52:26,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 14:52:26,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 14:52:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 874 transitions. [2022-01-19 14:52:26,656 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741306191687871 [2022-01-19 14:52:26,656 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 874 transitions. [2022-01-19 14:52:26,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 874 transitions. [2022-01-19 14:52:26,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:26,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 874 transitions. [2022-01-19 14:52:26,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.11111111111111) internal successors, (874), 9 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:26,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:26,662 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:26,662 INFO L186 Difference]: Start difference. First operand has 115 places, 108 transitions, 247 flow. Second operand 9 states and 874 transitions. [2022-01-19 14:52:26,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 187 transitions, 714 flow [2022-01-19 14:52:26,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 187 transitions, 694 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-01-19 14:52:26,668 INFO L242 Difference]: Finished difference. Result has 122 places, 114 transitions, 315 flow [2022-01-19 14:52:26,668 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=315, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2022-01-19 14:52:26,669 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2022-01-19 14:52:26,669 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 315 flow [2022-01-19 14:52:26,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 87.55555555555556) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:26,670 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:26,670 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:26,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 14:52:26,670 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:26,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1075191398, now seen corresponding path program 2 times [2022-01-19 14:52:26,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:26,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619908000] [2022-01-19 14:52:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:26,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:26,882 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:26,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619908000] [2022-01-19 14:52:26,883 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619908000] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:52:26,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161449043] [2022-01-19 14:52:26,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 14:52:26,883 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:26,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:52:26,885 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:52:26,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 14:52:26,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 14:52:26,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:52:26,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 14:52:26,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:52:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:27,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 14:52:27,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161449043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:27,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 14:52:27,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-01-19 14:52:27,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647396519] [2022-01-19 14:52:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:27,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:52:27,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:27,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:52:27,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-01-19 14:52:27,470 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 14:52:27,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 315 flow. Second operand has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:27,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:27,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 14:52:27,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:27,768 INFO L129 PetriNetUnfolder]: 319/720 cut-off events. [2022-01-19 14:52:27,769 INFO L130 PetriNetUnfolder]: For 450/462 co-relation queries the response was YES. [2022-01-19 14:52:27,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 720 events. 319/720 cut-off events. For 450/462 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3038 event pairs, 66 based on Foata normal form. 5/644 useless extension candidates. Maximal degree in co-relation 1777. Up to 233 conditions per place. [2022-01-19 14:52:27,775 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 50 selfloop transitions, 12 changer transitions 0/138 dead transitions. [2022-01-19 14:52:27,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 138 transitions, 522 flow [2022-01-19 14:52:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 14:52:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 14:52:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 975 transitions. [2022-01-19 14:52:27,778 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7442748091603053 [2022-01-19 14:52:27,778 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 975 transitions. [2022-01-19 14:52:27,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 975 transitions. [2022-01-19 14:52:27,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:27,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 975 transitions. [2022-01-19 14:52:27,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 97.5) internal successors, (975), 10 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:27,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:27,784 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:27,784 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 315 flow. Second operand 10 states and 975 transitions. [2022-01-19 14:52:27,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 138 transitions, 522 flow [2022-01-19 14:52:27,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 138 transitions, 513 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 14:52:27,789 INFO L242 Difference]: Finished difference. Result has 130 places, 117 transitions, 357 flow [2022-01-19 14:52:27,789 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=357, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2022-01-19 14:52:27,790 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 13 predicate places. [2022-01-19 14:52:27,790 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 357 flow [2022-01-19 14:52:27,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:27,790 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:27,791 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:27,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 14:52:28,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:28,015 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash -956916982, now seen corresponding path program 1 times [2022-01-19 14:52:28,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:28,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694519106] [2022-01-19 14:52:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:28,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:28,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:28,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:28,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694519106] [2022-01-19 14:52:28,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694519106] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:28,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:52:28,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 14:52:28,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690073316] [2022-01-19 14:52:28,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:28,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:52:28,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:28,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:52:28,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 14:52:28,193 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 14:52:28,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 357 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:28,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:28,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 14:52:28,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:28,731 INFO L129 PetriNetUnfolder]: 1977/3728 cut-off events. [2022-01-19 14:52:28,731 INFO L130 PetriNetUnfolder]: For 3939/4031 co-relation queries the response was YES. [2022-01-19 14:52:28,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9520 conditions, 3728 events. 1977/3728 cut-off events. For 3939/4031 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 24754 event pairs, 649 based on Foata normal form. 2/3138 useless extension candidates. Maximal degree in co-relation 9508. Up to 1083 conditions per place. [2022-01-19 14:52:28,761 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 98 selfloop transitions, 15 changer transitions 6/187 dead transitions. [2022-01-19 14:52:28,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 187 transitions, 870 flow [2022-01-19 14:52:28,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 14:52:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 14:52:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2022-01-19 14:52:28,765 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7229007633587786 [2022-01-19 14:52:28,765 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 947 transitions. [2022-01-19 14:52:28,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 947 transitions. [2022-01-19 14:52:28,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:28,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 947 transitions. [2022-01-19 14:52:28,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.7) internal successors, (947), 10 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:28,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:28,770 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:28,770 INFO L186 Difference]: Start difference. First operand has 130 places, 117 transitions, 357 flow. Second operand 10 states and 947 transitions. [2022-01-19 14:52:28,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 187 transitions, 870 flow [2022-01-19 14:52:28,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 187 transitions, 854 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 14:52:28,780 INFO L242 Difference]: Finished difference. Result has 135 places, 121 transitions, 403 flow [2022-01-19 14:52:28,780 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=403, PETRI_PLACES=135, PETRI_TRANSITIONS=121} [2022-01-19 14:52:28,781 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2022-01-19 14:52:28,781 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 121 transitions, 403 flow [2022-01-19 14:52:28,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:28,781 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:28,782 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:28,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 14:52:28,782 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:28,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:28,782 INFO L85 PathProgramCache]: Analyzing trace with hash 158599598, now seen corresponding path program 2 times [2022-01-19 14:52:28,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:28,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475332622] [2022-01-19 14:52:28,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:28,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:28,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:28,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475332622] [2022-01-19 14:52:28,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475332622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:28,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:52:28,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 14:52:28,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334649504] [2022-01-19 14:52:28,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:28,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:52:28,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:28,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:52:28,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 14:52:28,922 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 14:52:28,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 121 transitions, 403 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:28,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:28,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 14:52:28,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:29,542 INFO L129 PetriNetUnfolder]: 2339/4309 cut-off events. [2022-01-19 14:52:29,543 INFO L130 PetriNetUnfolder]: For 5757/5798 co-relation queries the response was YES. [2022-01-19 14:52:29,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11975 conditions, 4309 events. 2339/4309 cut-off events. For 5757/5798 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 28423 event pairs, 551 based on Foata normal form. 5/3832 useless extension candidates. Maximal degree in co-relation 11961. Up to 1307 conditions per place. [2022-01-19 14:52:29,580 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 102 selfloop transitions, 19 changer transitions 6/195 dead transitions. [2022-01-19 14:52:29,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 195 transitions, 980 flow [2022-01-19 14:52:29,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 14:52:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 14:52:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2022-01-19 14:52:29,584 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7251908396946565 [2022-01-19 14:52:29,584 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 950 transitions. [2022-01-19 14:52:29,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 950 transitions. [2022-01-19 14:52:29,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:29,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 950 transitions. [2022-01-19 14:52:29,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.0) internal successors, (950), 10 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:29,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:29,589 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:29,589 INFO L186 Difference]: Start difference. First operand has 135 places, 121 transitions, 403 flow. Second operand 10 states and 950 transitions. [2022-01-19 14:52:29,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 195 transitions, 980 flow [2022-01-19 14:52:29,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 195 transitions, 959 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 14:52:29,601 INFO L242 Difference]: Finished difference. Result has 140 places, 128 transitions, 490 flow [2022-01-19 14:52:29,601 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=490, PETRI_PLACES=140, PETRI_TRANSITIONS=128} [2022-01-19 14:52:29,602 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2022-01-19 14:52:29,602 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 490 flow [2022-01-19 14:52:29,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:29,602 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:29,602 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:29,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 14:52:29,603 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:29,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1067075906, now seen corresponding path program 3 times [2022-01-19 14:52:29,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:29,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45664395] [2022-01-19 14:52:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:29,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:29,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:29,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:29,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45664395] [2022-01-19 14:52:29,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45664395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:29,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:52:29,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 14:52:29,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442251188] [2022-01-19 14:52:29,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:29,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:52:29,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:29,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:52:29,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-19 14:52:29,758 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 14:52:29,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 128 transitions, 490 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:29,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:29,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 14:52:29,760 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:30,341 INFO L129 PetriNetUnfolder]: 2280/4136 cut-off events. [2022-01-19 14:52:30,341 INFO L130 PetriNetUnfolder]: For 7452/7576 co-relation queries the response was YES. [2022-01-19 14:52:30,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12574 conditions, 4136 events. 2280/4136 cut-off events. For 7452/7576 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 26533 event pairs, 1099 based on Foata normal form. 14/3705 useless extension candidates. Maximal degree in co-relation 12558. Up to 1831 conditions per place. [2022-01-19 14:52:30,389 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 83 selfloop transitions, 14 changer transitions 10/175 dead transitions. [2022-01-19 14:52:30,390 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 913 flow [2022-01-19 14:52:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 14:52:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 14:52:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 759 transitions. [2022-01-19 14:52:30,392 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7242366412213741 [2022-01-19 14:52:30,392 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 759 transitions. [2022-01-19 14:52:30,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 759 transitions. [2022-01-19 14:52:30,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:30,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 759 transitions. [2022-01-19 14:52:30,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.875) internal successors, (759), 8 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:30,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:30,397 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:30,397 INFO L186 Difference]: Start difference. First operand has 140 places, 128 transitions, 490 flow. Second operand 8 states and 759 transitions. [2022-01-19 14:52:30,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 175 transitions, 913 flow [2022-01-19 14:52:30,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 175 transitions, 899 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 14:52:30,410 INFO L242 Difference]: Finished difference. Result has 143 places, 128 transitions, 508 flow [2022-01-19 14:52:30,410 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=508, PETRI_PLACES=143, PETRI_TRANSITIONS=128} [2022-01-19 14:52:30,411 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2022-01-19 14:52:30,411 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 128 transitions, 508 flow [2022-01-19 14:52:30,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:30,412 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:30,412 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:30,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 14:52:30,412 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:30,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:30,413 INFO L85 PathProgramCache]: Analyzing trace with hash 616937690, now seen corresponding path program 4 times [2022-01-19 14:52:30,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:30,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083908567] [2022-01-19 14:52:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:30,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:30,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:30,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083908567] [2022-01-19 14:52:30,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083908567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:30,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:52:30,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 14:52:30,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183004367] [2022-01-19 14:52:30,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:30,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:52:30,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:30,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:52:30,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-19 14:52:30,577 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 14:52:30,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 128 transitions, 508 flow. Second operand has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:30,578 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:30,578 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 14:52:30,578 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:31,292 INFO L129 PetriNetUnfolder]: 3385/6203 cut-off events. [2022-01-19 14:52:31,292 INFO L130 PetriNetUnfolder]: For 13151/13207 co-relation queries the response was YES. [2022-01-19 14:52:31,318 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19013 conditions, 6203 events. 3385/6203 cut-off events. For 13151/13207 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 43759 event pairs, 917 based on Foata normal form. 25/5649 useless extension candidates. Maximal degree in co-relation 18996. Up to 2198 conditions per place. [2022-01-19 14:52:31,353 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 118 selfloop transitions, 26 changer transitions 1/213 dead transitions. [2022-01-19 14:52:31,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 213 transitions, 1284 flow [2022-01-19 14:52:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 14:52:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 14:52:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 945 transitions. [2022-01-19 14:52:31,356 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7213740458015268 [2022-01-19 14:52:31,356 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 945 transitions. [2022-01-19 14:52:31,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 945 transitions. [2022-01-19 14:52:31,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:31,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 945 transitions. [2022-01-19 14:52:31,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.5) internal successors, (945), 10 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:31,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:31,361 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:31,361 INFO L186 Difference]: Start difference. First operand has 143 places, 128 transitions, 508 flow. Second operand 10 states and 945 transitions. [2022-01-19 14:52:31,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 213 transitions, 1284 flow [2022-01-19 14:52:31,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 213 transitions, 1253 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-01-19 14:52:31,376 INFO L242 Difference]: Finished difference. Result has 149 places, 143 transitions, 684 flow [2022-01-19 14:52:31,376 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=684, PETRI_PLACES=149, PETRI_TRANSITIONS=143} [2022-01-19 14:52:31,376 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2022-01-19 14:52:31,377 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 684 flow [2022-01-19 14:52:31,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.0) internal successors, (704), 8 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:31,377 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:31,377 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:31,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 14:52:31,377 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash 721298320, now seen corresponding path program 5 times [2022-01-19 14:52:31,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:31,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625893775] [2022-01-19 14:52:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:31,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:31,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:31,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625893775] [2022-01-19 14:52:31,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625893775] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:52:31,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577538392] [2022-01-19 14:52:31,502 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 14:52:31,502 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:31,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:52:31,503 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:52:31,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 14:52:31,610 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 14:52:31,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:52:31,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 14:52:31,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:52:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:32,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:52:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:32,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577538392] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 14:52:32,329 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 14:52:32,329 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2022-01-19 14:52:32,329 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651637986] [2022-01-19 14:52:32,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:32,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:52:32,330 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:52:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-01-19 14:52:32,331 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 14:52:32,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 143 transitions, 684 flow. Second operand has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:32,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:32,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 14:52:32,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:32,761 INFO L129 PetriNetUnfolder]: 1279/3099 cut-off events. [2022-01-19 14:52:32,761 INFO L130 PetriNetUnfolder]: For 7636/8046 co-relation queries the response was YES. [2022-01-19 14:52:32,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10184 conditions, 3099 events. 1279/3099 cut-off events. For 7636/8046 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23008 event pairs, 218 based on Foata normal form. 68/2986 useless extension candidates. Maximal degree in co-relation 10165. Up to 966 conditions per place. [2022-01-19 14:52:32,793 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 92 selfloop transitions, 21 changer transitions 7/200 dead transitions. [2022-01-19 14:52:32,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 200 transitions, 1305 flow [2022-01-19 14:52:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 14:52:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 14:52:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 993 transitions. [2022-01-19 14:52:32,796 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7580152671755725 [2022-01-19 14:52:32,796 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 993 transitions. [2022-01-19 14:52:32,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 993 transitions. [2022-01-19 14:52:32,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:32,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 993 transitions. [2022-01-19 14:52:32,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.3) internal successors, (993), 10 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:32,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:32,801 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:32,801 INFO L186 Difference]: Start difference. First operand has 149 places, 143 transitions, 684 flow. Second operand 10 states and 993 transitions. [2022-01-19 14:52:32,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 200 transitions, 1305 flow [2022-01-19 14:52:32,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 200 transitions, 1287 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-01-19 14:52:32,813 INFO L242 Difference]: Finished difference. Result has 154 places, 147 transitions, 784 flow [2022-01-19 14:52:32,813 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=784, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2022-01-19 14:52:32,814 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2022-01-19 14:52:32,814 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 784 flow [2022-01-19 14:52:32,814 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.25) internal successors, (762), 8 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:32,814 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:32,814 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:32,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 14:52:33,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-01-19 14:52:33,028 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:33,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash -741365418, now seen corresponding path program 1 times [2022-01-19 14:52:33,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:33,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888286052] [2022-01-19 14:52:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:33,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:33,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:33,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888286052] [2022-01-19 14:52:33,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888286052] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:52:33,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071599826] [2022-01-19 14:52:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:33,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:33,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:52:33,160 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:52:33,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 14:52:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:33,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 14:52:33,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:52:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:33,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:52:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:33,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071599826] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:52:33,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:52:33,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2022-01-19 14:52:33,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078028441] [2022-01-19 14:52:33,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:52:33,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 14:52:33,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:33,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 14:52:33,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-19 14:52:33,632 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2022-01-19 14:52:33,633 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 784 flow. Second operand has 13 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:33,633 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:33,633 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2022-01-19 14:52:33,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:34,963 INFO L129 PetriNetUnfolder]: 6226/11076 cut-off events. [2022-01-19 14:52:34,963 INFO L130 PetriNetUnfolder]: For 41315/41315 co-relation queries the response was YES. [2022-01-19 14:52:35,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41208 conditions, 11076 events. 6226/11076 cut-off events. For 41315/41315 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 85950 event pairs, 994 based on Foata normal form. 886/11748 useless extension candidates. Maximal degree in co-relation 41188. Up to 2575 conditions per place. [2022-01-19 14:52:35,079 INFO L132 encePairwiseOnDemand]: 115/131 looper letters, 177 selfloop transitions, 55 changer transitions 21/320 dead transitions. [2022-01-19 14:52:35,079 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 320 transitions, 2270 flow [2022-01-19 14:52:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 14:52:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 14:52:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1787 transitions. [2022-01-19 14:52:35,083 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7179590196866211 [2022-01-19 14:52:35,083 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1787 transitions. [2022-01-19 14:52:35,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1787 transitions. [2022-01-19 14:52:35,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:35,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1787 transitions. [2022-01-19 14:52:35,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 94.05263157894737) internal successors, (1787), 19 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:35,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 131.0) internal successors, (2620), 20 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:35,092 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 131.0) internal successors, (2620), 20 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:35,092 INFO L186 Difference]: Start difference. First operand has 154 places, 147 transitions, 784 flow. Second operand 19 states and 1787 transitions. [2022-01-19 14:52:35,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 320 transitions, 2270 flow [2022-01-19 14:52:35,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 320 transitions, 2233 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-01-19 14:52:35,128 INFO L242 Difference]: Finished difference. Result has 178 places, 171 transitions, 1207 flow [2022-01-19 14:52:35,129 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1207, PETRI_PLACES=178, PETRI_TRANSITIONS=171} [2022-01-19 14:52:35,130 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2022-01-19 14:52:35,130 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 171 transitions, 1207 flow [2022-01-19 14:52:35,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 88.38461538461539) internal successors, (1149), 13 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:35,131 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:35,131 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:35,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 14:52:35,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:35,347 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash 432141502, now seen corresponding path program 1 times [2022-01-19 14:52:35,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:35,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673513800] [2022-01-19 14:52:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:35,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:35,497 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:35,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673513800] [2022-01-19 14:52:35,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673513800] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:52:35,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303556312] [2022-01-19 14:52:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:35,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:35,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:52:35,498 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:52:35,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 14:52:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:35,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 14:52:35,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:52:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 14:52:36,089 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:52:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 14:52:36,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303556312] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 14:52:36,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 14:52:36,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2022-01-19 14:52:36,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649158063] [2022-01-19 14:52:36,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:36,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:52:36,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:52:36,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-01-19 14:52:36,419 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 14:52:36,419 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 171 transitions, 1207 flow. Second operand has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:36,420 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:36,420 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 14:52:36,420 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:37,157 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][153], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 7#L41true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), 35#L52true, Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:52:37,157 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 14:52:37,157 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:52:37,157 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:52:37,157 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:52:37,203 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter~0_80) 1 0)) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= v_~i2~0_24 (+ v_~i2~0_25 1)) (= (+ v_~counter~0_79 1) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_80, ~i2~0=v_~i2~0_25} OutVars{~counter~0=v_~counter~0_79, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~i2~0=v_~i2~0_24, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][82], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 30#L75true, 553#true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 137#true, 1202#(= ~i1~0 0), 155#(= ~i1~0 0), 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 7#L41true, 539#(= ~i1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:52:37,204 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 14:52:37,204 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:52:37,204 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:52:37,204 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:52:37,230 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][153], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 82#L74-1true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), 35#L52true, Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:52:37,231 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 14:52:37,231 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:52:37,231 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,231 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,232 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][171], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 30#L75true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 7#L41true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2509#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), 35#L52true, Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:52:37,232 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 14:52:37,232 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:52:37,232 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,232 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,276 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][130], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 30#L75true, 553#true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 32#L51-1true, 573#true, 137#true, 65#L44true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:52:37,276 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 14:52:37,276 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:52:37,276 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:52:37,277 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:52:37,279 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][153], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 35#L52true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:52:37,279 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 14:52:37,279 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:52:37,279 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:52:37,279 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:52:37,334 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][153], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 82#L74-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 555#(= ~j1~0 0), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 35#L52true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:52:37,334 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 14:52:37,334 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,334 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,334 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,335 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][171], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 30#L75true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 137#true, 69#L98-4true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 555#(= ~j1~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 2509#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 35#L52true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:52:37,335 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 14:52:37,335 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,335 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,335 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:52:37,406 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][264], [Black: 1840#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 30#L75true, 553#true, Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), 32#L51-1true, 573#true, 137#true, 69#L98-4true, 65#L44true, Black: 533#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 1357#(= (+ ~counter~0 (- 1)) 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 161#(and (<= 1 ~N2~0) (= ~i2~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 2509#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 492#(and (<= ~i2~0 0) (<= ~N1~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 85#L63-1true, Black: 1830#(and (= ~i1~0 0) (= ~j1~0 0) (<= ~N1~0 ~M1~0) (= ~counter~0 0) (<= (+ ~i1~0 1) ~M1~0)), Black: 1842#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 1844#(and (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 555#(= ~j1~0 0), Black: 1838#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:52:37,406 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 14:52:37,406 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 14:52:37,406 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:52:37,406 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:52:37,867 INFO L129 PetriNetUnfolder]: 5683/11760 cut-off events. [2022-01-19 14:52:37,867 INFO L130 PetriNetUnfolder]: For 88476/89679 co-relation queries the response was YES. [2022-01-19 14:52:37,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53264 conditions, 11760 events. 5683/11760 cut-off events. For 88476/89679 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 105912 event pairs, 969 based on Foata normal form. 258/11125 useless extension candidates. Maximal degree in co-relation 53232. Up to 3992 conditions per place. [2022-01-19 14:52:37,997 INFO L132 encePairwiseOnDemand]: 120/131 looper letters, 200 selfloop transitions, 25 changer transitions 2/308 dead transitions. [2022-01-19 14:52:37,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 308 transitions, 3138 flow [2022-01-19 14:52:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 14:52:37,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 14:52:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 996 transitions. [2022-01-19 14:52:38,000 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7603053435114504 [2022-01-19 14:52:38,000 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 996 transitions. [2022-01-19 14:52:38,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 996 transitions. [2022-01-19 14:52:38,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:38,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 996 transitions. [2022-01-19 14:52:38,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.6) internal successors, (996), 10 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:38,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:38,006 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:38,006 INFO L186 Difference]: Start difference. First operand has 178 places, 171 transitions, 1207 flow. Second operand 10 states and 996 transitions. [2022-01-19 14:52:38,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 308 transitions, 3138 flow [2022-01-19 14:52:38,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 308 transitions, 2847 flow, removed 85 selfloop flow, removed 14 redundant places. [2022-01-19 14:52:38,161 INFO L242 Difference]: Finished difference. Result has 171 places, 182 transitions, 1283 flow [2022-01-19 14:52:38,162 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1283, PETRI_PLACES=171, PETRI_TRANSITIONS=182} [2022-01-19 14:52:38,162 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 54 predicate places. [2022-01-19 14:52:38,162 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 182 transitions, 1283 flow [2022-01-19 14:52:38,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:38,162 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:38,163 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:38,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 14:52:38,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:38,380 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash -687977584, now seen corresponding path program 2 times [2022-01-19 14:52:38,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:38,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195462811] [2022-01-19 14:52:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:38,381 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:38,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:38,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195462811] [2022-01-19 14:52:38,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195462811] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:52:38,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162913792] [2022-01-19 14:52:38,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 14:52:38,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:38,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:52:38,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:52:38,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 14:52:38,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 14:52:38,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:52:38,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 14:52:38,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:52:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:39,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:52:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:39,557 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162913792] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:52:39,557 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:52:39,557 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-01-19 14:52:39,557 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955584551] [2022-01-19 14:52:39,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:52:39,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 14:52:39,558 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:39,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 14:52:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-01-19 14:52:39,560 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 14:52:39,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 182 transitions, 1283 flow. Second operand has 24 states, 24 states have (on average 87.83333333333333) internal successors, (2108), 24 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:39,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:39,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 14:52:39,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:45,702 INFO L129 PetriNetUnfolder]: 26368/50183 cut-off events. [2022-01-19 14:52:45,703 INFO L130 PetriNetUnfolder]: For 298653/298811 co-relation queries the response was YES. [2022-01-19 14:52:45,983 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211132 conditions, 50183 events. 26368/50183 cut-off events. For 298653/298811 co-relation queries the response was YES. Maximal size of possible extension queue 3044. Compared 521730 event pairs, 3922 based on Foata normal form. 2336/51932 useless extension candidates. Maximal degree in co-relation 211103. Up to 8499 conditions per place. [2022-01-19 14:52:46,298 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 558 selfloop transitions, 95 changer transitions 12/733 dead transitions. [2022-01-19 14:52:46,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 733 transitions, 8145 flow [2022-01-19 14:52:46,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-19 14:52:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-19 14:52:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2482 transitions. [2022-01-19 14:52:46,307 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7287140340575455 [2022-01-19 14:52:46,307 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2482 transitions. [2022-01-19 14:52:46,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2482 transitions. [2022-01-19 14:52:46,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:46,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2482 transitions. [2022-01-19 14:52:46,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 95.46153846153847) internal successors, (2482), 26 states have internal predecessors, (2482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:46,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 131.0) internal successors, (3537), 27 states have internal predecessors, (3537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:46,321 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 131.0) internal successors, (3537), 27 states have internal predecessors, (3537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:46,321 INFO L186 Difference]: Start difference. First operand has 171 places, 182 transitions, 1283 flow. Second operand 26 states and 2482 transitions. [2022-01-19 14:52:46,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 733 transitions, 8145 flow [2022-01-19 14:52:46,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 733 transitions, 7878 flow, removed 130 selfloop flow, removed 4 redundant places. [2022-01-19 14:52:46,762 INFO L242 Difference]: Finished difference. Result has 208 places, 245 transitions, 2344 flow [2022-01-19 14:52:46,762 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2344, PETRI_PLACES=208, PETRI_TRANSITIONS=245} [2022-01-19 14:52:46,762 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 91 predicate places. [2022-01-19 14:52:46,763 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 245 transitions, 2344 flow [2022-01-19 14:52:46,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 87.83333333333333) internal successors, (2108), 24 states have internal predecessors, (2108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:46,763 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:46,764 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:46,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-19 14:52:46,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 14:52:46,965 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash 982740406, now seen corresponding path program 3 times [2022-01-19 14:52:46,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:46,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035512153] [2022-01-19 14:52:46,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:46,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:47,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:47,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:47,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035512153] [2022-01-19 14:52:47,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035512153] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:52:47,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956892100] [2022-01-19 14:52:47,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 14:52:47,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:47,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:52:47,127 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:52:47,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 14:52:47,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 14:52:47,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:52:47,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 14:52:47,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:52:47,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-19 14:52:47,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 14:52:47,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956892100] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:47,700 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 14:52:47,700 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-01-19 14:52:47,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181044108] [2022-01-19 14:52:47,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:47,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:52:47,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:47,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:52:47,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-01-19 14:52:47,703 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 14:52:47,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 245 transitions, 2344 flow. Second operand has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:47,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:47,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 14:52:47,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:51,446 INFO L129 PetriNetUnfolder]: 10650/26189 cut-off events. [2022-01-19 14:52:51,446 INFO L130 PetriNetUnfolder]: For 313006/316351 co-relation queries the response was YES. [2022-01-19 14:52:51,641 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136539 conditions, 26189 events. 10650/26189 cut-off events. For 313006/316351 co-relation queries the response was YES. Maximal size of possible extension queue 1654. Compared 304488 event pairs, 3587 based on Foata normal form. 172/25010 useless extension candidates. Maximal degree in co-relation 136494. Up to 11500 conditions per place. [2022-01-19 14:52:51,785 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 156 selfloop transitions, 25 changer transitions 3/270 dead transitions. [2022-01-19 14:52:51,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 270 transitions, 3063 flow [2022-01-19 14:52:51,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 14:52:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 14:52:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2022-01-19 14:52:51,787 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7351145038167939 [2022-01-19 14:52:51,787 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2022-01-19 14:52:51,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2022-01-19 14:52:51,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:51,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2022-01-19 14:52:51,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:51,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:51,790 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:51,790 INFO L186 Difference]: Start difference. First operand has 208 places, 245 transitions, 2344 flow. Second operand 10 states and 963 transitions. [2022-01-19 14:52:51,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 270 transitions, 3063 flow [2022-01-19 14:52:52,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 270 transitions, 2842 flow, removed 84 selfloop flow, removed 9 redundant places. [2022-01-19 14:52:52,244 INFO L242 Difference]: Finished difference. Result has 204 places, 237 transitions, 2103 flow [2022-01-19 14:52:52,245 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2103, PETRI_PLACES=204, PETRI_TRANSITIONS=237} [2022-01-19 14:52:52,245 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 87 predicate places. [2022-01-19 14:52:52,245 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 237 transitions, 2103 flow [2022-01-19 14:52:52,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:52,245 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:52,246 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:52,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-19 14:52:52,459 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:52,459 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:52,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:52,460 INFO L85 PathProgramCache]: Analyzing trace with hash 822271266, now seen corresponding path program 2 times [2022-01-19 14:52:52,460 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:52,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976839541] [2022-01-19 14:52:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:52,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:52,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:52:52,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:52,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976839541] [2022-01-19 14:52:52,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976839541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:52:52,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:52:52,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 14:52:52,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554288065] [2022-01-19 14:52:52,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:52:52,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:52:52,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:52:52,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:52:52,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-19 14:52:52,604 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 14:52:52,604 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 237 transitions, 2103 flow. Second operand has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:52,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:52:52,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 14:52:52,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:52:57,996 INFO L129 PetriNetUnfolder]: 22812/40363 cut-off events. [2022-01-19 14:52:57,996 INFO L130 PetriNetUnfolder]: For 413664/413703 co-relation queries the response was YES. [2022-01-19 14:52:58,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 213869 conditions, 40363 events. 22812/40363 cut-off events. For 413664/413703 co-relation queries the response was YES. Maximal size of possible extension queue 2500. Compared 375455 event pairs, 13066 based on Foata normal form. 43/39806 useless extension candidates. Maximal degree in co-relation 213823. Up to 30527 conditions per place. [2022-01-19 14:52:58,772 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 169 selfloop transitions, 28 changer transitions 15/280 dead transitions. [2022-01-19 14:52:58,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 280 transitions, 3030 flow [2022-01-19 14:52:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 14:52:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 14:52:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 910 transitions. [2022-01-19 14:52:58,774 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6946564885496184 [2022-01-19 14:52:58,774 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 910 transitions. [2022-01-19 14:52:58,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 910 transitions. [2022-01-19 14:52:58,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:52:58,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 910 transitions. [2022-01-19 14:52:58,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:58,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:58,776 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 131.0) internal successors, (1441), 11 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:58,777 INFO L186 Difference]: Start difference. First operand has 204 places, 237 transitions, 2103 flow. Second operand 10 states and 910 transitions. [2022-01-19 14:52:58,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 280 transitions, 3030 flow [2022-01-19 14:52:59,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 280 transitions, 2949 flow, removed 8 selfloop flow, removed 12 redundant places. [2022-01-19 14:52:59,325 INFO L242 Difference]: Finished difference. Result has 200 places, 239 transitions, 2166 flow [2022-01-19 14:52:59,325 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1968, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2166, PETRI_PLACES=200, PETRI_TRANSITIONS=239} [2022-01-19 14:52:59,326 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 83 predicate places. [2022-01-19 14:52:59,326 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 239 transitions, 2166 flow [2022-01-19 14:52:59,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:52:59,326 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:52:59,326 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:52:59,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 14:52:59,326 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:52:59,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:52:59,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1431070086, now seen corresponding path program 1 times [2022-01-19 14:52:59,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:52:59,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586092464] [2022-01-19 14:52:59,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:59,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:52:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:52:59,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:52:59,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586092464] [2022-01-19 14:52:59,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586092464] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:52:59,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693733153] [2022-01-19 14:52:59,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:52:59,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:52:59,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:52:59,430 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:52:59,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 14:52:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:52:59,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 14:52:59,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:52:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:52:59,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:53:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:53:00,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693733153] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:53:00,061 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:53:00,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-01-19 14:53:00,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421529571] [2022-01-19 14:53:00,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:53:00,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 14:53:00,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:53:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 14:53:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 14:53:00,062 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2022-01-19 14:53:00,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 239 transitions, 2166 flow. Second operand has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:00,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:53:00,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2022-01-19 14:53:00,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:53:00,550 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 137#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 1894#(<= 0 ~i1~0), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 7#L41true, 58#L97-4true, 1357#(= (+ ~counter~0 (- 1)) 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 2551#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:00,550 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-01-19 14:53:00,550 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 14:53:00,550 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 14:53:00,550 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-01-19 14:53:00,561 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][174], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 1894#(<= 0 ~i1~0), 65#L44true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 58#L97-4true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 2551#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 85#L63-1true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:53:00,561 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-01-19 14:53:00,561 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 14:53:00,561 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-01-19 14:53:00,561 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 14:53:00,911 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][232], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 35#L52true, 3550#true, 520#(= ~i2~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:00,912 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 14:53:00,912 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 14:53:00,912 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 14:53:00,912 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 14:53:00,914 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][146], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 3550#true, 35#L52true, 520#(= ~i2~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:00,914 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-01-19 14:53:00,914 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:00,914 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:00,914 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:00,997 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][179], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 520#(= ~i2~0 0)]) [2022-01-19 14:53:00,998 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-01-19 14:53:00,998 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:00,998 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:00,998 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:01,046 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][237], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,046 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-01-19 14:53:01,046 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-01-19 14:53:01,046 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-01-19 14:53:01,046 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-01-19 14:53:01,213 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,213 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,213 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,213 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:01,213 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:01,266 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][237], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,266 INFO L384 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-01-19 14:53:01,266 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-01-19 14:53:01,266 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-01-19 14:53:01,266 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-01-19 14:53:01,518 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][221], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3169#(and (<= 2 ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1200#true, 35#L52true, 3550#true, 520#(= ~i2~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,518 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 14:53:01,519 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:01,519 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:01,519 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:01,566 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, 137#true, Black: 1894#(<= 0 ~i1~0), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, 7#L41true, 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 3550#true, 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,566 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,566 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,566 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 14:53:01,566 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 14:53:01,627 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][174], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 1894#(<= 0 ~i1~0), 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,627 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,627 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,627 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 14:53:01,627 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 14:53:01,627 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][267], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), 1202#(= ~i1~0 0), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, 1894#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 2516#(= ~i1~0 0), 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 7#L41true, 3552#(= ~i1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,627 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,627 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 14:53:01,627 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 14:53:01,627 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,657 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,657 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,657 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:53:01,657 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,657 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:53:01,667 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 1248#(= ~counter~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 35#L52true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,668 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 14:53:01,668 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:01,668 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:01,668 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:01,687 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,687 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,687 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,688 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,688 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,695 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][237], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, 35#L52true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,695 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,695 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,695 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,695 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:01,961 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,962 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,962 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,962 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,962 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,978 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1248#(= ~counter~0 0), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, 65#L44true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,978 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,978 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,978 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,978 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,979 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,979 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,979 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,979 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,979 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,985 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][267], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), 1202#(= ~i1~0 0), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 573#true, 1894#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 2516#(= ~i1~0 0), 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 7#L41true, 3552#(= ~i1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,985 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,985 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 14:53:01,985 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 14:53:01,985 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,985 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:01,987 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:01,987 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 14:53:01,987 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:01,987 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:01,987 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,098 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:02,098 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-01-19 14:53:02,098 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-01-19 14:53:02,098 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-01-19 14:53:02,098 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-01-19 14:53:02,098 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:02,098 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,098 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,098 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,098 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,098 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,187 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][146], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:02,188 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,188 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,188 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,188 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,294 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1248#(= ~counter~0 0), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:02,294 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,294 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,294 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,294 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,295 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), 1248#(= ~counter~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, 3571#(= ~counter~0 0), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 35#L52true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:02,295 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,295 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:02,295 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:02,295 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:02,295 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 14:53:02,714 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:02,714 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 14:53:02,714 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:02,714 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:02,714 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:02,843 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][207], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 1357#(= (+ ~counter~0 (- 1)) 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 85#L63-1true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:02,843 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 14:53:02,843 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:53:02,843 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 14:53:02,843 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 14:53:02,852 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:02,852 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 14:53:02,852 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:02,852 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 14:53:02,852 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:03,040 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][179], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,040 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 14:53:03,040 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,040 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,040 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,053 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][232], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,053 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 14:53:03,053 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:03,053 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:03,053 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 14:53:03,054 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([386] L52-->L56: Formula: (and (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~counter~0_80) 1 0)) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= v_~i2~0_24 (+ v_~i2~0_25 1)) (= (+ v_~counter~0_79 1) v_~counter~0_80)) InVars {~counter~0=v_~counter~0_80, ~i2~0=v_~i2~0_25} OutVars{~counter~0=v_~counter~0_79, thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~i2~0=v_~i2~0_24, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][307], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, 7#L41true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,054 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 14:53:03,054 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:03,054 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 14:53:03,054 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 14:53:03,238 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 137#true, 3573#(and (<= 2 ~counter~0) (<= ~counter~0 2)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, 555#(= ~j1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,238 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 14:53:03,238 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,238 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,238 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,343 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), 97#L56true, Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 107#L99-2true, 1009#(or (< ~i1~0 ~N1~0) (not (< ~j1~0 ~M1~0))), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,343 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,343 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,343 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,343 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,354 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 137#true, 107#L99-2true, 1009#(or (< ~i1~0 ~N1~0) (not (< ~j1~0 ~M1~0))), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true]) [2022-01-19 14:53:03,355 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,355 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,355 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,355 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,361 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 2551#(<= 0 ~i1~0), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 1248#(= ~counter~0 0), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,361 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,361 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:03,361 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:03,361 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:03,362 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,362 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 14:53:03,362 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:03,362 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:03,362 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 14:53:03,542 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([380] L41-->L44: Formula: (and (= v_~i1~0_14 (+ v_~i1~0_15 1)) (= (+ v_~counter~0_56 1) v_~counter~0_55)) InVars {~counter~0=v_~counter~0_56, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_55, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0][221], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 65#L44true, 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 573#true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 49#L67true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,542 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 14:53:03,542 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,543 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,543 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 14:53:03,587 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,588 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 14:53:03,588 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,588 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,588 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,588 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 73#L40-1true, Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 573#true, 137#true, 69#L98-4true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,588 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 14:53:03,588 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,588 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,588 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,588 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,589 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 14:53:03,593 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][237], [111#L64true, Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, 107#L99-2true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, 35#L52true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:53:03,594 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 14:53:03,594 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 14:53:03,594 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 14:53:03,594 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 14:53:03,966 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([378] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[][58], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), 3572#(and (<= ~counter~0 1) (<= 1 ~counter~0)), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), 1894#(<= 0 ~i1~0), 978#(< ~i1~0 ~N1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1248#(= ~counter~0 0), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, 137#true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 69#L98-4true, Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 7#L41true, 555#(= ~j1~0 0), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 35#L52true, 3550#true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:03,966 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-19 14:53:03,966 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 14:53:03,966 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 14:53:03,966 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 14:53:04,036 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 111#L64true, Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), 573#true, Black: 2551#(<= 0 ~i1~0), 107#L99-2true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:53:04,036 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-01-19 14:53:04,036 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 14:53:04,036 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 14:53:04,036 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 14:53:04,199 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, 107#L99-2true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1248#(= ~counter~0 0), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:04,200 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,200 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,200 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,200 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,200 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, 107#L99-2true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1248#(= ~counter~0 0), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 35#L52true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:04,200 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,200 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 14:53:04,200 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 14:53:04,200 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 14:53:04,352 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 111#L64true, Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, 107#L99-2true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), 97#L56true, Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 2551#(<= 0 ~i1~0), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), 3569#true, Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:04,352 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-01-19 14:53:04,352 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 14:53:04,352 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 14:53:04,352 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 14:53:04,564 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 137#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 94#L100-2true, 1009#(or (< ~i1~0 ~N1~0) (not (< ~j1~0 ~M1~0))), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 142#(= ~counter~0 0), 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 573#true, Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, 85#L63-1true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:53:04,564 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 14:53:04,564 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 14:53:04,564 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 14:53:04,564 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 14:53:04,650 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), 32#L51-1true, Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, 137#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 107#L99-2true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:53:04,650 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 14:53:04,651 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,651 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,651 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,651 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, 107#L99-2true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 35#L52true, 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 1248#(= ~counter~0 0), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:04,651 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 14:53:04,651 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,651 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,651 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 14:53:04,720 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 111#L64true, Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, 137#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 94#L100-2true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, 89#L79true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:53:04,721 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 14:53:04,721 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 14:53:04,721 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 14:53:04,721 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 14:53:04,721 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][258], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 111#L64true, Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 2551#(<= 0 ~i1~0), 573#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), 137#true, Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1248#(= ~counter~0 0), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 94#L100-2true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))))]) [2022-01-19 14:53:04,721 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 14:53:04,721 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 14:53:04,721 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 14:53:04,721 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 14:53:05,078 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][253], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), 111#L64true, Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 573#true, 137#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 94#L100-2true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), 2551#(<= 0 ~i1~0), 1894#(<= 0 ~i1~0), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), 3569#true, Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:53:05,079 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 14:53:05,079 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 14:53:05,079 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 14:53:05,079 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 14:53:05,135 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([398] L75-->L79: Formula: (and (= |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~j2~0_29 1) v_~j2~0_28) (not (= 0 |v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (= (ite (< 0 v_~counter~0_88) 1 0) |v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~counter~0_87 1) v_~counter~0_88)) InVars {~counter~0=v_~counter~0_88, ~j2~0=v_~j2~0_29} OutVars{~counter~0=v_~counter~0_87, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread4Thread1of1ForFork2_#t~post7#1=|v_thread4Thread1of1ForFork2_#t~post7#1_1|, thread4Thread1of1ForFork2_#t~post8#1=|v_thread4Thread1of1ForFork2_#t~post8#1_1|, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~j2~0=v_~j2~0_28} AuxVars[] AssignedVars[~counter~0, thread4Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread4Thread1of1ForFork2_#t~post7#1, thread4Thread1of1ForFork2_#t~post8#1, thread4Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~j2~0][259], [Black: 3195#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= (+ ~i2~0 1) ~N2~0)), Black: 3163#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 1357#(= (+ ~counter~0 (- 1)) 0), 111#L64true, Black: 3167#(and (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= 1 ~i1~0) (= ~N2~0 ~N1~0)), Black: 505#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 3175#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0)), Black: 3181#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), 3189#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0)))), Black: 3191#(and (<= 0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0)), Black: 2551#(<= 0 ~i1~0), 573#true, 137#true, Black: 3185#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 ~i1~0)), Black: 3165#(and (= ~i1~0 0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= ~i2~0 0) (<= (+ ~i2~0 1) ~N2~0) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), Black: 2516#(= ~i1~0 0), Black: 3177#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (<= (+ ~i2~0 1) ~N2~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 3173#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1))) (< 1 ~N2~0)), Black: 3179#(and (<= 0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (not (< ~i1~0 ~N1~0))) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), Black: 3183#(and (<= (+ 2 ~i2~0) ~N2~0) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i2~0 ~i1~0) (< 1 ~N2~0)), 94#L100-2true, Black: 2505#(and (or (< ~j2~0 ~M2~0) (not (< ~i1~0 ~N1~0))) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), Black: 2507#(and (< ~j2~0 ~M2~0) (<= 0 ~i1~0) (<= ~j2~0 ~i1~0)), 3571#(= ~counter~0 0), Black: 142#(= ~counter~0 0), Black: 524#(and (= ~j1~0 0) (= ~i2~0 0) (<= ~M1~0 ~N2~0)), Black: 543#(and (= ~i1~0 0) (<= ~M1~0 ~N1~0) (= ~j1~0 0)), Black: 159#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0)), Black: 167#(and (= ~i1~0 0) (= ~i2~0 0) (<= ~N1~0 ~N2~0) (<= (+ ~i1~0 1) ~N2~0)), Black: 3561#(and (<= ~N1~0 0) (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 1196#(and (< ~i1~0 ~N1~0) (<= ~i1~0 0) (<= ~i1~0 ~j1~0)), Black: 3556#(and (= ~i1~0 0) (= ~j2~0 0) (<= ~N1~0 ~M2~0)), Black: 490#(and (<= ~i2~0 0) (<= 0 ~i1~0) (or (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (or (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (= ~N2~0 ~N1~0)), 1894#(<= 0 ~i1~0), 1200#true, Black: 1836#(and (= ~i1~0 0) (= (+ ~counter~0 (- 1)) 0)), 3550#true, Black: 1820#(and (= ~i1~0 0) (= ~counter~0 0)), Black: 555#(= ~j1~0 0), Black: 559#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0)), Black: 564#(and (= ~j2~0 0) (= ~j1~0 0) (<= ~M1~0 ~M2~0) (<= ~M1~0 0)), Black: 1834#(and (<= 1 ~M1~0) (= ~j1~0 0) (= ~counter~0 0)), Black: 1208#(and (<= 1 ~M1~0) (= ~j1~0 0)), Black: 1832#(and (<= 1 ~M1~0) (= ~j1~0 0) (= (+ ~counter~0 (- 1)) 0)), 89#L79true, Black: 3171#(and (<= 0 ~i1~0) (<= ~i2~0 ~i1~0) (or (<= (+ 2 ~i2~0) ~N2~0) (<= ~N1~0 (+ ~i1~0 1)))), Black: 1248#(= ~counter~0 0)]) [2022-01-19 14:53:05,135 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-01-19 14:53:05,136 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 14:53:05,136 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 14:53:05,136 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 14:53:05,328 INFO L129 PetriNetUnfolder]: 13872/37203 cut-off events. [2022-01-19 14:53:05,329 INFO L130 PetriNetUnfolder]: For 536006/543256 co-relation queries the response was YES. [2022-01-19 14:53:05,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193962 conditions, 37203 events. 13872/37203 cut-off events. For 536006/543256 co-relation queries the response was YES. Maximal size of possible extension queue 2598. Compared 476663 event pairs, 3343 based on Foata normal form. 1896/36845 useless extension candidates. Maximal degree in co-relation 193917. Up to 8464 conditions per place. [2022-01-19 14:53:05,869 INFO L132 encePairwiseOnDemand]: 123/131 looper letters, 79 selfloop transitions, 147 changer transitions 4/354 dead transitions. [2022-01-19 14:53:05,869 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 354 transitions, 4045 flow [2022-01-19 14:53:05,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 14:53:05,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 14:53:05,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2022-01-19 14:53:05,870 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8429661941112323 [2022-01-19 14:53:05,871 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2022-01-19 14:53:05,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2022-01-19 14:53:05,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:53:05,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2022-01-19 14:53:05,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:05,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:05,873 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 131.0) internal successors, (1048), 8 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:05,873 INFO L186 Difference]: Start difference. First operand has 200 places, 239 transitions, 2166 flow. Second operand 7 states and 773 transitions. [2022-01-19 14:53:05,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 354 transitions, 4045 flow [2022-01-19 14:53:06,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 354 transitions, 3984 flow, removed 5 selfloop flow, removed 9 redundant places. [2022-01-19 14:53:06,469 INFO L242 Difference]: Finished difference. Result has 201 places, 322 transitions, 3950 flow [2022-01-19 14:53:06,469 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3950, PETRI_PLACES=201, PETRI_TRANSITIONS=322} [2022-01-19 14:53:06,470 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 84 predicate places. [2022-01-19 14:53:06,470 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 322 transitions, 3950 flow [2022-01-19 14:53:06,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 104.0) internal successors, (728), 7 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:06,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:53:06,471 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:53:06,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 14:53:06,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:53:06,672 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:53:06,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:53:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash -670284878, now seen corresponding path program 2 times [2022-01-19 14:53:06,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:53:06,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101555715] [2022-01-19 14:53:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:53:06,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:53:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:53:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:53:06,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:53:06,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101555715] [2022-01-19 14:53:06,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101555715] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:53:06,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249267274] [2022-01-19 14:53:06,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 14:53:06,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:53:06,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:53:07,000 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:53:07,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 14:53:07,087 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 14:53:07,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:53:07,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 14:53:07,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:53:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 14:53:07,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:53:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 14:53:07,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249267274] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:53:07,895 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:53:07,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-01-19 14:53:07,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467740527] [2022-01-19 14:53:07,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:53:07,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 14:53:07,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:53:07,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 14:53:07,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2022-01-19 14:53:07,898 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2022-01-19 14:53:07,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 322 transitions, 3950 flow. Second operand has 25 states, 25 states have (on average 86.76) internal successors, (2169), 25 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:07,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:53:07,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2022-01-19 14:53:07,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:53:25,700 INFO L129 PetriNetUnfolder]: 60760/110335 cut-off events. [2022-01-19 14:53:25,700 INFO L130 PetriNetUnfolder]: For 1346340/1346441 co-relation queries the response was YES. [2022-01-19 14:53:26,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 594762 conditions, 110335 events. 60760/110335 cut-off events. For 1346340/1346441 co-relation queries the response was YES. Maximal size of possible extension queue 6642. Compared 1202814 event pairs, 7487 based on Foata normal form. 4454/113719 useless extension candidates. Maximal degree in co-relation 594714. Up to 17344 conditions per place. [2022-01-19 14:53:27,222 INFO L132 encePairwiseOnDemand]: 114/131 looper letters, 956 selfloop transitions, 586 changer transitions 0/1609 dead transitions. [2022-01-19 14:53:27,222 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1609 transitions, 25483 flow [2022-01-19 14:53:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 14:53:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 14:53:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 5429 transitions. [2022-01-19 14:53:27,228 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7145301395103975 [2022-01-19 14:53:27,228 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 5429 transitions. [2022-01-19 14:53:27,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 5429 transitions. [2022-01-19 14:53:27,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:53:27,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 5429 transitions. [2022-01-19 14:53:27,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 93.60344827586206) internal successors, (5429), 58 states have internal predecessors, (5429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:27,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 131.0) internal successors, (7729), 59 states have internal predecessors, (7729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:27,245 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 131.0) internal successors, (7729), 59 states have internal predecessors, (7729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:27,245 INFO L186 Difference]: Start difference. First operand has 201 places, 322 transitions, 3950 flow. Second operand 58 states and 5429 transitions. [2022-01-19 14:53:27,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1609 transitions, 25483 flow [2022-01-19 14:53:32,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 1609 transitions, 23237 flow, removed 1105 selfloop flow, removed 3 redundant places. [2022-01-19 14:53:32,962 INFO L242 Difference]: Finished difference. Result has 290 places, 751 transitions, 11492 flow [2022-01-19 14:53:32,962 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=3614, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=11492, PETRI_PLACES=290, PETRI_TRANSITIONS=751} [2022-01-19 14:53:32,963 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 173 predicate places. [2022-01-19 14:53:32,963 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 751 transitions, 11492 flow [2022-01-19 14:53:32,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 86.76) internal successors, (2169), 25 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:32,963 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:53:32,964 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:53:32,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 14:53:33,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-01-19 14:53:33,171 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:53:33,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:53:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1537742894, now seen corresponding path program 3 times [2022-01-19 14:53:33,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:53:33,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408166108] [2022-01-19 14:53:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:53:33,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:53:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:53:33,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 14:53:33,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:53:33,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408166108] [2022-01-19 14:53:33,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408166108] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:53:33,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199092152] [2022-01-19 14:53:33,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 14:53:33,301 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:53:33,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:53:33,302 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:53:33,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 14:53:33,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 14:53:33,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:53:33,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 14:53:33,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:53:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 14:53:33,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:53:34,106 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 14:53:34,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199092152] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:53:34,106 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:53:34,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-01-19 14:53:34,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361892589] [2022-01-19 14:53:34,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:53:34,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 14:53:34,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:53:34,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 14:53:34,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-01-19 14:53:34,108 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 14:53:34,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 751 transitions, 11492 flow. Second operand has 24 states, 24 states have (on average 87.79166666666667) internal successors, (2107), 24 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:53:34,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:53:34,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 14:53:34,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:54:17,491 INFO L129 PetriNetUnfolder]: 97298/182625 cut-off events. [2022-01-19 14:54:17,491 INFO L130 PetriNetUnfolder]: For 6436872/6436969 co-relation queries the response was YES. [2022-01-19 14:54:20,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1386155 conditions, 182625 events. 97298/182625 cut-off events. For 6436872/6436969 co-relation queries the response was YES. Maximal size of possible extension queue 12252. Compared 2211409 event pairs, 18832 based on Foata normal form. 3550/183955 useless extension candidates. Maximal degree in co-relation 1386072. Up to 44095 conditions per place. [2022-01-19 14:54:21,992 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 1416 selfloop transitions, 590 changer transitions 98/2172 dead transitions. [2022-01-19 14:54:21,993 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 2172 transitions, 39798 flow [2022-01-19 14:54:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-19 14:54:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-01-19 14:54:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2175 transitions. [2022-01-19 14:54:22,026 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7218718884832392 [2022-01-19 14:54:22,026 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2175 transitions. [2022-01-19 14:54:22,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2175 transitions. [2022-01-19 14:54:22,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:54:22,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2175 transitions. [2022-01-19 14:54:22,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 94.56521739130434) internal successors, (2175), 23 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:54:22,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 131.0) internal successors, (3144), 24 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:54:22,032 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 131.0) internal successors, (3144), 24 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:54:22,033 INFO L186 Difference]: Start difference. First operand has 290 places, 751 transitions, 11492 flow. Second operand 23 states and 2175 transitions. [2022-01-19 14:54:22,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 2172 transitions, 39798 flow [2022-01-19 14:56:09,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 2172 transitions, 37003 flow, removed 1121 selfloop flow, removed 16 redundant places. [2022-01-19 14:56:09,151 INFO L242 Difference]: Finished difference. Result has 307 places, 1213 transitions, 20047 flow [2022-01-19 14:56:09,152 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=10387, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=20047, PETRI_PLACES=307, PETRI_TRANSITIONS=1213} [2022-01-19 14:56:09,153 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 190 predicate places. [2022-01-19 14:56:09,153 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 1213 transitions, 20047 flow [2022-01-19 14:56:09,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 87.79166666666667) internal successors, (2107), 24 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:56:09,153 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:56:09,153 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 14:56:09,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 14:56:09,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-19 14:56:09,362 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 14:56:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:56:09,362 INFO L85 PathProgramCache]: Analyzing trace with hash 160369916, now seen corresponding path program 4 times [2022-01-19 14:56:09,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:56:09,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184340756] [2022-01-19 14:56:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:56:09,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:56:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:56:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:56:09,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:56:09,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184340756] [2022-01-19 14:56:09,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184340756] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:56:09,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613373383] [2022-01-19 14:56:09,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 14:56:09,518 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:56:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:56:09,520 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:56:09,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 14:56:09,606 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 14:56:09,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:56:09,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 14:56:09,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:56:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:56:10,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:56:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:56:10,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613373383] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:56:10,360 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:56:10,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-01-19 14:56:10,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64593018] [2022-01-19 14:56:10,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:56:10,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 14:56:10,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:56:10,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 14:56:10,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-19 14:56:10,363 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2022-01-19 14:56:10,364 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 1213 transitions, 20047 flow. Second operand has 25 states, 25 states have (on average 86.72) internal successors, (2168), 25 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:56:10,364 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:56:10,364 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2022-01-19 14:56:10,364 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand