/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.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 02:33:24,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 02:33:24,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 02:33:24,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 02:33:24,848 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 02:33:24,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 02:33:24,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 02:33:24,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 02:33:24,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 02:33:24,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 02:33:24,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 02:33:24,855 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 02:33:24,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 02:33:24,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 02:33:24,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 02:33:24,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 02:33:24,868 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 02:33:24,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 02:33:24,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 02:33:24,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 02:33:24,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 02:33:24,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 02:33:24,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 02:33:24,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 02:33:24,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 02:33:24,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 02:33:24,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 02:33:24,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 02:33:24,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 02:33:24,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 02:33:24,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 02:33:24,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 02:33:24,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 02:33:24,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 02:33:24,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 02:33:24,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 02:33:24,883 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 02:33:24,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 02:33:24,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 02:33:24,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 02:33:24,885 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 02:33:24,886 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.epf [2022-01-19 02:33:24,907 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 02:33:24,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 02:33:24,908 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 02:33:24,908 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 02:33:24,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 02:33:24,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 02:33:24,909 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 02:33:24,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 02:33:24,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 02:33:24,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 02:33:24,910 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 02:33:24,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 02:33:24,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 02:33:24,910 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 02:33:24,910 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 02:33:24,910 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 02:33:24,910 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 02:33:24,911 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 02:33:24,911 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 02:33:24,911 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 02:33:24,911 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 02:33:24,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 02:33:24,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 02:33:24,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 02:33:24,911 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 02:33:24,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 02:33:24,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 02:33:24,912 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 02:33:24,912 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 02:33:24,912 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 02:33:24,912 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 02:33:24,912 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 02:33:25,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 02:33:25,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 02:33:25,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 02:33:25,143 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 02:33:25,144 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 02:33:25,145 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 02:33:25,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9107fbaff/eb9ca84b70fe4005b7da6586e54e2c58/FLAG1a7980285 [2022-01-19 02:33:25,580 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 02:33:25,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-01-19 02:33:25,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9107fbaff/eb9ca84b70fe4005b7da6586e54e2c58/FLAG1a7980285 [2022-01-19 02:33:25,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9107fbaff/eb9ca84b70fe4005b7da6586e54e2c58 [2022-01-19 02:33:26,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 02:33:26,001 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 02:33:26,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 02:33:26,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 02:33:26,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 02:33:26,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:33:25" (1/1) ... [2022-01-19 02:33:26,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c05533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26, skipping insertion in model container [2022-01-19 02:33:26,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:33:25" (1/1) ... [2022-01-19 02:33:26,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 02:33:26,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 02:33:26,208 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 02:33:26,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 02:33:26,217 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 02:33:26,235 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 02:33:26,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 02:33:26,250 INFO L208 MainTranslator]: Completed translation [2022-01-19 02:33:26,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26 WrapperNode [2022-01-19 02:33:26,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 02:33:26,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 02:33:26,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 02:33:26,252 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 02:33:26,258 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:33:26" (1/1) ... [2022-01-19 02:33:26,263 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:33:26" (1/1) ... [2022-01-19 02:33:26,283 INFO L137 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 133 [2022-01-19 02:33:26,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 02:33:26,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 02:33:26,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 02:33:26,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 02:33:26,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26" (1/1) ... [2022-01-19 02:33:26,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26" (1/1) ... [2022-01-19 02:33:26,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26" (1/1) ... [2022-01-19 02:33:26,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26" (1/1) ... [2022-01-19 02:33:26,299 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26" (1/1) ... [2022-01-19 02:33:26,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26" (1/1) ... [2022-01-19 02:33:26,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26" (1/1) ... [2022-01-19 02:33:26,307 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 02:33:26,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 02:33:26,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 02:33:26,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 02:33:26,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26" (1/1) ... [2022-01-19 02:33:26,318 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 02:33:26,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:33:26,344 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 02:33:26,350 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 02:33:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 02:33:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 02:33:26,385 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 02:33:26,385 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 02:33:26,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 02:33:26,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 02:33:26,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 02:33:26,386 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 02:33:26,386 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 02:33:26,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 02:33:26,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 02:33:26,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 02:33:26,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 02:33:26,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 02:33:26,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 02:33:26,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 02:33:26,388 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 02:33:26,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 02:33:26,390 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 02:33:26,483 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 02:33:26,487 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 02:33:26,708 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 02:33:26,755 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 02:33:26,755 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 02:33:26,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:33:26 BoogieIcfgContainer [2022-01-19 02:33:26,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 02:33:26,759 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 02:33:26,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 02:33:26,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 02:33:26,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 02:33:25" (1/3) ... [2022-01-19 02:33:26,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d20b14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:33:26, skipping insertion in model container [2022-01-19 02:33:26,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:33:26" (2/3) ... [2022-01-19 02:33:26,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d20b14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:33:26, skipping insertion in model container [2022-01-19 02:33:26,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:33:26" (3/3) ... [2022-01-19 02:33:26,764 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2022-01-19 02:33:26,768 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 02:33:26,769 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 02:33:26,769 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 02:33:26,813 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,814 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,814 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,814 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,814 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,814 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,814 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,815 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,818 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,818 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 02:33:26,819 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 02:33:26,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,819 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,819 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 02:33:26,819 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 02:33:26,823 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,823 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,823 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,823 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,824 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,824 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,824 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,824 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,830 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,830 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,830 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,831 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,831 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,831 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 02:33:26,831 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,831 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 02:33:26,831 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,832 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 02:33:26,832 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,832 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 02:33:26,837 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,837 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,837 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,838 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~post5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,838 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,839 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,840 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 02:33:26,840 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,840 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,840 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,841 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 02:33:26,841 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,842 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 02:33:26,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,842 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,842 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 02:33:26,843 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 02:33:26,860 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 02:33:26,908 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 02:33:26,918 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 02:33:26,918 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 02:33:26,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 134 places, 131 transitions, 294 flow [2022-01-19 02:33:26,990 INFO L129 PetriNetUnfolder]: 10/127 cut-off events. [2022-01-19 02:33:26,990 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 02:33:26,994 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 02:33:26,994 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 131 transitions, 294 flow [2022-01-19 02:33:27,002 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 114 transitions, 252 flow [2022-01-19 02:33:27,037 INFO L129 PetriNetUnfolder]: 10/113 cut-off events. [2022-01-19 02:33:27,038 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 02:33:27,038 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:27,039 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 02:33:27,039 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 02:33:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:27,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1069838279, now seen corresponding path program 1 times [2022-01-19 02:33:27,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:27,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149458068] [2022-01-19 02:33:27,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:27,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:27,315 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 02:33:27,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:27,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149458068] [2022-01-19 02:33:27,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149458068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:27,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:33:27,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 02:33:27,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318677967] [2022-01-19 02:33:27,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:27,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 02:33:27,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:27,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 02:33:27,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 02:33:27,369 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 131 [2022-01-19 02:33:27,374 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 02:33:27,374 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:27,374 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 131 [2022-01-19 02:33:27,376 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:27,440 INFO L129 PetriNetUnfolder]: 16/120 cut-off events. [2022-01-19 02:33:27,441 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 02:33:27,442 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 02:33:27,444 INFO L132 encePairwiseOnDemand]: 125/131 looper letters, 12 selfloop transitions, 0 changer transitions 2/108 dead transitions. [2022-01-19 02:33:27,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 264 flow [2022-01-19 02:33:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 02:33:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 02:33:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 242 transitions. [2022-01-19 02:33:27,457 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9236641221374046 [2022-01-19 02:33:27,458 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 242 transitions. [2022-01-19 02:33:27,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 242 transitions. [2022-01-19 02:33:27,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:27,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 242 transitions. [2022-01-19 02:33:27,464 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 02:33:27,471 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 02:33:27,471 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 02:33:27,473 INFO L186 Difference]: Start difference. First operand has 117 places, 114 transitions, 252 flow. Second operand 2 states and 242 transitions. [2022-01-19 02:33:27,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 264 flow [2022-01-19 02:33:27,476 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 02:33:27,479 INFO L242 Difference]: Finished difference. Result has 110 places, 106 transitions, 220 flow [2022-01-19 02:33:27,480 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 02:33:27,485 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -7 predicate places. [2022-01-19 02:33:27,485 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 220 flow [2022-01-19 02:33:27,486 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 02:33:27,486 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:27,486 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 02:33:27,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 02:33:27,488 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 02:33:27,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1574494246, now seen corresponding path program 1 times [2022-01-19 02:33:27,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:27,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280663323] [2022-01-19 02:33:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:27,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:27,681 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 02:33:27,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:27,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280663323] [2022-01-19 02:33:27,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280663323] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:27,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:33:27,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 02:33:27,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691889749] [2022-01-19 02:33:27,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:27,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 02:33:27,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:27,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 02:33:27,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 02:33:27,686 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2022-01-19 02:33:27,687 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 02:33:27,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:27,687 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2022-01-19 02:33:27,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:27,827 INFO L129 PetriNetUnfolder]: 23/173 cut-off events. [2022-01-19 02:33:27,827 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-01-19 02:33:27,829 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 02:33:27,830 INFO L132 encePairwiseOnDemand]: 123/131 looper letters, 25 selfloop transitions, 3 changer transitions 5/118 dead transitions. [2022-01-19 02:33:27,831 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 118 transitions, 317 flow [2022-01-19 02:33:27,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 02:33:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 02:33:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2022-01-19 02:33:27,837 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8259541984732824 [2022-01-19 02:33:27,837 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2022-01-19 02:33:27,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2022-01-19 02:33:27,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:27,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2022-01-19 02:33:27,841 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 02:33:27,844 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 02:33:27,845 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 02:33:27,845 INFO L186 Difference]: Start difference. First operand has 110 places, 106 transitions, 220 flow. Second operand 5 states and 541 transitions. [2022-01-19 02:33:27,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 118 transitions, 317 flow [2022-01-19 02:33:27,847 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 02:33:27,849 INFO L242 Difference]: Finished difference. Result has 115 places, 108 transitions, 247 flow [2022-01-19 02:33:27,850 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 02:33:27,850 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -2 predicate places. [2022-01-19 02:33:27,851 INFO L470 AbstractCegarLoop]: Abstraction has has 115 places, 108 transitions, 247 flow [2022-01-19 02:33:27,851 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 02:33:27,851 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:27,852 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 02:33:27,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 02:33:27,852 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 02:33:27,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:27,853 INFO L85 PathProgramCache]: Analyzing trace with hash -575216244, now seen corresponding path program 1 times [2022-01-19 02:33:27,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:27,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52382275] [2022-01-19 02:33:27,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:27,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:28,174 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 02:33:28,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:28,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52382275] [2022-01-19 02:33:28,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52382275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:28,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:33:28,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 02:33:28,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191922362] [2022-01-19 02:33:28,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:28,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 02:33:28,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:28,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 02:33:28,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-19 02:33:28,183 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 02:33:28,184 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 02:33:28,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:28,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 02:33:28,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:28,818 INFO L129 PetriNetUnfolder]: 2030/3464 cut-off events. [2022-01-19 02:33:28,819 INFO L130 PetriNetUnfolder]: For 591/703 co-relation queries the response was YES. [2022-01-19 02:33:28,830 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 02:33:28,857 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 107 selfloop transitions, 12 changer transitions 0/187 dead transitions. [2022-01-19 02:33:28,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 187 transitions, 714 flow [2022-01-19 02:33:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 02:33:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 02:33:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 874 transitions. [2022-01-19 02:33:28,861 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.741306191687871 [2022-01-19 02:33:28,861 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 874 transitions. [2022-01-19 02:33:28,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 874 transitions. [2022-01-19 02:33:28,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:28,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 874 transitions. [2022-01-19 02:33:28,867 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 02:33:28,871 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 02:33:28,872 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 02:33:28,872 INFO L186 Difference]: Start difference. First operand has 115 places, 108 transitions, 247 flow. Second operand 9 states and 874 transitions. [2022-01-19 02:33:28,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 187 transitions, 714 flow [2022-01-19 02:33:28,877 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 02:33:28,882 INFO L242 Difference]: Finished difference. Result has 122 places, 114 transitions, 315 flow [2022-01-19 02:33:28,882 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 02:33:28,884 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2022-01-19 02:33:28,884 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 315 flow [2022-01-19 02:33:28,885 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 02:33:28,885 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:28,885 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 02:33:28,885 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 02:33:28,885 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 02:33:28,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1075191398, now seen corresponding path program 2 times [2022-01-19 02:33:28,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:28,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086432027] [2022-01-19 02:33:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:28,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:29,182 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 02:33:29,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:29,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086432027] [2022-01-19 02:33:29,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086432027] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:33:29,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811421610] [2022-01-19 02:33:29,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 02:33:29,184 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:33:29,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:33:29,191 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 02:33:29,228 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 02:33:29,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 02:33:29,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:33:29,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 02:33:29,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:33:29,785 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 02:33:29,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 02:33:29,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811421610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:29,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 02:33:29,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-01-19 02:33:29,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939140127] [2022-01-19 02:33:29,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:29,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:33:29,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:29,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:33:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-01-19 02:33:29,789 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 02:33:29,789 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 02:33:29,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:29,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 02:33:29,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:30,047 INFO L129 PetriNetUnfolder]: 319/720 cut-off events. [2022-01-19 02:33:30,048 INFO L130 PetriNetUnfolder]: For 450/462 co-relation queries the response was YES. [2022-01-19 02:33:30,050 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 02:33:30,055 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 50 selfloop transitions, 12 changer transitions 0/138 dead transitions. [2022-01-19 02:33:30,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 138 transitions, 522 flow [2022-01-19 02:33:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:33:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:33:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 975 transitions. [2022-01-19 02:33:30,058 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7442748091603053 [2022-01-19 02:33:30,059 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 975 transitions. [2022-01-19 02:33:30,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 975 transitions. [2022-01-19 02:33:30,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:30,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 975 transitions. [2022-01-19 02:33:30,062 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 02:33:30,064 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 02:33:30,064 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 02:33:30,065 INFO L186 Difference]: Start difference. First operand has 122 places, 114 transitions, 315 flow. Second operand 10 states and 975 transitions. [2022-01-19 02:33:30,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 138 transitions, 522 flow [2022-01-19 02:33:30,068 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 02:33:30,070 INFO L242 Difference]: Finished difference. Result has 130 places, 117 transitions, 357 flow [2022-01-19 02:33:30,070 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 02:33:30,071 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 13 predicate places. [2022-01-19 02:33:30,071 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 357 flow [2022-01-19 02:33:30,071 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 02:33:30,071 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:30,072 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 02:33:30,098 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 02:33:30,295 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 02:33:30,296 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 02:33:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:30,296 INFO L85 PathProgramCache]: Analyzing trace with hash -956916982, now seen corresponding path program 1 times [2022-01-19 02:33:30,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:30,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632901062] [2022-01-19 02:33:30,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:30,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:30,459 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 02:33:30,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:30,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632901062] [2022-01-19 02:33:30,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632901062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:30,460 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:33:30,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 02:33:30,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129850676] [2022-01-19 02:33:30,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:30,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:33:30,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:30,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:33:30,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 02:33:30,462 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 02:33:30,463 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 02:33:30,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:30,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 02:33:30,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:30,973 INFO L129 PetriNetUnfolder]: 1977/3728 cut-off events. [2022-01-19 02:33:30,973 INFO L130 PetriNetUnfolder]: For 3939/4031 co-relation queries the response was YES. [2022-01-19 02:33:30,985 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 02:33:31,009 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 98 selfloop transitions, 15 changer transitions 6/187 dead transitions. [2022-01-19 02:33:31,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 187 transitions, 870 flow [2022-01-19 02:33:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:33:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:33:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 947 transitions. [2022-01-19 02:33:31,013 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7229007633587786 [2022-01-19 02:33:31,013 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 947 transitions. [2022-01-19 02:33:31,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 947 transitions. [2022-01-19 02:33:31,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:31,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 947 transitions. [2022-01-19 02:33:31,017 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 02:33:31,019 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 02:33:31,020 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 02:33:31,020 INFO L186 Difference]: Start difference. First operand has 130 places, 117 transitions, 357 flow. Second operand 10 states and 947 transitions. [2022-01-19 02:33:31,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 187 transitions, 870 flow [2022-01-19 02:33:31,030 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 02:33:31,034 INFO L242 Difference]: Finished difference. Result has 135 places, 121 transitions, 403 flow [2022-01-19 02:33:31,034 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 02:33:31,036 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2022-01-19 02:33:31,036 INFO L470 AbstractCegarLoop]: Abstraction has has 135 places, 121 transitions, 403 flow [2022-01-19 02:33:31,036 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 02:33:31,036 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:31,037 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 02:33:31,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 02:33:31,037 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 02:33:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:31,038 INFO L85 PathProgramCache]: Analyzing trace with hash 158599598, now seen corresponding path program 2 times [2022-01-19 02:33:31,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:31,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473621878] [2022-01-19 02:33:31,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:31,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:31,209 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 02:33:31,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:31,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473621878] [2022-01-19 02:33:31,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473621878] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:31,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:33:31,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 02:33:31,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563270103] [2022-01-19 02:33:31,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:31,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:33:31,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:31,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:33:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 02:33:31,212 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 02:33:31,212 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 02:33:31,213 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:31,213 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 02:33:31,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:31,814 INFO L129 PetriNetUnfolder]: 2339/4309 cut-off events. [2022-01-19 02:33:31,814 INFO L130 PetriNetUnfolder]: For 5757/5798 co-relation queries the response was YES. [2022-01-19 02:33:31,831 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 02:33:31,862 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 102 selfloop transitions, 19 changer transitions 6/195 dead transitions. [2022-01-19 02:33:31,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 195 transitions, 980 flow [2022-01-19 02:33:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:33:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:33:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 950 transitions. [2022-01-19 02:33:31,865 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7251908396946565 [2022-01-19 02:33:31,865 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 950 transitions. [2022-01-19 02:33:31,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 950 transitions. [2022-01-19 02:33:31,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:31,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 950 transitions. [2022-01-19 02:33:31,868 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 02:33:31,870 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 02:33:31,871 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 02:33:31,871 INFO L186 Difference]: Start difference. First operand has 135 places, 121 transitions, 403 flow. Second operand 10 states and 950 transitions. [2022-01-19 02:33:31,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 195 transitions, 980 flow [2022-01-19 02:33:31,880 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 02:33:31,883 INFO L242 Difference]: Finished difference. Result has 140 places, 128 transitions, 490 flow [2022-01-19 02:33:31,883 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 02:33:31,886 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2022-01-19 02:33:31,886 INFO L470 AbstractCegarLoop]: Abstraction has has 140 places, 128 transitions, 490 flow [2022-01-19 02:33:31,886 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 02:33:31,886 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:31,886 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 02:33:31,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 02:33:31,887 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 02:33:31,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1067075906, now seen corresponding path program 3 times [2022-01-19 02:33:31,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:31,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378061868] [2022-01-19 02:33:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:31,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:32,016 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 02:33:32,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:32,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378061868] [2022-01-19 02:33:32,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378061868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:32,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:33:32,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 02:33:32,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798326515] [2022-01-19 02:33:32,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:32,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:33:32,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:32,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:33:32,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-01-19 02:33:32,019 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 02:33:32,020 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 02:33:32,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:32,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 02:33:32,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:32,570 INFO L129 PetriNetUnfolder]: 2280/4136 cut-off events. [2022-01-19 02:33:32,570 INFO L130 PetriNetUnfolder]: For 7452/7576 co-relation queries the response was YES. [2022-01-19 02:33:32,583 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 02:33:32,612 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 83 selfloop transitions, 14 changer transitions 10/175 dead transitions. [2022-01-19 02:33:32,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 175 transitions, 913 flow [2022-01-19 02:33:32,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 02:33:32,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 02:33:32,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 759 transitions. [2022-01-19 02:33:32,616 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7242366412213741 [2022-01-19 02:33:32,616 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 759 transitions. [2022-01-19 02:33:32,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 759 transitions. [2022-01-19 02:33:32,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:32,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 759 transitions. [2022-01-19 02:33:32,618 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 02:33:32,620 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 02:33:32,620 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 02:33:32,620 INFO L186 Difference]: Start difference. First operand has 140 places, 128 transitions, 490 flow. Second operand 8 states and 759 transitions. [2022-01-19 02:33:32,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 175 transitions, 913 flow [2022-01-19 02:33:32,631 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 02:33:32,634 INFO L242 Difference]: Finished difference. Result has 143 places, 128 transitions, 508 flow [2022-01-19 02:33:32,634 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 02:33:32,634 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 26 predicate places. [2022-01-19 02:33:32,634 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 128 transitions, 508 flow [2022-01-19 02:33:32,635 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 02:33:32,635 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:32,635 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 02:33:32,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 02:33:32,635 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 02:33:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:32,636 INFO L85 PathProgramCache]: Analyzing trace with hash 616937690, now seen corresponding path program 4 times [2022-01-19 02:33:32,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:32,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644535147] [2022-01-19 02:33:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:32,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:32,787 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 02:33:32,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:32,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644535147] [2022-01-19 02:33:32,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644535147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:32,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:33:32,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 02:33:32,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016001574] [2022-01-19 02:33:32,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:32,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:33:32,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:32,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:33:32,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-19 02:33:32,790 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 02:33:32,790 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 02:33:32,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:32,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 02:33:32,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:33,594 INFO L129 PetriNetUnfolder]: 3385/6203 cut-off events. [2022-01-19 02:33:33,594 INFO L130 PetriNetUnfolder]: For 13151/13207 co-relation queries the response was YES. [2022-01-19 02:33:33,615 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 02:33:33,651 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 118 selfloop transitions, 26 changer transitions 1/213 dead transitions. [2022-01-19 02:33:33,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 213 transitions, 1284 flow [2022-01-19 02:33:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:33:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:33:33,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 945 transitions. [2022-01-19 02:33:33,655 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7213740458015268 [2022-01-19 02:33:33,655 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 945 transitions. [2022-01-19 02:33:33,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 945 transitions. [2022-01-19 02:33:33,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:33,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 945 transitions. [2022-01-19 02:33:33,658 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 02:33:33,661 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 02:33:33,662 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 02:33:33,662 INFO L186 Difference]: Start difference. First operand has 143 places, 128 transitions, 508 flow. Second operand 10 states and 945 transitions. [2022-01-19 02:33:33,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 213 transitions, 1284 flow [2022-01-19 02:33:33,676 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 02:33:33,679 INFO L242 Difference]: Finished difference. Result has 149 places, 143 transitions, 684 flow [2022-01-19 02:33:33,679 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 02:33:33,681 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2022-01-19 02:33:33,681 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 143 transitions, 684 flow [2022-01-19 02:33:33,681 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 02:33:33,682 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:33,682 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 02:33:33,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 02:33:33,682 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 02:33:33,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:33,683 INFO L85 PathProgramCache]: Analyzing trace with hash 721298320, now seen corresponding path program 5 times [2022-01-19 02:33:33,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:33,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804489155] [2022-01-19 02:33:33,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:33,683 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:33,842 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 02:33:33,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:33,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804489155] [2022-01-19 02:33:33,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804489155] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:33:33,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701910806] [2022-01-19 02:33:33,843 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 02:33:33,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:33:33,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:33:33,848 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 02:33:33,873 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 02:33:33,960 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 02:33:33,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:33:33,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 02:33:33,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:33:34,376 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 02:33:34,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:33:34,643 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 02:33:34,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701910806] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 02:33:34,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 02:33:34,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2022-01-19 02:33:34,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999110386] [2022-01-19 02:33:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:34,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:33:34,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:33:34,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-01-19 02:33:34,649 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 02:33:34,649 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 02:33:34,650 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:34,650 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 02:33:34,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:35,076 INFO L129 PetriNetUnfolder]: 1279/3099 cut-off events. [2022-01-19 02:33:35,076 INFO L130 PetriNetUnfolder]: For 7636/8046 co-relation queries the response was YES. [2022-01-19 02:33:35,090 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 02:33:35,138 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 92 selfloop transitions, 21 changer transitions 7/200 dead transitions. [2022-01-19 02:33:35,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 200 transitions, 1305 flow [2022-01-19 02:33:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:33:35,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:33:35,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 993 transitions. [2022-01-19 02:33:35,141 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7580152671755725 [2022-01-19 02:33:35,142 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 993 transitions. [2022-01-19 02:33:35,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 993 transitions. [2022-01-19 02:33:35,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:35,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 993 transitions. [2022-01-19 02:33:35,145 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 02:33:35,147 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 02:33:35,148 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 02:33:35,148 INFO L186 Difference]: Start difference. First operand has 149 places, 143 transitions, 684 flow. Second operand 10 states and 993 transitions. [2022-01-19 02:33:35,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 200 transitions, 1305 flow [2022-01-19 02:33:35,156 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 02:33:35,159 INFO L242 Difference]: Finished difference. Result has 154 places, 147 transitions, 784 flow [2022-01-19 02:33:35,159 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 02:33:35,160 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2022-01-19 02:33:35,161 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 784 flow [2022-01-19 02:33:35,161 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 02:33:35,161 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:35,161 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 02:33:35,185 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 02:33:35,375 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 02:33:35,375 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 02:33:35,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:35,376 INFO L85 PathProgramCache]: Analyzing trace with hash -741365418, now seen corresponding path program 1 times [2022-01-19 02:33:35,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:35,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902027016] [2022-01-19 02:33:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:35,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:35,542 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 02:33:35,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:35,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902027016] [2022-01-19 02:33:35,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902027016] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:33:35,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701026791] [2022-01-19 02:33:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:35,543 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:33:35,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:33:35,544 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 02:33:35,545 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 02:33:35,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:35,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 02:33:35,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:33:35,869 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 02:33:35,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:33:36,042 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 02:33:36,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701026791] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:33:36,042 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:33:36,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2022-01-19 02:33:36,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637170157] [2022-01-19 02:33:36,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:33:36,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 02:33:36,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:36,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 02:33:36,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-19 02:33:36,045 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2022-01-19 02:33:36,046 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 02:33:36,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:36,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2022-01-19 02:33:36,046 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:37,641 INFO L129 PetriNetUnfolder]: 6226/11076 cut-off events. [2022-01-19 02:33:37,642 INFO L130 PetriNetUnfolder]: For 41315/41315 co-relation queries the response was YES. [2022-01-19 02:33:37,683 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 02:33:37,795 INFO L132 encePairwiseOnDemand]: 115/131 looper letters, 177 selfloop transitions, 55 changer transitions 21/320 dead transitions. [2022-01-19 02:33:37,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 320 transitions, 2270 flow [2022-01-19 02:33:37,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 02:33:37,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 02:33:37,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1787 transitions. [2022-01-19 02:33:37,800 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7179590196866211 [2022-01-19 02:33:37,800 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1787 transitions. [2022-01-19 02:33:37,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1787 transitions. [2022-01-19 02:33:37,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:37,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1787 transitions. [2022-01-19 02:33:37,806 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 02:33:37,810 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 02:33:37,811 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 02:33:37,811 INFO L186 Difference]: Start difference. First operand has 154 places, 147 transitions, 784 flow. Second operand 19 states and 1787 transitions. [2022-01-19 02:33:37,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 320 transitions, 2270 flow [2022-01-19 02:33:37,840 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 02:33:37,844 INFO L242 Difference]: Finished difference. Result has 178 places, 171 transitions, 1207 flow [2022-01-19 02:33:37,845 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 02:33:37,845 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 61 predicate places. [2022-01-19 02:33:37,846 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 171 transitions, 1207 flow [2022-01-19 02:33:37,846 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 02:33:37,846 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:37,846 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 02:33:37,873 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 02:33:38,070 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 02:33:38,070 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 02:33:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash 432141502, now seen corresponding path program 1 times [2022-01-19 02:33:38,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:38,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622307688] [2022-01-19 02:33:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:38,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:38,229 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 02:33:38,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:38,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622307688] [2022-01-19 02:33:38,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622307688] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:33:38,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554357878] [2022-01-19 02:33:38,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:38,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:33:38,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:33:38,231 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 02:33:38,261 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 02:33:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:38,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 02:33:38,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:33:38,844 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 02:33:38,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:33:39,155 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 02:33:39,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554357878] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 02:33:39,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 02:33:39,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 8] total 20 [2022-01-19 02:33:39,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735910240] [2022-01-19 02:33:39,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:39,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:33:39,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:39,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:33:39,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2022-01-19 02:33:39,158 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 02:33:39,158 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 02:33:39,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:39,159 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 02:33:39,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:40,015 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 02:33:40,016 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 02:33:40,016 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:33:40,016 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:33:40,016 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:33:40,071 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 02:33:40,072 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 02:33:40,072 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:33:40,072 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:33:40,072 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:33:40,113 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 02:33:40,113 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 02:33:40,113 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:33:40,113 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,113 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,114 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 02:33:40,115 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 02:33:40,115 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:33:40,115 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,115 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,329 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 02:33:40,329 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 02:33:40,329 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:33:40,329 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:33:40,329 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:33:40,331 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 02:33:40,331 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 02:33:40,331 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:33:40,331 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:33:40,331 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:33:40,379 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 02:33:40,379 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 02:33:40,379 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,379 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,379 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,380 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 02:33:40,380 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 02:33:40,380 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,380 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,380 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:33:40,445 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 02:33:40,445 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 02:33:40,445 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 02:33:40,445 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:33:40,445 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:33:40,738 INFO L129 PetriNetUnfolder]: 5683/11760 cut-off events. [2022-01-19 02:33:40,738 INFO L130 PetriNetUnfolder]: For 88476/89679 co-relation queries the response was YES. [2022-01-19 02:33:40,805 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 02:33:40,946 INFO L132 encePairwiseOnDemand]: 120/131 looper letters, 200 selfloop transitions, 25 changer transitions 2/308 dead transitions. [2022-01-19 02:33:40,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 308 transitions, 3138 flow [2022-01-19 02:33:40,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:33:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:33:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 996 transitions. [2022-01-19 02:33:40,948 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7603053435114504 [2022-01-19 02:33:40,948 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 996 transitions. [2022-01-19 02:33:40,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 996 transitions. [2022-01-19 02:33:40,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:40,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 996 transitions. [2022-01-19 02:33:40,951 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 02:33:40,953 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 02:33:40,953 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 02:33:40,953 INFO L186 Difference]: Start difference. First operand has 178 places, 171 transitions, 1207 flow. Second operand 10 states and 996 transitions. [2022-01-19 02:33:40,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 308 transitions, 3138 flow [2022-01-19 02:33:41,026 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 02:33:41,030 INFO L242 Difference]: Finished difference. Result has 171 places, 182 transitions, 1283 flow [2022-01-19 02:33:41,031 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 02:33:41,031 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 54 predicate places. [2022-01-19 02:33:41,031 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 182 transitions, 1283 flow [2022-01-19 02:33:41,031 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 02:33:41,032 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:41,032 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 02:33:41,058 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 02:33:41,255 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 02:33:41,256 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 02:33:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:41,256 INFO L85 PathProgramCache]: Analyzing trace with hash -687977584, now seen corresponding path program 2 times [2022-01-19 02:33:41,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:41,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392076427] [2022-01-19 02:33:41,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:41,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:41,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:41,417 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 02:33:41,417 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:41,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392076427] [2022-01-19 02:33:41,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392076427] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:33:41,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898364629] [2022-01-19 02:33:41,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 02:33:41,418 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:33:41,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:33:41,420 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 02:33:41,421 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 02:33:41,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 02:33:41,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:33:41,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 02:33:41,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:33:42,090 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 02:33:42,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:33:42,490 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 02:33:42,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898364629] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:33:42,491 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:33:42,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-01-19 02:33:42,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801283995] [2022-01-19 02:33:42,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:33:42,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 02:33:42,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:42,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 02:33:42,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-01-19 02:33:42,496 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 02:33:42,497 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 02:33:42,498 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:42,498 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 02:33:42,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:48,452 INFO L129 PetriNetUnfolder]: 26368/50183 cut-off events. [2022-01-19 02:33:48,452 INFO L130 PetriNetUnfolder]: For 298653/298811 co-relation queries the response was YES. [2022-01-19 02:33:48,709 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 02:33:49,106 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 558 selfloop transitions, 95 changer transitions 12/733 dead transitions. [2022-01-19 02:33:49,106 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 733 transitions, 8145 flow [2022-01-19 02:33:49,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-19 02:33:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-19 02:33:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2482 transitions. [2022-01-19 02:33:49,110 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7287140340575455 [2022-01-19 02:33:49,110 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2482 transitions. [2022-01-19 02:33:49,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2482 transitions. [2022-01-19 02:33:49,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:49,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2482 transitions. [2022-01-19 02:33:49,116 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 02:33:49,121 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 02:33:49,122 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 02:33:49,122 INFO L186 Difference]: Start difference. First operand has 171 places, 182 transitions, 1283 flow. Second operand 26 states and 2482 transitions. [2022-01-19 02:33:49,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 733 transitions, 8145 flow [2022-01-19 02:33:49,413 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 02:33:49,419 INFO L242 Difference]: Finished difference. Result has 208 places, 245 transitions, 2344 flow [2022-01-19 02:33:49,419 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 02:33:49,419 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 91 predicate places. [2022-01-19 02:33:49,419 INFO L470 AbstractCegarLoop]: Abstraction has has 208 places, 245 transitions, 2344 flow [2022-01-19 02:33:49,420 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 02:33:49,420 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:49,420 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 02:33:49,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 02:33:49,621 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 02:33:49,622 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 02:33:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash 982740406, now seen corresponding path program 3 times [2022-01-19 02:33:49,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:49,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109495505] [2022-01-19 02:33:49,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:49,623 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:49,765 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 02:33:49,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:49,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109495505] [2022-01-19 02:33:49,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109495505] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:33:49,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492758090] [2022-01-19 02:33:49,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 02:33:49,766 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:33:49,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:33:49,767 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 02:33:49,791 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 02:33:49,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 02:33:49,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:33:49,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-19 02:33:49,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:33:50,298 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 02:33:50,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 02:33:50,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492758090] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:50,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 02:33:50,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-01-19 02:33:50,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863840922] [2022-01-19 02:33:50,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:50,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:33:50,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:33:50,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-01-19 02:33:50,301 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 131 [2022-01-19 02:33:50,301 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 02:33:50,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:50,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 131 [2022-01-19 02:33:50,302 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:33:53,943 INFO L129 PetriNetUnfolder]: 10650/26189 cut-off events. [2022-01-19 02:33:53,943 INFO L130 PetriNetUnfolder]: For 313006/316351 co-relation queries the response was YES. [2022-01-19 02:33:54,094 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 02:33:54,238 INFO L132 encePairwiseOnDemand]: 121/131 looper letters, 156 selfloop transitions, 25 changer transitions 3/270 dead transitions. [2022-01-19 02:33:54,238 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 270 transitions, 3063 flow [2022-01-19 02:33:54,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:33:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:33:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 963 transitions. [2022-01-19 02:33:54,240 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7351145038167939 [2022-01-19 02:33:54,240 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 963 transitions. [2022-01-19 02:33:54,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 963 transitions. [2022-01-19 02:33:54,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:33:54,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 963 transitions. [2022-01-19 02:33:54,242 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 02:33:54,243 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 02:33:54,243 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 02:33:54,244 INFO L186 Difference]: Start difference. First operand has 208 places, 245 transitions, 2344 flow. Second operand 10 states and 963 transitions. [2022-01-19 02:33:54,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 270 transitions, 3063 flow [2022-01-19 02:33:54,531 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 02:33:54,534 INFO L242 Difference]: Finished difference. Result has 204 places, 237 transitions, 2103 flow [2022-01-19 02:33:54,535 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 02:33:54,535 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 87 predicate places. [2022-01-19 02:33:54,535 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 237 transitions, 2103 flow [2022-01-19 02:33:54,535 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 02:33:54,536 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:33:54,536 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 02:33:54,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 02:33:54,739 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 02:33:54,739 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 02:33:54,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:33:54,740 INFO L85 PathProgramCache]: Analyzing trace with hash 822271266, now seen corresponding path program 2 times [2022-01-19 02:33:54,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:33:54,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515149595] [2022-01-19 02:33:54,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:33:54,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:33:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:33:54,859 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 02:33:54,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:33:54,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515149595] [2022-01-19 02:33:54,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515149595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 02:33:54,859 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 02:33:54,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 02:33:54,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493707860] [2022-01-19 02:33:54,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 02:33:54,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 02:33:54,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:33:54,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 02:33:54,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-19 02:33:54,861 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 02:33:54,862 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 02:33:54,862 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:33:54,862 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 02:33:54,862 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:34:00,049 INFO L129 PetriNetUnfolder]: 22812/40363 cut-off events. [2022-01-19 02:34:00,049 INFO L130 PetriNetUnfolder]: For 413664/413703 co-relation queries the response was YES. [2022-01-19 02:34:00,324 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 02:34:00,538 INFO L132 encePairwiseOnDemand]: 119/131 looper letters, 169 selfloop transitions, 28 changer transitions 15/280 dead transitions. [2022-01-19 02:34:00,539 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 280 transitions, 3030 flow [2022-01-19 02:34:00,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 02:34:00,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 02:34:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 910 transitions. [2022-01-19 02:34:00,540 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6946564885496184 [2022-01-19 02:34:00,540 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 910 transitions. [2022-01-19 02:34:00,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 910 transitions. [2022-01-19 02:34:00,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:34:00,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 910 transitions. [2022-01-19 02:34:00,542 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 02:34:00,544 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 02:34:00,544 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 02:34:00,544 INFO L186 Difference]: Start difference. First operand has 204 places, 237 transitions, 2103 flow. Second operand 10 states and 910 transitions. [2022-01-19 02:34:00,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 280 transitions, 3030 flow [2022-01-19 02:34:01,049 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 02:34:01,052 INFO L242 Difference]: Finished difference. Result has 200 places, 239 transitions, 2166 flow [2022-01-19 02:34:01,053 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 02:34:01,053 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 83 predicate places. [2022-01-19 02:34:01,053 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 239 transitions, 2166 flow [2022-01-19 02:34:01,054 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 02:34:01,054 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:34:01,054 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 02:34:01,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 02:34:01,054 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 02:34:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:34:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1431070086, now seen corresponding path program 1 times [2022-01-19 02:34:01,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:34:01,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511792921] [2022-01-19 02:34:01,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:34:01,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:34:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:34:01,161 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 02:34:01,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:34:01,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511792921] [2022-01-19 02:34:01,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511792921] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:34:01,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253251411] [2022-01-19 02:34:01,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:34:01,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:34:01,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:34:01,163 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 02:34:01,164 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 02:34:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:34:01,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-01-19 02:34:01,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:34:01,534 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 02:34:01,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:34:01,822 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 02:34:01,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253251411] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:34:01,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:34:01,823 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2022-01-19 02:34:01,823 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923126087] [2022-01-19 02:34:01,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:34:01,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 02:34:01,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:34:01,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 02:34:01,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 02:34:01,825 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2022-01-19 02:34:01,826 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 02:34:01,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:34:01,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2022-01-19 02:34:01,826 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:34:02,278 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 02:34:02,278 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-01-19 02:34:02,278 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 02:34:02,278 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 02:34:02,278 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-01-19 02:34:02,289 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 02:34:02,289 INFO L384 tUnfolder$Statistics]: this new event has 72 ancestors and is cut-off event [2022-01-19 02:34:02,289 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 02:34:02,289 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-01-19 02:34:02,289 INFO L387 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-01-19 02:34:02,628 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 02:34:02,628 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 02:34:02,628 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 02:34:02,628 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 02:34:02,628 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 02:34:02,630 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 02:34:02,631 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-01-19 02:34:02,631 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:02,631 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:02,631 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:02,711 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 02:34:02,711 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is cut-off event [2022-01-19 02:34:02,711 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:02,711 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:02,711 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:02,758 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 02:34:02,758 INFO L384 tUnfolder$Statistics]: this new event has 76 ancestors and is not cut-off event [2022-01-19 02:34:02,758 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-01-19 02:34:02,758 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-01-19 02:34:02,758 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is not cut-off event [2022-01-19 02:34:03,159 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 02:34:03,160 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,160 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,160 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:03,160 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:03,210 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 02:34:03,210 INFO L384 tUnfolder$Statistics]: this new event has 77 ancestors and is not cut-off event [2022-01-19 02:34:03,210 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-01-19 02:34:03,210 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-01-19 02:34:03,210 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is not cut-off event [2022-01-19 02:34:03,270 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 02:34:03,271 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,271 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:03,271 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:03,271 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:03,307 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 02:34:03,307 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,307 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,307 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 02:34:03,308 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 02:34:03,365 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 02:34:03,365 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,365 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,365 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 02:34:03,365 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-01-19 02:34:03,365 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 02:34:03,365 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,365 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 02:34:03,365 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 02:34:03,365 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,394 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 02:34:03,395 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,395 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:34:03,395 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,395 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:34:03,405 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 02:34:03,405 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,405 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:03,405 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:03,405 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:03,425 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 02:34:03,425 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,425 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,425 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,425 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,432 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 02:34:03,432 INFO L384 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,432 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,433 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,433 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:03,689 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 02:34:03,689 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,689 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,689 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,689 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,705 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 02:34:03,705 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,705 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,705 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,705 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,706 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 02:34:03,706 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,706 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,706 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,706 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,712 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 02:34:03,712 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,712 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 02:34:03,712 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-01-19 02:34:03,712 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,712 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:03,713 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 02:34:03,714 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,714 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,714 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,714 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,816 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 02:34:03,817 INFO L384 tUnfolder$Statistics]: this new event has 79 ancestors and is not cut-off event [2022-01-19 02:34:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-01-19 02:34:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-01-19 02:34:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is not cut-off event [2022-01-19 02:34:03,817 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 02:34:03,817 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,194 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 02:34:04,195 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,195 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,195 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,195 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,304 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 02:34:04,305 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,305 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,305 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,305 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,305 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 02:34:04,305 INFO L384 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,305 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:04,305 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,305 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:04,305 INFO L387 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-01-19 02:34:04,450 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 02:34:04,450 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 02:34:04,450 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:04,450 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:04,450 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:04,558 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 02:34:04,558 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 02:34:04,559 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:34:04,559 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 02:34:04,559 INFO L387 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-01-19 02:34:04,566 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 02:34:04,566 INFO L384 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-01-19 02:34:04,566 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:04,566 INFO L387 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-01-19 02:34:04,566 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:04,720 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 02:34:04,720 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 02:34:04,720 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,720 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,720 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,731 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 02:34:04,731 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 02:34:04,731 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:04,731 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:04,731 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 02:34:04,731 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 02:34:04,731 INFO L384 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-01-19 02:34:04,731 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:04,731 INFO L387 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-01-19 02:34:04,731 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 02:34:04,879 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 02:34:04,879 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 02:34:04,880 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,880 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,880 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:04,968 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 02:34:04,969 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,969 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,969 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,969 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,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][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 02:34:04,978 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,978 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,978 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,978 INFO L387 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,983 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 02:34:04,983 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,983 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:04,983 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:04,983 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:04,984 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 02:34:04,984 INFO L384 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-01-19 02:34:04,984 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:04,984 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:04,984 INFO L387 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-01-19 02:34:05,398 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 02:34:05,398 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 02:34:05,398 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,398 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,398 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 02:34:05,442 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 02:34:05,442 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 02:34:05,442 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,442 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,442 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,443 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 02:34:05,443 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 02:34:05,443 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,443 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,443 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,443 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,443 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-01-19 02:34:05,448 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 02:34:05,448 INFO L384 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-01-19 02:34:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 02:34:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 02:34:05,448 INFO L387 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-01-19 02:34:05,573 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 02:34:05,574 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-19 02:34:05,574 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 02:34:05,574 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 02:34:05,574 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 02:34:05,652 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 02:34:05,653 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2022-01-19 02:34:05,653 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 02:34:05,653 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 02:34:05,653 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 02:34:05,833 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 02:34:05,833 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-19 02:34:05,833 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 02:34:05,833 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 02:34:05,833 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 02:34:05,834 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 02:34:05,834 INFO L384 tUnfolder$Statistics]: this new event has 86 ancestors and is cut-off event [2022-01-19 02:34:05,834 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 02:34:05,834 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 02:34:05,834 INFO L387 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-01-19 02:34:06,002 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 02:34:06,002 INFO L384 tUnfolder$Statistics]: this new event has 87 ancestors and is cut-off event [2022-01-19 02:34:06,002 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 02:34:06,002 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 02:34:06,002 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-01-19 02:34:06,244 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 02:34:06,244 INFO L384 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-01-19 02:34:06,245 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 02:34:06,245 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 02:34:06,245 INFO L387 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-01-19 02:34:06,598 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 02:34:06,599 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 02:34:06,599 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 02:34:06,599 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 02:34:06,599 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 02:34:06,599 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 02:34:06,600 INFO L384 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-01-19 02:34:06,600 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 02:34:06,600 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 02:34:06,600 INFO L387 tUnfolder$Statistics]: existing Event has 86 ancestors and is cut-off event [2022-01-19 02:34:06,672 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 02:34:06,673 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,673 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,673 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,673 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,673 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 02:34:06,673 INFO L384 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,673 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 02:34:06,673 INFO L387 tUnfolder$Statistics]: existing Event has 87 ancestors and is cut-off event [2022-01-19 02:34:06,673 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,766 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 02:34:06,766 INFO L384 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-01-19 02:34:06,766 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,766 INFO L387 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-01-19 02:34:06,766 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,820 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 02:34:06,820 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-01-19 02:34:06,820 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,821 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,821 INFO L387 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-01-19 02:34:06,998 INFO L129 PetriNetUnfolder]: 13872/37203 cut-off events. [2022-01-19 02:34:06,998 INFO L130 PetriNetUnfolder]: For 536006/543256 co-relation queries the response was YES. [2022-01-19 02:34:07,307 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 02:34:07,485 INFO L132 encePairwiseOnDemand]: 123/131 looper letters, 79 selfloop transitions, 147 changer transitions 4/354 dead transitions. [2022-01-19 02:34:07,485 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 354 transitions, 4045 flow [2022-01-19 02:34:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 02:34:07,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 02:34:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2022-01-19 02:34:07,488 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8429661941112323 [2022-01-19 02:34:07,488 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2022-01-19 02:34:07,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2022-01-19 02:34:07,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:34:07,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2022-01-19 02:34:07,489 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 02:34:07,490 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 02:34:07,491 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 02:34:07,491 INFO L186 Difference]: Start difference. First operand has 200 places, 239 transitions, 2166 flow. Second operand 7 states and 773 transitions. [2022-01-19 02:34:07,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 354 transitions, 4045 flow [2022-01-19 02:34:08,137 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 02:34:08,141 INFO L242 Difference]: Finished difference. Result has 201 places, 322 transitions, 3950 flow [2022-01-19 02:34:08,142 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 02:34:08,142 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 84 predicate places. [2022-01-19 02:34:08,142 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 322 transitions, 3950 flow [2022-01-19 02:34:08,142 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 02:34:08,143 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:34:08,143 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 02:34:08,159 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 02:34:08,347 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 02:34:08,347 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 02:34:08,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:34:08,348 INFO L85 PathProgramCache]: Analyzing trace with hash -670284878, now seen corresponding path program 2 times [2022-01-19 02:34:08,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:34:08,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873040402] [2022-01-19 02:34:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:34:08,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:34:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:34:08,491 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 02:34:08,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:34:08,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873040402] [2022-01-19 02:34:08,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873040402] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:34:08,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854922868] [2022-01-19 02:34:08,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 02:34:08,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:34:08,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:34:08,493 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 02:34:08,494 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 02:34:08,594 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 02:34:08,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:34:08,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 02:34:08,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:34:09,061 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 02:34:09,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:34:09,397 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 02:34:09,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854922868] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:34:09,397 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:34:09,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-01-19 02:34:09,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161574357] [2022-01-19 02:34:09,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:34:09,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 02:34:09,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:34:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 02:34:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2022-01-19 02:34:09,400 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2022-01-19 02:34:09,401 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 02:34:09,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:34:09,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2022-01-19 02:34:09,401 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:34:26,506 INFO L129 PetriNetUnfolder]: 60760/110335 cut-off events. [2022-01-19 02:34:26,506 INFO L130 PetriNetUnfolder]: For 1346340/1346441 co-relation queries the response was YES. [2022-01-19 02:34:27,424 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 02:34:27,931 INFO L132 encePairwiseOnDemand]: 114/131 looper letters, 956 selfloop transitions, 586 changer transitions 0/1609 dead transitions. [2022-01-19 02:34:27,931 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1609 transitions, 25483 flow [2022-01-19 02:34:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 02:34:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 02:34:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 5429 transitions. [2022-01-19 02:34:27,935 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7145301395103975 [2022-01-19 02:34:27,935 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 5429 transitions. [2022-01-19 02:34:27,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 5429 transitions. [2022-01-19 02:34:27,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:34:27,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 5429 transitions. [2022-01-19 02:34:27,942 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 02:34:27,949 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 02:34:27,951 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 02:34:27,952 INFO L186 Difference]: Start difference. First operand has 201 places, 322 transitions, 3950 flow. Second operand 58 states and 5429 transitions. [2022-01-19 02:34:27,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1609 transitions, 25483 flow [2022-01-19 02:34:32,695 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 02:34:32,709 INFO L242 Difference]: Finished difference. Result has 290 places, 751 transitions, 11492 flow [2022-01-19 02:34:32,709 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 02:34:32,709 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 173 predicate places. [2022-01-19 02:34:32,709 INFO L470 AbstractCegarLoop]: Abstraction has has 290 places, 751 transitions, 11492 flow [2022-01-19 02:34:32,710 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 02:34:32,710 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:34:32,710 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 02:34:32,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-19 02:34:32,919 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 02:34:32,919 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 02:34:32,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:34:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1537742894, now seen corresponding path program 3 times [2022-01-19 02:34:32,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:34:32,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962646271] [2022-01-19 02:34:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:34:32,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:34:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:34:33,069 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 02:34:33,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:34:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962646271] [2022-01-19 02:34:33,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962646271] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:34:33,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093265484] [2022-01-19 02:34:33,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 02:34:33,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:34:33,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:34:33,071 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 02:34:33,073 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 02:34:33,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 02:34:33,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:34:33,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 02:34:33,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:34:33,628 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 02:34:33,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:34:33,939 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 02:34:33,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093265484] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:34:33,939 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:34:33,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-01-19 02:34:33,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005682889] [2022-01-19 02:34:33,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:34:33,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-19 02:34:33,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:34:33,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-19 02:34:33,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-01-19 02:34:33,942 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 131 [2022-01-19 02:34:33,943 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 02:34:33,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:34:33,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 131 [2022-01-19 02:34:33,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:35:15,467 INFO L129 PetriNetUnfolder]: 97298/182625 cut-off events. [2022-01-19 02:35:15,467 INFO L130 PetriNetUnfolder]: For 6436872/6436969 co-relation queries the response was YES. [2022-01-19 02:35:18,776 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 02:35:20,200 INFO L132 encePairwiseOnDemand]: 118/131 looper letters, 1416 selfloop transitions, 590 changer transitions 98/2172 dead transitions. [2022-01-19 02:35:20,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 2172 transitions, 39798 flow [2022-01-19 02:35:20,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-19 02:35:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-01-19 02:35:20,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2175 transitions. [2022-01-19 02:35:20,205 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7218718884832392 [2022-01-19 02:35:20,205 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2175 transitions. [2022-01-19 02:35:20,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2175 transitions. [2022-01-19 02:35:20,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:35:20,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2175 transitions. [2022-01-19 02:35:20,208 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 02:35:20,222 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 02:35:20,232 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 02:35:20,233 INFO L186 Difference]: Start difference. First operand has 290 places, 751 transitions, 11492 flow. Second operand 23 states and 2175 transitions. [2022-01-19 02:35:20,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 2172 transitions, 39798 flow [2022-01-19 02:36:44,688 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 02:36:44,713 INFO L242 Difference]: Finished difference. Result has 307 places, 1213 transitions, 20047 flow [2022-01-19 02:36:44,714 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 02:36:44,715 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 190 predicate places. [2022-01-19 02:36:44,715 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 1213 transitions, 20047 flow [2022-01-19 02:36:44,715 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 02:36:44,716 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 02:36:44,716 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 02:36:44,739 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 02:36:44,931 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 02:36:44,931 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 02:36:44,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 02:36:44,932 INFO L85 PathProgramCache]: Analyzing trace with hash 160369916, now seen corresponding path program 4 times [2022-01-19 02:36:44,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 02:36:44,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673254761] [2022-01-19 02:36:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 02:36:44,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 02:36:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 02:36:45,067 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 02:36:45,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 02:36:45,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673254761] [2022-01-19 02:36:45,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673254761] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 02:36:45,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927756684] [2022-01-19 02:36:45,067 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 02:36:45,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 02:36:45,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 02:36:45,068 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 02:36:45,071 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 02:36:45,149 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 02:36:45,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 02:36:45,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-19 02:36:45,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 02:36:45,553 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 02:36:45,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 02:36:45,890 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 02:36:45,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927756684] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 02:36:45,891 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 02:36:45,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2022-01-19 02:36:45,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616731299] [2022-01-19 02:36:45,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 02:36:45,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 02:36:45,893 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 02:36:45,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 02:36:45,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-19 02:36:45,895 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 131 [2022-01-19 02:36:45,896 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 02:36:45,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 02:36:45,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 131 [2022-01-19 02:36:45,896 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 02:38:35,620 INFO L129 PetriNetUnfolder]: 174098/336389 cut-off events. [2022-01-19 02:38:35,621 INFO L130 PetriNetUnfolder]: For 12775559/12775810 co-relation queries the response was YES. [2022-01-19 02:38:42,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2587577 conditions, 336389 events. 174098/336389 cut-off events. For 12775559/12775810 co-relation queries the response was YES. Maximal size of possible extension queue 21584. Compared 4458830 event pairs, 19683 based on Foata normal form. 5294/338101 useless extension candidates. Maximal degree in co-relation 2587484. Up to 60912 conditions per place. [2022-01-19 02:38:44,660 INFO L132 encePairwiseOnDemand]: 114/131 looper letters, 2497 selfloop transitions, 2527 changer transitions 103/5194 dead transitions. [2022-01-19 02:38:44,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 5194 transitions, 102637 flow [2022-01-19 02:38:44,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-01-19 02:38:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2022-01-19 02:38:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 7179 transitions. [2022-01-19 02:38:44,667 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7117081391890552 [2022-01-19 02:38:44,667 INFO L72 ComplementDD]: Start complementDD. Operand 77 states and 7179 transitions. [2022-01-19 02:38:44,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 7179 transitions. [2022-01-19 02:38:44,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 02:38:44,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 77 states and 7179 transitions. [2022-01-19 02:38:44,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 78 states, 77 states have (on average 93.23376623376623) internal successors, (7179), 77 states have internal predecessors, (7179), 0 states have call successors, (0), 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 02:38:44,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 78 states, 78 states have (on average 131.0) internal successors, (10218), 78 states have internal predecessors, (10218), 0 states have call successors, (0), 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 02:38:44,689 INFO L81 ComplementDD]: Finished complementDD. Result has 78 states, 78 states have (on average 131.0) internal successors, (10218), 78 states have internal predecessors, (10218), 0 states have call successors, (0), 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 02:38:44,689 INFO L186 Difference]: Start difference. First operand has 307 places, 1213 transitions, 20047 flow. Second operand 77 states and 7179 transitions. [2022-01-19 02:38:44,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 5194 transitions, 102637 flow Received shutdown request... [2022-01-19 02:46:19,294 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 02:46:19,295 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 02:46:20,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 02:46:20,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-01-19 02:46:24,127 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-19 02:46:24,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 02:46:24,128 WARN L594 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2022-01-19 02:46:24,129 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-01-19 02:46:24,129 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-01-19 02:46:24,129 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-01-19 02:46:24,130 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-01-19 02:46:24,133 INFO L732 BasicCegarLoop]: Path program histogram: [5, 4, 3, 2, 2, 1, 1] [2022-01-19 02:46:24,135 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 02:46:24,135 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 02:46:24,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 02:46:24 BasicIcfg [2022-01-19 02:46:24,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 02:46:24,137 INFO L158 Benchmark]: Toolchain (without parser) took 778136.38ms. Allocated memory was 400.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 347.6MB in the beginning and 7.1GB in the end (delta: -6.8GB). Peak memory consumption was 11.2GB. Max. memory is 16.0GB. [2022-01-19 02:46:24,137 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 400.6MB. Free memory is still 363.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 02:46:24,138 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.82ms. Allocated memory was 400.6MB in the beginning and 551.6MB in the end (delta: 151.0MB). Free memory was 347.4MB in the beginning and 523.8MB in the end (delta: -176.4MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. [2022-01-19 02:46:24,138 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.63ms. Allocated memory is still 551.6MB. Free memory was 523.8MB in the beginning and 521.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 02:46:24,138 INFO L158 Benchmark]: Boogie Preprocessor took 23.16ms. Allocated memory is still 551.6MB. Free memory was 521.8MB in the beginning and 520.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 02:46:24,138 INFO L158 Benchmark]: RCFGBuilder took 450.14ms. Allocated memory is still 551.6MB. Free memory was 520.7MB in the beginning and 499.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-19 02:46:24,139 INFO L158 Benchmark]: TraceAbstraction took 777378.05ms. Allocated memory was 551.6MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 499.7MB in the beginning and 7.1GB in the end (delta: -6.6GB). Peak memory consumption was 11.2GB. Max. memory is 16.0GB. [2022-01-19 02:46:24,140 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 400.6MB. Free memory is still 363.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 248.82ms. Allocated memory was 400.6MB in the beginning and 551.6MB in the end (delta: 151.0MB). Free memory was 347.4MB in the beginning and 523.8MB in the end (delta: -176.4MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.63ms. Allocated memory is still 551.6MB. Free memory was 523.8MB in the beginning and 521.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.16ms. Allocated memory is still 551.6MB. Free memory was 521.8MB in the beginning and 520.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 450.14ms. Allocated memory is still 551.6MB. Free memory was 520.7MB in the beginning and 499.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 777378.05ms. Allocated memory was 551.6MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 499.7MB in the beginning and 7.1GB in the end (delta: -6.6GB). Peak memory consumption was 11.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 146 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 777.2s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 764.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4625 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4625 mSDsluCounter, 2337 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4281 mSDsCounter, 685 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6335 IncrementalHoareTripleChecker+Invalid, 7020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 685 mSolverCounterUnsat, 429 mSDtfsCounter, 6335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2239 GetRequests, 1806 SyntacticMatches, 7 SemanticMatches, 426 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6001 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20047occurred in iteration=17, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 2888 NumberOfCodeBlocks, 2874 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3692 ConstructedInterpolants, 0 QuantifiedInterpolants, 18636 SizeOfPredicates, 92 NumberOfNonLiveVariables, 2773 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 36 InterpolantComputations, 12 PerfectInterpolantSequences, 74/128 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown