/usr/bin/java -Xmx8000000000 -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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:41:02,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:41:02,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:41:02,180 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:41:02,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:41:02,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:41:02,185 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:41:02,189 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:41:02,193 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:41:02,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:41:02,212 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:41:02,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:41:02,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:41:02,215 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:41:02,216 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:41:02,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:41:02,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:41:02,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:41:02,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:41:02,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:41:02,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:41:02,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:41:02,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:41:02,227 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:41:02,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:41:02,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:41:02,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:41:02,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:41:02,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:41:02,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:41:02,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:41:02,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:41:02,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:41:02,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:41:02,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:41:02,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:41:02,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:41:02,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:41:02,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:41:02,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:41:02,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:41:02,239 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:41:02,264 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:41:02,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:41:02,266 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:41:02,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:41:02,266 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:41:02,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:41:02,267 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:41:02,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:41:02,267 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:41:02,267 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:41:02,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:41:02,268 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:41:02,268 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:41:02,268 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:41:02,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:41:02,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:41:02,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:41:02,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:41:02,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:41:02,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:41:02,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:41:02,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:41:02,269 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:41:02,269 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:41:02,269 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:41:02,269 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:41:02,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:41:02,270 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:41:02,270 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-12-06 07:41:02,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:41:02,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:41:02,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:41:02,550 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:41:02,551 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:41:02,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-06 07:41:03,557 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:41:03,732 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:41:03,732 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2022-12-06 07:41:03,737 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3588e4470/94ea60c525b8434f9322752671fa8071/FLAGf642c1db5 [2022-12-06 07:41:03,747 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3588e4470/94ea60c525b8434f9322752671fa8071 [2022-12-06 07:41:03,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:41:03,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:41:03,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:41:03,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:41:03,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:41:03,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:03,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b59c18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03, skipping insertion in model container [2022-12-06 07:41:03,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:03,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:41:03,773 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:41:03,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,897 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,902 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,909 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,910 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,919 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-12-06 07:41:03,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:41:03,943 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:41:03,956 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,958 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,959 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,960 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,961 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:41:03,968 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:41:03,974 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c[2924,2937] [2022-12-06 07:41:03,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:41:03,994 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:41:03,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03 WrapperNode [2022-12-06 07:41:03,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:41:03,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:41:03,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:41:03,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:41:04,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,046 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-06 07:41:04,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:41:04,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:41:04,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:41:04,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:41:04,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,080 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:41:04,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:41:04,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:41:04,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:41:04,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (1/1) ... [2022-12-06 07:41:04,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:41:04,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:41:04,116 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-12-06 07:41:04,135 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-12-06 07:41:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:41:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:41:04,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:41:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:41:04,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:41:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:41:04,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:41:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:41:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:41:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:41:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:41:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:41:04,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:41:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:41:04,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:41:04,151 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 07:41:04,267 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:41:04,268 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:41:04,501 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:41:04,595 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:41:04,595 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 07:41:04,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:41:04 BoogieIcfgContainer [2022-12-06 07:41:04,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:41:04,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:41:04,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:41:04,614 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:41:04,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:41:03" (1/3) ... [2022-12-06 07:41:04,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c10f38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:41:04, skipping insertion in model container [2022-12-06 07:41:04,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:41:03" (2/3) ... [2022-12-06 07:41:04,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c10f38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:41:04, skipping insertion in model container [2022-12-06 07:41:04,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:41:04" (3/3) ... [2022-12-06 07:41:04,621 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2022-12-06 07:41:04,648 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:41:04,649 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:41:04,649 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:41:04,701 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 07:41:04,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 07:41:04,785 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-06 07:41:04,785 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:41:04,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 07:41:04,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-06 07:41:04,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-06 07:41:04,801 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:04,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 07:41:04,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 163 transitions, 338 flow [2022-12-06 07:41:04,846 INFO L130 PetriNetUnfolder]: 15/163 cut-off events. [2022-12-06 07:41:04,846 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:41:04,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 163 events. 15/163 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-06 07:41:04,848 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 163 transitions, 338 flow [2022-12-06 07:41:04,849 INFO L188 LiptonReduction]: Number of co-enabled transitions 690 [2022-12-06 07:41:10,276 INFO L203 LiptonReduction]: Total number of compositions: 140 [2022-12-06 07:41:10,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:41:10,291 INFO L357 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=REPEATED_LIPTON_PN, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c04d339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:41:10,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 07:41:10,295 INFO L130 PetriNetUnfolder]: 5/22 cut-off events. [2022-12-06 07:41:10,295 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:41:10,295 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:10,296 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:10,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:10,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1533171233, now seen corresponding path program 1 times [2022-12-06 07:41:10,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:10,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948003679] [2022-12-06 07:41:10,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:10,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:41:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:10,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948003679] [2022-12-06 07:41:10,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948003679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:10,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:10,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:41:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667320684] [2022-12-06 07:41:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:10,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:41:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:10,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:41:10,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:41:10,687 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:10,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-12-06 07:41:10,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:10,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:10,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:10,759 INFO L130 PetriNetUnfolder]: 146/245 cut-off events. [2022-12-06 07:41:10,760 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-06 07:41:10,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 245 events. 146/245 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 773 event pairs, 38 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 472. Up to 153 conditions per place. [2022-12-06 07:41:10,762 INFO L137 encePairwiseOnDemand]: 18/23 looper letters, 31 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2022-12-06 07:41:10,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 155 flow [2022-12-06 07:41:10,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:41:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:41:10,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:41:10,770 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2022-12-06 07:41:10,771 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:41:10,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 155 flow [2022-12-06 07:41:10,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 07:41:10,775 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:10,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2022-12-06 07:41:10,778 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2022-12-06 07:41:10,778 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:10,779 INFO L89 Accepts]: Start accepts. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:10,781 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:10,781 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:10,781 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:10,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:10,787 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 07:41:10,787 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:41:10,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 29 events. 6/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 6 conditions per place. [2022-12-06 07:41:10,788 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:10,788 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 07:41:10,802 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:41:10,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 25 [2022-12-06 07:41:10,803 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2022-12-06 07:41:10,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-12-06 07:41:10,803 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:10,803 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:10,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:41:10,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash 908602455, now seen corresponding path program 1 times [2022-12-06 07:41:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:10,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666070343] [2022-12-06 07:41:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:10,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:41:10,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:10,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666070343] [2022-12-06 07:41:10,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666070343] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:10,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:10,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:41:10,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112513393] [2022-12-06 07:41:10,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:10,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:41:10,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:10,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:41:10,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:41:10,902 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:10,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-06 07:41:10,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:10,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:10,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:10,977 INFO L130 PetriNetUnfolder]: 146/246 cut-off events. [2022-12-06 07:41:10,977 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 07:41:10,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 246 events. 146/246 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 769 event pairs, 38 based on Foata normal form. 1/206 useless extension candidates. Maximal degree in co-relation 182. Up to 153 conditions per place. [2022-12-06 07:41:10,978 INFO L137 encePairwiseOnDemand]: 17/23 looper letters, 31 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2022-12-06 07:41:10,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 36 transitions, 166 flow [2022-12-06 07:41:10,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:41:10,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:41:10,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-12-06 07:41:10,980 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40217391304347827 [2022-12-06 07:41:10,980 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 4 states and 37 transitions. [2022-12-06 07:41:10,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 36 transitions, 166 flow [2022-12-06 07:41:10,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 36 transitions, 161 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 07:41:10,982 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:10,982 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2022-12-06 07:41:10,982 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2022-12-06 07:41:10,982 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:10,982 INFO L89 Accepts]: Start accepts. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:10,983 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:10,983 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:10,983 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:10,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:10,986 INFO L130 PetriNetUnfolder]: 6/30 cut-off events. [2022-12-06 07:41:10,987 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 07:41:10,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 30 events. 6/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 45 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 33. Up to 6 conditions per place. [2022-12-06 07:41:10,987 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 26 transitions, 84 flow [2022-12-06 07:41:10,987 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 07:41:11,223 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:41:11,224 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 242 [2022-12-06 07:41:11,224 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 80 flow [2022-12-06 07:41:11,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-06 07:41:11,224 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:11,224 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:11,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:41:11,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:11,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1878813032, now seen corresponding path program 1 times [2022-12-06 07:41:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:11,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520083747] [2022-12-06 07:41:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:11,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:41:11,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:11,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520083747] [2022-12-06 07:41:11,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520083747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:11,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:11,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:41:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700289535] [2022-12-06 07:41:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:11,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:41:11,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:11,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:41:11,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:41:11,329 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:11,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-06 07:41:11,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:11,329 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:11,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:11,442 INFO L130 PetriNetUnfolder]: 228/381 cut-off events. [2022-12-06 07:41:11,442 INFO L131 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2022-12-06 07:41:11,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 381 events. 228/381 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1410 event pairs, 40 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 858. Up to 212 conditions per place. [2022-12-06 07:41:11,445 INFO L137 encePairwiseOnDemand]: 16/23 looper letters, 36 selfloop transitions, 16 changer transitions 0/52 dead transitions. [2022-12-06 07:41:11,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 52 transitions, 266 flow [2022-12-06 07:41:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:41:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:41:11,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-12-06 07:41:11,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41739130434782606 [2022-12-06 07:41:11,447 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 80 flow. Second operand 5 states and 48 transitions. [2022-12-06 07:41:11,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 52 transitions, 266 flow [2022-12-06 07:41:11,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 52 transitions, 244 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-06 07:41:11,450 INFO L231 Difference]: Finished difference. Result has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:11,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=30, PETRI_TRANSITIONS=39} [2022-12-06 07:41:11,452 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2022-12-06 07:41:11,452 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:11,452 INFO L89 Accepts]: Start accepts. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:11,453 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:11,453 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:11,453 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:11,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:11,460 INFO L130 PetriNetUnfolder]: 29/82 cut-off events. [2022-12-06 07:41:11,460 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-06 07:41:11,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 82 events. 29/82 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 256 event pairs, 1 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 168. Up to 28 conditions per place. [2022-12-06 07:41:11,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:11,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 07:41:11,468 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:41:11,470 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 18 [2022-12-06 07:41:11,470 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 39 transitions, 181 flow [2022-12-06 07:41:11,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 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-12-06 07:41:11,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:11,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:11,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:41:11,470 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:11,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1128489956, now seen corresponding path program 2 times [2022-12-06 07:41:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:11,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58609935] [2022-12-06 07:41:11,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:11,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:11,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:41:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:11,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58609935] [2022-12-06 07:41:11,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58609935] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:11,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:11,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 07:41:11,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939353781] [2022-12-06 07:41:11,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:11,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:41:11,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:11,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:41:11,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:41:11,554 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 07:41:11,555 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 39 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-12-06 07:41:11,555 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:11,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 07:41:11,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:11,621 INFO L130 PetriNetUnfolder]: 296/490 cut-off events. [2022-12-06 07:41:11,621 INFO L131 PetriNetUnfolder]: For 453/462 co-relation queries the response was YES. [2022-12-06 07:41:11,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1571 conditions, 490 events. 296/490 cut-off events. For 453/462 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1909 event pairs, 100 based on Foata normal form. 5/449 useless extension candidates. Maximal degree in co-relation 874. Up to 263 conditions per place. [2022-12-06 07:41:11,624 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 46 selfloop transitions, 5 changer transitions 2/55 dead transitions. [2022-12-06 07:41:11,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 55 transitions, 358 flow [2022-12-06 07:41:11,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:41:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:41:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-12-06 07:41:11,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5652173913043478 [2022-12-06 07:41:11,625 INFO L175 Difference]: Start difference. First operand has 30 places, 39 transitions, 181 flow. Second operand 3 states and 39 transitions. [2022-12-06 07:41:11,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 55 transitions, 358 flow [2022-12-06 07:41:11,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 55 transitions, 354 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-06 07:41:11,630 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:11,630 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2022-12-06 07:41:11,631 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 8 predicate places. [2022-12-06 07:41:11,631 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:11,631 INFO L89 Accepts]: Start accepts. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:11,633 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:11,633 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:11,633 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:11,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:11,641 INFO L130 PetriNetUnfolder]: 37/101 cut-off events. [2022-12-06 07:41:11,642 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2022-12-06 07:41:11,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 101 events. 37/101 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 336 event pairs, 2 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 243. Up to 38 conditions per place. [2022-12-06 07:41:11,643 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:11,643 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-06 07:41:11,649 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:41:11,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 07:41:11,655 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 207 flow [2022-12-06 07:41:11,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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-12-06 07:41:11,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:11,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:11,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:41:11,655 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1026730500, now seen corresponding path program 1 times [2022-12-06 07:41:11,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:11,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10802297] [2022-12-06 07:41:11,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:41:11,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:11,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10802297] [2022-12-06 07:41:11,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10802297] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:41:11,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25253428] [2022-12-06 07:41:11,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:11,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:41:11,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:41:11,826 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-12-06 07:41:11,847 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-12-06 07:41:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:11,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:41:11,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:41:11,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:41:11,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:41:11,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25253428] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:11,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:41:11,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2022-12-06 07:41:11,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083878484] [2022-12-06 07:41:11,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:11,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:41:11,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:11,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:41:11,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:41:11,977 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:11,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 207 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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-12-06 07:41:11,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:11,977 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:11,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:12,081 INFO L130 PetriNetUnfolder]: 304/527 cut-off events. [2022-12-06 07:41:12,081 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2022-12-06 07:41:12,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 527 events. 304/527 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2076 event pairs, 82 based on Foata normal form. 30/524 useless extension candidates. Maximal degree in co-relation 1085. Up to 374 conditions per place. [2022-12-06 07:41:12,084 INFO L137 encePairwiseOnDemand]: 20/23 looper letters, 50 selfloop transitions, 2 changer transitions 5/57 dead transitions. [2022-12-06 07:41:12,084 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 57 transitions, 389 flow [2022-12-06 07:41:12,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:41:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:41:12,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-12-06 07:41:12,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5362318840579711 [2022-12-06 07:41:12,085 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 207 flow. Second operand 3 states and 37 transitions. [2022-12-06 07:41:12,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 57 transitions, 389 flow [2022-12-06 07:41:12,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 57 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:41:12,087 INFO L231 Difference]: Finished difference. Result has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:12,087 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=35, PETRI_TRANSITIONS=41} [2022-12-06 07:41:12,088 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 10 predicate places. [2022-12-06 07:41:12,088 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:12,088 INFO L89 Accepts]: Start accepts. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:12,088 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:12,088 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:12,089 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:12,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:12,097 INFO L130 PetriNetUnfolder]: 37/114 cut-off events. [2022-12-06 07:41:12,097 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-06 07:41:12,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 114 events. 37/114 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 429 event pairs, 2 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 263. Up to 33 conditions per place. [2022-12-06 07:41:12,098 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:12,098 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 07:41:12,099 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:41:12,100 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 07:41:12,100 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 41 transitions, 214 flow [2022-12-06 07:41:12,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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-12-06 07:41:12,100 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:12,100 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:12,107 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-12-06 07:41:12,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:41:12,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:12,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:12,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1914271914, now seen corresponding path program 1 times [2022-12-06 07:41:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:12,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531517115] [2022-12-06 07:41:12,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:12,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:12,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:41:12,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:12,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531517115] [2022-12-06 07:41:12,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531517115] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:41:12,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:41:12,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:41:12,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405541654] [2022-12-06 07:41:12,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:41:12,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:41:12,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:12,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:41:12,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:41:12,398 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 23 [2022-12-06 07:41:12,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 41 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-12-06 07:41:12,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:12,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 23 [2022-12-06 07:41:12,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:12,485 INFO L130 PetriNetUnfolder]: 344/631 cut-off events. [2022-12-06 07:41:12,486 INFO L131 PetriNetUnfolder]: For 799/816 co-relation queries the response was YES. [2022-12-06 07:41:12,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2132 conditions, 631 events. 344/631 cut-off events. For 799/816 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2836 event pairs, 212 based on Foata normal form. 33/601 useless extension candidates. Maximal degree in co-relation 1467. Up to 476 conditions per place. [2022-12-06 07:41:12,488 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 38 selfloop transitions, 2 changer transitions 20/62 dead transitions. [2022-12-06 07:41:12,489 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 424 flow [2022-12-06 07:41:12,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:41:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:41:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-12-06 07:41:12,490 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4673913043478261 [2022-12-06 07:41:12,490 INFO L175 Difference]: Start difference. First operand has 35 places, 41 transitions, 214 flow. Second operand 4 states and 43 transitions. [2022-12-06 07:41:12,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 424 flow [2022-12-06 07:41:12,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 62 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 07:41:12,495 INFO L231 Difference]: Finished difference. Result has 39 places, 42 transitions, 226 flow [2022-12-06 07:41:12,495 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=39, PETRI_TRANSITIONS=42} [2022-12-06 07:41:12,496 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2022-12-06 07:41:12,497 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:41:12,497 INFO L89 Accepts]: Start accepts. Operand has 39 places, 42 transitions, 226 flow [2022-12-06 07:41:12,497 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:41:12,498 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:41:12,498 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 42 transitions, 226 flow [2022-12-06 07:41:12,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 42 transitions, 226 flow [2022-12-06 07:41:12,507 INFO L130 PetriNetUnfolder]: 37/115 cut-off events. [2022-12-06 07:41:12,507 INFO L131 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-12-06 07:41:12,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311 conditions, 115 events. 37/115 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 425 event pairs, 2 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 293. Up to 33 conditions per place. [2022-12-06 07:41:12,508 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 42 transitions, 226 flow [2022-12-06 07:41:12,508 INFO L188 LiptonReduction]: Number of co-enabled transitions 168 [2022-12-06 07:41:13,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:41:13,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 870 [2022-12-06 07:41:13,367 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 41 transitions, 222 flow [2022-12-06 07:41:13,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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-12-06 07:41:13,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:41:13,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:41:13,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 07:41:13,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:41:13,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:41:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash 788331176, now seen corresponding path program 1 times [2022-12-06 07:41:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:41:13,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741781607] [2022-12-06 07:41:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:41:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:41:14,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:41:14,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741781607] [2022-12-06 07:41:14,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741781607] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:41:14,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010286901] [2022-12-06 07:41:14,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:41:14,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:41:14,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:41:14,437 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-12-06 07:41:14,438 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-12-06 07:41:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:41:14,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-06 07:41:14,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:41:14,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:41:14,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-06 07:41:14,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:41:14,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:41:14,931 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-12-06 07:41:14,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 10 [2022-12-06 07:41:14,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:41:14,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:41:15,314 INFO L321 Elim1Store]: treesize reduction 15, result has 83.9 percent of original size [2022-12-06 07:41:15,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 256 [2022-12-06 07:41:15,337 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:41:15,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 174 treesize of output 189 [2022-12-06 07:41:15,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:41:15,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 137 [2022-12-06 07:41:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:41:15,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010286901] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:41:15,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:41:15,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2022-12-06 07:41:15,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431243047] [2022-12-06 07:41:15,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:41:15,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 07:41:15,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:41:15,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 07:41:15,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=545, Unknown=3, NotChecked=0, Total=702 [2022-12-06 07:41:15,840 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:41:15,840 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 41 transitions, 222 flow. Second operand has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 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-12-06 07:41:15,840 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:41:15,840 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:41:15,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:41:23,467 WARN L233 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 83 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:41:34,407 WARN L233 SmtUtils]: Spent 10.62s on a formula simplification. DAG size of input: 75 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:41:36,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:41:47,326 WARN L233 SmtUtils]: Spent 7.56s on a formula simplification. DAG size of input: 82 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:42:00,707 WARN L233 SmtUtils]: Spent 13.19s on a formula simplification. DAG size of input: 90 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:42:14,130 WARN L233 SmtUtils]: Spent 13.21s on a formula simplification. DAG size of input: 89 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:42:30,962 WARN L233 SmtUtils]: Spent 16.77s on a formula simplification. DAG size of input: 82 DAG size of output: 71 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:42:38,345 WARN L233 SmtUtils]: Spent 7.28s on a formula simplification. DAG size of input: 87 DAG size of output: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:42:39,111 INFO L130 PetriNetUnfolder]: 1632/2867 cut-off events. [2022-12-06 07:42:39,111 INFO L131 PetriNetUnfolder]: For 2876/2876 co-relation queries the response was YES. [2022-12-06 07:42:39,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9658 conditions, 2867 events. 1632/2867 cut-off events. For 2876/2876 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 16998 event pairs, 220 based on Foata normal form. 31/2709 useless extension candidates. Maximal degree in co-relation 9640. Up to 669 conditions per place. [2022-12-06 07:42:39,123 INFO L137 encePairwiseOnDemand]: 9/23 looper letters, 265 selfloop transitions, 121 changer transitions 84/470 dead transitions. [2022-12-06 07:42:39,123 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 470 transitions, 3198 flow [2022-12-06 07:42:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 07:42:39,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 07:42:39,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 363 transitions. [2022-12-06 07:42:39,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40468227424749165 [2022-12-06 07:42:39,126 INFO L175 Difference]: Start difference. First operand has 37 places, 41 transitions, 222 flow. Second operand 39 states and 363 transitions. [2022-12-06 07:42:39,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 470 transitions, 3198 flow [2022-12-06 07:42:39,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 470 transitions, 3158 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 07:42:39,148 INFO L231 Difference]: Finished difference. Result has 96 places, 165 transitions, 1508 flow [2022-12-06 07:42:39,149 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1508, PETRI_PLACES=96, PETRI_TRANSITIONS=165} [2022-12-06 07:42:39,149 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 71 predicate places. [2022-12-06 07:42:39,149 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:39,149 INFO L89 Accepts]: Start accepts. Operand has 96 places, 165 transitions, 1508 flow [2022-12-06 07:42:39,150 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:39,151 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:39,151 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 165 transitions, 1508 flow [2022-12-06 07:42:39,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 165 transitions, 1508 flow [2022-12-06 07:42:39,202 INFO L130 PetriNetUnfolder]: 274/735 cut-off events. [2022-12-06 07:42:39,203 INFO L131 PetriNetUnfolder]: For 3652/3692 co-relation queries the response was YES. [2022-12-06 07:42:39,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3123 conditions, 735 events. 274/735 cut-off events. For 3652/3692 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4837 event pairs, 6 based on Foata normal form. 5/716 useless extension candidates. Maximal degree in co-relation 3050. Up to 213 conditions per place. [2022-12-06 07:42:39,208 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 91 places, 165 transitions, 1508 flow [2022-12-06 07:42:39,208 INFO L188 LiptonReduction]: Number of co-enabled transitions 644 [2022-12-06 07:42:39,413 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:42:46,483 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:42:46,713 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:46,736 INFO L203 LiptonReduction]: Total number of compositions: 7 [2022-12-06 07:42:46,736 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7587 [2022-12-06 07:42:46,736 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 161 transitions, 1520 flow [2022-12-06 07:42:46,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 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-12-06 07:42:46,737 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:46,737 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:46,745 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-12-06 07:42:46,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-12-06 07:42:46,941 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:42:46,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:46,942 INFO L85 PathProgramCache]: Analyzing trace with hash -613260868, now seen corresponding path program 1 times [2022-12-06 07:42:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:46,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265700665] [2022-12-06 07:42:46,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:46,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:47,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:47,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265700665] [2022-12-06 07:42:47,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265700665] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:47,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776346174] [2022-12-06 07:42:47,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:47,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:47,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:47,032 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-12-06 07:42:47,034 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-12-06 07:42:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:47,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:42:47,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:47,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:42:47,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:47,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776346174] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:42:47,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:42:47,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-12-06 07:42:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38663881] [2022-12-06 07:42:47,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:42:47,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:42:47,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:47,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:42:47,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:42:47,203 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 32 [2022-12-06 07:42:47,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 161 transitions, 1520 flow. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-06 07:42:47,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:47,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 32 [2022-12-06 07:42:47,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:47,590 INFO L130 PetriNetUnfolder]: 1316/2328 cut-off events. [2022-12-06 07:42:47,591 INFO L131 PetriNetUnfolder]: For 12652/12652 co-relation queries the response was YES. [2022-12-06 07:42:47,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11293 conditions, 2328 events. 1316/2328 cut-off events. For 12652/12652 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13087 event pairs, 206 based on Foata normal form. 66/2393 useless extension candidates. Maximal degree in co-relation 11193. Up to 710 conditions per place. [2022-12-06 07:42:47,604 INFO L137 encePairwiseOnDemand]: 19/32 looper letters, 131 selfloop transitions, 108 changer transitions 1/240 dead transitions. [2022-12-06 07:42:47,605 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 240 transitions, 2674 flow [2022-12-06 07:42:47,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:42:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:42:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-12-06 07:42:47,606 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3541666666666667 [2022-12-06 07:42:47,606 INFO L175 Difference]: Start difference. First operand has 87 places, 161 transitions, 1520 flow. Second operand 6 states and 68 transitions. [2022-12-06 07:42:47,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 240 transitions, 2674 flow [2022-12-06 07:42:47,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 240 transitions, 2396 flow, removed 114 selfloop flow, removed 7 redundant places. [2022-12-06 07:42:47,649 INFO L231 Difference]: Finished difference. Result has 89 places, 198 transitions, 2181 flow [2022-12-06 07:42:47,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1288, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2181, PETRI_PLACES=89, PETRI_TRANSITIONS=198} [2022-12-06 07:42:47,651 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 64 predicate places. [2022-12-06 07:42:47,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:47,651 INFO L89 Accepts]: Start accepts. Operand has 89 places, 198 transitions, 2181 flow [2022-12-06 07:42:47,654 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:47,654 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:47,654 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 198 transitions, 2181 flow [2022-12-06 07:42:47,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 198 transitions, 2181 flow [2022-12-06 07:42:47,717 INFO L130 PetriNetUnfolder]: 317/832 cut-off events. [2022-12-06 07:42:47,717 INFO L131 PetriNetUnfolder]: For 4478/4560 co-relation queries the response was YES. [2022-12-06 07:42:47,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 832 events. 317/832 cut-off events. For 4478/4560 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5479 event pairs, 4 based on Foata normal form. 6/816 useless extension candidates. Maximal degree in co-relation 3238. Up to 250 conditions per place. [2022-12-06 07:42:47,724 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 198 transitions, 2181 flow [2022-12-06 07:42:47,724 INFO L188 LiptonReduction]: Number of co-enabled transitions 740 [2022-12-06 07:42:47,918 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:42:47,918 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 267 [2022-12-06 07:42:47,919 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 198 transitions, 2187 flow [2022-12-06 07:42:47,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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-12-06 07:42:47,919 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:47,919 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:47,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:42:48,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:48,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:42:48,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash -713760388, now seen corresponding path program 2 times [2022-12-06 07:42:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:48,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065932655] [2022-12-06 07:42:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:48,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:48,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065932655] [2022-12-06 07:42:48,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065932655] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:48,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333792752] [2022-12-06 07:42:48,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:42:48,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:48,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:48,687 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-12-06 07:42:48,689 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-12-06 07:42:48,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:42:48,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:42:48,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-06 07:42:48,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:50,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:42:50,905 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:42:50,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 07:42:50,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-06 07:42:50,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:42:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:51,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:42:51,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:42:51,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-06 07:42:51,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-12-06 07:42:51,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:51,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333792752] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:42:51,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:42:51,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:42:51,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422693121] [2022-12-06 07:42:51,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:42:51,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:42:51,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:51,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:42:51,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=283, Unknown=1, NotChecked=0, Total=380 [2022-12-06 07:42:51,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 07:42:51,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 198 transitions, 2187 flow. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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-12-06 07:42:51,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:51,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 07:42:51,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:53,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:42:54,816 INFO L130 PetriNetUnfolder]: 1995/3478 cut-off events. [2022-12-06 07:42:54,817 INFO L131 PetriNetUnfolder]: For 20240/20240 co-relation queries the response was YES. [2022-12-06 07:42:54,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18444 conditions, 3478 events. 1995/3478 cut-off events. For 20240/20240 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20250 event pairs, 350 based on Foata normal form. 9/3486 useless extension candidates. Maximal degree in co-relation 16394. Up to 1298 conditions per place. [2022-12-06 07:42:54,843 INFO L137 encePairwiseOnDemand]: 13/33 looper letters, 229 selfloop transitions, 144 changer transitions 30/403 dead transitions. [2022-12-06 07:42:54,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 403 transitions, 4955 flow [2022-12-06 07:42:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:42:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:42:54,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 134 transitions. [2022-12-06 07:42:54,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29004329004329005 [2022-12-06 07:42:54,845 INFO L175 Difference]: Start difference. First operand has 88 places, 198 transitions, 2187 flow. Second operand 14 states and 134 transitions. [2022-12-06 07:42:54,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 403 transitions, 4955 flow [2022-12-06 07:42:54,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 403 transitions, 4813 flow, removed 48 selfloop flow, removed 1 redundant places. [2022-12-06 07:42:54,925 INFO L231 Difference]: Finished difference. Result has 109 places, 282 transitions, 3679 flow [2022-12-06 07:42:54,925 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3679, PETRI_PLACES=109, PETRI_TRANSITIONS=282} [2022-12-06 07:42:54,926 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 84 predicate places. [2022-12-06 07:42:54,926 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:54,926 INFO L89 Accepts]: Start accepts. Operand has 109 places, 282 transitions, 3679 flow [2022-12-06 07:42:54,927 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:54,928 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:54,928 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 282 transitions, 3679 flow [2022-12-06 07:42:54,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 282 transitions, 3679 flow [2022-12-06 07:42:55,031 INFO L130 PetriNetUnfolder]: 436/1132 cut-off events. [2022-12-06 07:42:55,031 INFO L131 PetriNetUnfolder]: For 8312/8385 co-relation queries the response was YES. [2022-12-06 07:42:55,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6406 conditions, 1132 events. 436/1132 cut-off events. For 8312/8385 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 7762 event pairs, 7 based on Foata normal form. 12/1131 useless extension candidates. Maximal degree in co-relation 6341. Up to 385 conditions per place. [2022-12-06 07:42:55,040 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 282 transitions, 3679 flow [2022-12-06 07:42:55,040 INFO L188 LiptonReduction]: Number of co-enabled transitions 1092 [2022-12-06 07:42:55,146 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:57,296 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:42:57,297 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2371 [2022-12-06 07:42:57,297 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 281 transitions, 3687 flow [2022-12-06 07:42:57,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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-12-06 07:42:57,297 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:57,297 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:57,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 07:42:57,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:57,502 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:42:57,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:57,503 INFO L85 PathProgramCache]: Analyzing trace with hash -677687481, now seen corresponding path program 1 times [2022-12-06 07:42:57,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:57,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224002937] [2022-12-06 07:42:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:42:57,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:42:57,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224002937] [2022-12-06 07:42:57,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224002937] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:42:57,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912114824] [2022-12-06 07:42:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:57,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:42:57,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:42:57,645 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-12-06 07:42:57,646 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-12-06 07:42:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:42:57,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 07:42:57,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:42:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:57,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:42:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:42:57,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912114824] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:42:57,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:42:57,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 10 [2022-12-06 07:42:57,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259729876] [2022-12-06 07:42:57,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:42:57,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 07:42:57,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:42:57,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 07:42:57,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2022-12-06 07:42:57,831 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 36 [2022-12-06 07:42:57,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 281 transitions, 3687 flow. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-06 07:42:57,831 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:42:57,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 36 [2022-12-06 07:42:57,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:42:58,516 INFO L130 PetriNetUnfolder]: 2132/3894 cut-off events. [2022-12-06 07:42:58,516 INFO L131 PetriNetUnfolder]: For 31195/31195 co-relation queries the response was YES. [2022-12-06 07:42:58,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23110 conditions, 3894 events. 2132/3894 cut-off events. For 31195/31195 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 23655 event pairs, 329 based on Foata normal form. 208/4102 useless extension candidates. Maximal degree in co-relation 23014. Up to 1202 conditions per place. [2022-12-06 07:42:58,591 INFO L137 encePairwiseOnDemand]: 20/36 looper letters, 266 selfloop transitions, 134 changer transitions 24/424 dead transitions. [2022-12-06 07:42:58,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 424 transitions, 6111 flow [2022-12-06 07:42:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 07:42:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 07:42:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2022-12-06 07:42:58,593 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2022-12-06 07:42:58,593 INFO L175 Difference]: Start difference. First operand has 107 places, 281 transitions, 3687 flow. Second operand 8 states and 114 transitions. [2022-12-06 07:42:58,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 424 transitions, 6111 flow [2022-12-06 07:42:58,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 424 transitions, 5901 flow, removed 104 selfloop flow, removed 4 redundant places. [2022-12-06 07:42:58,709 INFO L231 Difference]: Finished difference. Result has 112 places, 280 transitions, 4080 flow [2022-12-06 07:42:58,710 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=2898, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4080, PETRI_PLACES=112, PETRI_TRANSITIONS=280} [2022-12-06 07:42:58,710 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 87 predicate places. [2022-12-06 07:42:58,710 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:42:58,711 INFO L89 Accepts]: Start accepts. Operand has 112 places, 280 transitions, 4080 flow [2022-12-06 07:42:58,714 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:42:58,714 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:42:58,714 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 280 transitions, 4080 flow [2022-12-06 07:42:58,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 280 transitions, 4080 flow [2022-12-06 07:42:58,830 INFO L130 PetriNetUnfolder]: 487/1396 cut-off events. [2022-12-06 07:42:58,831 INFO L131 PetriNetUnfolder]: For 11077/11156 co-relation queries the response was YES. [2022-12-06 07:42:58,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8302 conditions, 1396 events. 487/1396 cut-off events. For 11077/11156 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10150 event pairs, 11 based on Foata normal form. 14/1392 useless extension candidates. Maximal degree in co-relation 7698. Up to 448 conditions per place. [2022-12-06 07:42:58,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 280 transitions, 4080 flow [2022-12-06 07:42:58,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 974 [2022-12-06 07:42:58,846 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->L79: Formula: (and (= (ite (= (ite (and (<= v_~new~0_66 v_~v_old~0_93) (not (= (mod v_~ok~0_101 256) 0))) 1 0) 0) 0 1) v_~ok~0_100) (= v_~new~0_66 (select (select |v_#memory_int_298| v_~queue~0.base_124) (+ v_~queue~0.offset_125 (* v_~start~0_158 4)))) (= (ite (= (ite (or (< v_~i~0_198 v_~N~0_169) (< v_~start~0_157 v_~end~0_214)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_76|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= v_~start~0_157 (+ v_~start~0_158 1)) (= (ite (and (< v_~start~0_158 v_~end~0_214) (< v_~start~0_158 v_~n~0_123) (<= 0 v_~start~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~new~0_66 v_~v_old~0_92)) InVars {~start~0=v_~start~0_158, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_101, ~i~0=v_~i~0_198, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~N~0=v_~N~0_169, ~v_old~0=v_~v_old~0_93, ~queue~0.base=v_~queue~0.base_124, ~n~0=v_~n~0_123} OutVars{~start~0=v_~start~0_157, ~new~0=v_~new~0_66, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_100, ~i~0=v_~i~0_198, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_169, ~queue~0.base=v_~queue~0.base_124, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_21|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_76|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~v_old~0=v_~v_old~0_92, ~n~0=v_~n~0_123} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:58,923 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [702] $Ultimate##0-->L79: Formula: (and (= (ite (= (ite (and (<= v_~new~0_66 v_~v_old~0_93) (not (= (mod v_~ok~0_101 256) 0))) 1 0) 0) 0 1) v_~ok~0_100) (= v_~new~0_66 (select (select |v_#memory_int_298| v_~queue~0.base_124) (+ v_~queue~0.offset_125 (* v_~start~0_158 4)))) (= (ite (= (ite (or (< v_~i~0_198 v_~N~0_169) (< v_~start~0_157 v_~end~0_214)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_76|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21| 0)) (= v_~start~0_157 (+ v_~start~0_158 1)) (= (ite (and (< v_~start~0_158 v_~end~0_214) (< v_~start~0_158 v_~n~0_123) (<= 0 v_~start~0_158)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|) (= v_~new~0_66 v_~v_old~0_92)) InVars {~start~0=v_~start~0_158, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_101, ~i~0=v_~i~0_198, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~N~0=v_~N~0_169, ~v_old~0=v_~v_old~0_93, ~queue~0.base=v_~queue~0.base_124, ~n~0=v_~n~0_123} OutVars{~start~0=v_~start~0_157, ~new~0=v_~new~0_66, ~queue~0.offset=v_~queue~0.offset_125, ~ok~0=v_~ok~0_100, ~i~0=v_~i~0_198, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_21|, ~N~0=v_~N~0_169, ~queue~0.base=v_~queue~0.base_124, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_21|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_21|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_76|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_21|, #memory_int=|v_#memory_int_298|, ~end~0=v_~end~0_214, ~v_old~0=v_~v_old~0_92, ~n~0=v_~n~0_123} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:58,992 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:59,072 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:59,149 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:42:59,253 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:42:59,311 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [685] L79-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res#1.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res#1.offset_Out_4| 0) (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_In_1| 256) 0)) InVars {thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|} OutVars{thread2Thread1of1ForFork1_#res#1.base=|v_thread2Thread1of1ForFork1_#res#1.base_Out_4|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_In_1|, thread2Thread1of1ForFork1_#res#1.offset=|v_thread2Thread1of1ForFork1_#res#1.offset_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res#1.base, thread2Thread1of1ForFork1_#res#1.offset] and [577] L59-->L49-4: Formula: (and (= (select (select |v_#memory_int_75| v_~A~0.base_35) (+ (* v_~i~0_47 4) v_~A~0.offset_35)) |v_thread1Thread1of1ForFork0_#t~mem1#1_25|) (not (<= |v_thread1Thread1of1ForFork0_#t~mem1#1_25| v_~last~0_20)) (< v_~i~0_47 v_~N~0_29)) InVars {~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, ~last~0=v_~last~0_20} OutVars{~A~0.base=v_~A~0.base_35, ~A~0.offset=v_~A~0.offset_35, ~i~0=v_~i~0_47, #memory_int=|v_#memory_int_75|, ~N~0=v_~N~0_29, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_25|, ~last~0=v_~last~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:42:59,388 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:42:59,389 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 679 [2022-12-06 07:42:59,389 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 279 transitions, 4124 flow [2022-12-06 07:42:59,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-06 07:42:59,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:42:59,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:42:59,430 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-12-06 07:42:59,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 07:42:59,626 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:42:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:42:59,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1504779699, now seen corresponding path program 1 times [2022-12-06 07:42:59,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:42:59,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163356383] [2022-12-06 07:42:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:42:59,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:42:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:43:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:43:00,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163356383] [2022-12-06 07:43:00,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163356383] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:43:00,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676898633] [2022-12-06 07:43:00,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:00,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:43:00,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:43:00,884 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-12-06 07:43:00,886 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-12-06 07:43:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:00,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 07:43:00,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:43:01,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:43:01,148 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:43:01,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 07:43:01,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-06 07:43:01,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-12-06 07:43:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:43:01,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:43:01,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:01,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 95 treesize of output 140 [2022-12-06 07:43:01,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-12-06 07:43:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:43:01,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676898633] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:43:01,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:43:01,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 07:43:01,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637654281] [2022-12-06 07:43:01,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:43:01,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 07:43:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:43:01,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 07:43:01,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=425, Unknown=2, NotChecked=0, Total=552 [2022-12-06 07:43:01,997 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 42 [2022-12-06 07:43:01,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 279 transitions, 4124 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 07:43:01,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:43:01,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 42 [2022-12-06 07:43:01,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:43:12,407 INFO L130 PetriNetUnfolder]: 4850/8747 cut-off events. [2022-12-06 07:43:12,407 INFO L131 PetriNetUnfolder]: For 69199/69199 co-relation queries the response was YES. [2022-12-06 07:43:12,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55425 conditions, 8747 events. 4850/8747 cut-off events. For 69199/69199 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 60204 event pairs, 399 based on Foata normal form. 39/8744 useless extension candidates. Maximal degree in co-relation 48325. Up to 2769 conditions per place. [2022-12-06 07:43:12,468 INFO L137 encePairwiseOnDemand]: 9/42 looper letters, 610 selfloop transitions, 512 changer transitions 133/1255 dead transitions. [2022-12-06 07:43:12,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 1255 transitions, 18291 flow [2022-12-06 07:43:12,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-12-06 07:43:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-12-06 07:43:12,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 589 transitions. [2022-12-06 07:43:12,473 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.21575091575091576 [2022-12-06 07:43:12,473 INFO L175 Difference]: Start difference. First operand has 111 places, 279 transitions, 4124 flow. Second operand 65 states and 589 transitions. [2022-12-06 07:43:12,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 1255 transitions, 18291 flow [2022-12-06 07:43:12,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 1255 transitions, 18143 flow, removed 74 selfloop flow, removed 0 redundant places. [2022-12-06 07:43:12,763 INFO L231 Difference]: Finished difference. Result has 219 places, 660 transitions, 11549 flow [2022-12-06 07:43:12,763 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=4086, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=11549, PETRI_PLACES=219, PETRI_TRANSITIONS=660} [2022-12-06 07:43:12,764 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 194 predicate places. [2022-12-06 07:43:12,764 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:43:12,764 INFO L89 Accepts]: Start accepts. Operand has 219 places, 660 transitions, 11549 flow [2022-12-06 07:43:12,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:43:12,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:43:12,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 219 places, 660 transitions, 11549 flow [2022-12-06 07:43:12,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 213 places, 660 transitions, 11549 flow [2022-12-06 07:43:13,206 INFO L130 PetriNetUnfolder]: 1070/2869 cut-off events. [2022-12-06 07:43:13,206 INFO L131 PetriNetUnfolder]: For 51753/51902 co-relation queries the response was YES. [2022-12-06 07:43:13,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22379 conditions, 2869 events. 1070/2869 cut-off events. For 51753/51902 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 23369 event pairs, 10 based on Foata normal form. 23/2868 useless extension candidates. Maximal degree in co-relation 22033. Up to 1057 conditions per place. [2022-12-06 07:43:13,284 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 213 places, 660 transitions, 11549 flow [2022-12-06 07:43:13,284 INFO L188 LiptonReduction]: Number of co-enabled transitions 2276 [2022-12-06 07:43:13,287 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:43:13,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:43:13,405 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:13,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:13,657 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:13,761 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:13,954 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:43:14,001 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:14,088 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:14,351 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:43:14,387 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:14,485 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:16,228 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:16,361 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:43:16,439 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:16,541 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:16,651 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:16,739 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:43:16,847 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 07:43:16,848 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4084 [2022-12-06 07:43:16,848 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 653 transitions, 11715 flow [2022-12-06 07:43:16,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 07:43:16,848 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:43:16,848 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:43:16,854 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-12-06 07:43:17,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:43:17,055 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:43:17,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:43:17,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1559512805, now seen corresponding path program 1 times [2022-12-06 07:43:17,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:43:17,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579433488] [2022-12-06 07:43:17,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:17,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:43:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:43:18,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:43:18,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579433488] [2022-12-06 07:43:18,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579433488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:43:18,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835006132] [2022-12-06 07:43:18,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:18,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:43:18,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:43:18,286 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-12-06 07:43:18,287 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-12-06 07:43:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:18,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-06 07:43:18,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:43:18,686 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-06 07:43:18,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 10 [2022-12-06 07:43:18,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:43:18,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:43:21,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:21,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 126 [2022-12-06 07:43:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:43:21,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835006132] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:43:21,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:43:21,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2022-12-06 07:43:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620959536] [2022-12-06 07:43:21,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:43:21,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:43:21,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:43:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:43:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-12-06 07:43:21,226 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 07:43:21,226 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 653 transitions, 11715 flow. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 07:43:21,226 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:43:21,226 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 07:43:21,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:43:26,060 INFO L130 PetriNetUnfolder]: 6429/11290 cut-off events. [2022-12-06 07:43:26,061 INFO L131 PetriNetUnfolder]: For 196334/196334 co-relation queries the response was YES. [2022-12-06 07:43:26,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90979 conditions, 11290 events. 6429/11290 cut-off events. For 196334/196334 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 79982 event pairs, 634 based on Foata normal form. 13/11283 useless extension candidates. Maximal degree in co-relation 90612. Up to 4268 conditions per place. [2022-12-06 07:43:26,230 INFO L137 encePairwiseOnDemand]: 28/74 looper letters, 574 selfloop transitions, 486 changer transitions 43/1103 dead transitions. [2022-12-06 07:43:26,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1103 transitions, 21023 flow [2022-12-06 07:43:26,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:43:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:43:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 245 transitions. [2022-12-06 07:43:26,244 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19475357710651828 [2022-12-06 07:43:26,245 INFO L175 Difference]: Start difference. First operand has 206 places, 653 transitions, 11715 flow. Second operand 17 states and 245 transitions. [2022-12-06 07:43:26,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1103 transitions, 21023 flow [2022-12-06 07:43:27,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 1103 transitions, 19554 flow, removed 730 selfloop flow, removed 12 redundant places. [2022-12-06 07:43:27,659 INFO L231 Difference]: Finished difference. Result has 221 places, 867 transitions, 16305 flow [2022-12-06 07:43:27,659 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=10766, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=274, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=16305, PETRI_PLACES=221, PETRI_TRANSITIONS=867} [2022-12-06 07:43:27,660 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 196 predicate places. [2022-12-06 07:43:27,660 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:43:27,660 INFO L89 Accepts]: Start accepts. Operand has 221 places, 867 transitions, 16305 flow [2022-12-06 07:43:27,663 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:43:27,663 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:43:27,663 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 867 transitions, 16305 flow [2022-12-06 07:43:27,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 867 transitions, 16305 flow [2022-12-06 07:43:28,313 INFO L130 PetriNetUnfolder]: 1546/3979 cut-off events. [2022-12-06 07:43:28,313 INFO L131 PetriNetUnfolder]: For 76379/76545 co-relation queries the response was YES. [2022-12-06 07:43:28,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32277 conditions, 3979 events. 1546/3979 cut-off events. For 76379/76545 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 34445 event pairs, 15 based on Foata normal form. 28/3985 useless extension candidates. Maximal degree in co-relation 32111. Up to 1483 conditions per place. [2022-12-06 07:43:28,370 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 219 places, 867 transitions, 16305 flow [2022-12-06 07:43:28,370 INFO L188 LiptonReduction]: Number of co-enabled transitions 3112 [2022-12-06 07:43:28,375 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:43:28,375 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 715 [2022-12-06 07:43:28,375 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 867 transitions, 16305 flow [2022-12-06 07:43:28,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 07:43:28,376 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:43:28,376 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:43:28,387 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-12-06 07:43:28,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:43:28,581 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:43:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:43:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1718337087, now seen corresponding path program 2 times [2022-12-06 07:43:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:43:28,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632205245] [2022-12-06 07:43:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:43:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:43:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:43:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:43:29,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:43:29,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632205245] [2022-12-06 07:43:29,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632205245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:43:29,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66442772] [2022-12-06 07:43:29,694 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:43:29,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:43:29,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:43:29,695 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-12-06 07:43:29,695 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-12-06 07:43:29,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:43:29,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:43:29,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-06 07:43:29,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:43:29,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:43:29,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:43:29,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:43:29,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:43:30,143 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-06 07:43:30,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 10 [2022-12-06 07:43:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:43:30,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:43:36,578 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (* c_~end~0 4)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_ArrVal_512 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512))) (let ((.cse0 (select .cse2 ~queue~0.base))) (or (not (= (select .cse0 (+ .cse1 ~queue~0.offset)) (select (select .cse2 c_~A~0.base) .cse3))) (< (select .cse0 (+ (* c_~start~0 4) ~queue~0.offset)) (+ c_~v_old~0 1)))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (not (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512))) (= (select (select .cse4 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse3)))))))) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) is different from false [2022-12-06 07:43:36,596 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~end~0 4)) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (forall ((v_ArrVal_512 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512))) (let ((.cse0 (select .cse2 ~queue~0.base))) (or (not (= (select .cse0 (+ .cse1 ~queue~0.offset)) (select (select .cse2 c_~A~0.base) .cse3))) (< (select .cse0 (+ (* c_~start~0 4) ~queue~0.offset)) (+ c_~v_old~0 1)))))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((v_ArrVal_512 (Array Int Int)) (~queue~0.base Int) (~queue~0.offset Int)) (not (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_512))) (= (select (select .cse4 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse4 c_~A~0.base) .cse3)))))))) is different from false [2022-12-06 07:43:36,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:36,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1887 treesize of output 1765 [2022-12-06 07:43:36,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:36,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1606 treesize of output 1487 [2022-12-06 07:43:36,843 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:36,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1402 treesize of output 1231 [2022-12-06 07:43:36,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:43:36,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1186 treesize of output 1011 [2022-12-06 07:43:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 07:43:50,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66442772] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:43:50,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:43:50,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2022-12-06 07:43:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998131336] [2022-12-06 07:43:50,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:43:50,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 07:43:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:43:50,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 07:43:50,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=378, Unknown=3, NotChecked=82, Total=552 [2022-12-06 07:43:50,752 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 74 [2022-12-06 07:43:50,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 867 transitions, 16305 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 07:43:50,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:43:50,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 74 [2022-12-06 07:43:50,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:43:59,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:44:01,755 INFO L130 PetriNetUnfolder]: 5774/10114 cut-off events. [2022-12-06 07:44:01,755 INFO L131 PetriNetUnfolder]: For 190899/190899 co-relation queries the response was YES. [2022-12-06 07:44:01,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84818 conditions, 10114 events. 5774/10114 cut-off events. For 190899/190899 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 70659 event pairs, 482 based on Foata normal form. 48/10141 useless extension candidates. Maximal degree in co-relation 84631. Up to 3606 conditions per place. [2022-12-06 07:44:01,843 INFO L137 encePairwiseOnDemand]: 41/74 looper letters, 468 selfloop transitions, 410 changer transitions 42/920 dead transitions. [2022-12-06 07:44:01,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 920 transitions, 18146 flow [2022-12-06 07:44:01,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 07:44:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 07:44:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 157 transitions. [2022-12-06 07:44:01,844 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1632016632016632 [2022-12-06 07:44:01,845 INFO L175 Difference]: Start difference. First operand has 219 places, 867 transitions, 16305 flow. Second operand 13 states and 157 transitions. [2022-12-06 07:44:01,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 920 transitions, 18146 flow [2022-12-06 07:44:03,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 920 transitions, 17307 flow, removed 342 selfloop flow, removed 16 redundant places. [2022-12-06 07:44:03,114 INFO L231 Difference]: Finished difference. Result has 209 places, 754 transitions, 14801 flow [2022-12-06 07:44:03,114 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=11512, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=14801, PETRI_PLACES=209, PETRI_TRANSITIONS=754} [2022-12-06 07:44:03,115 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 184 predicate places. [2022-12-06 07:44:03,115 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:03,115 INFO L89 Accepts]: Start accepts. Operand has 209 places, 754 transitions, 14801 flow [2022-12-06 07:44:03,119 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:03,119 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:03,119 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 209 places, 754 transitions, 14801 flow [2022-12-06 07:44:03,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 207 places, 754 transitions, 14801 flow [2022-12-06 07:44:03,704 INFO L130 PetriNetUnfolder]: 1372/3554 cut-off events. [2022-12-06 07:44:03,705 INFO L131 PetriNetUnfolder]: For 68621/68729 co-relation queries the response was YES. [2022-12-06 07:44:03,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28867 conditions, 3554 events. 1372/3554 cut-off events. For 68621/68729 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 30398 event pairs, 10 based on Foata normal form. 16/3555 useless extension candidates. Maximal degree in co-relation 28732. Up to 1361 conditions per place. [2022-12-06 07:44:03,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 207 places, 754 transitions, 14801 flow [2022-12-06 07:44:03,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 2816 [2022-12-06 07:44:03,792 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [738] L54-->L79: Formula: (and (= v_~last~0_151 |v_thread1Thread1of1ForFork0_#t~mem5#1_115|) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_162| 256) 0)) (= (ite (and (< v_~start~0_243 v_~n~0_169) (<= 0 v_~start~0_243) (< v_~start~0_243 v_~end~0_280)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|) (= (select (select |v_#memory_int_392| v_~queue~0.base_172) (+ (* v_~start~0_243 4) v_~queue~0.offset_173)) v_~new~0_108) (= (select (select |v_#memory_int_392| v_~A~0.base_198) (+ (* v_~i~0_305 4) v_~A~0.offset_198)) |v_thread1Thread1of1ForFork0_#t~mem5#1_115|) (= v_~start~0_242 (+ v_~start~0_243 1)) (= (ite (= (ite (and (<= v_~new~0_108 v_~v_old~0_170) (not (= (mod v_~ok~0_179 256) 0))) 1 0) 0) 0 1) v_~ok~0_178) (= |v_thread2Thread1of1ForFork1_~cond~0#1_161| (ite (= (ite (or (< v_~i~0_305 v_~N~0_223) (< v_~start~0_242 v_~end~0_280)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|) (= v_~new~0_108 v_~v_old~0_169)) InVars {~start~0=v_~start~0_243, ~queue~0.offset=v_~queue~0.offset_173, ~A~0.base=v_~A~0.base_198, ~ok~0=v_~ok~0_179, ~i~0=v_~i~0_305, ~N~0=v_~N~0_223, ~queue~0.base=v_~queue~0.base_172, ~A~0.offset=v_~A~0.offset_198, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_162|, #memory_int=|v_#memory_int_392|, ~end~0=v_~end~0_280, ~v_old~0=v_~v_old~0_170, ~n~0=v_~n~0_169} OutVars{~start~0=v_~start~0_242, ~new~0=v_~new~0_108, ~queue~0.offset=v_~queue~0.offset_173, ~A~0.base=v_~A~0.base_198, ~ok~0=v_~ok~0_178, ~i~0=v_~i~0_305, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_63|, ~N~0=v_~N~0_223, ~queue~0.base=v_~queue~0.base_172, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_63|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_115|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_63|, ~A~0.offset=v_~A~0.offset_198, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_161|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_63|, #memory_int=|v_#memory_int_392|, ~end~0=v_~end~0_280, ~v_old~0=v_~v_old~0_169, ~n~0=v_~n~0_169, ~last~0=v_~last~0_151} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0, ~last~0] [2022-12-06 07:44:03,793 WARN L322 ript$VariableManager]: TermVariable LBE74 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:03,793 WARN L322 ript$VariableManager]: TermVariable LBE304 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:04,198 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [739] L54-->L59: Formula: (and (= (select (select |v_#memory_int_394| v_~A~0.base_200) (+ (* v_~i~0_308 4) v_~A~0.offset_200)) v_~last~0_153) (= v_~i~0_307 (+ v_~i~0_308 1))) InVars {~A~0.base=v_~A~0.base_200, ~A~0.offset=v_~A~0.offset_200, ~i~0=v_~i~0_308, #memory_int=|v_#memory_int_394|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_117|, ~A~0.base=v_~A~0.base_200, ~A~0.offset=v_~A~0.offset_200, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_66|, ~i~0=v_~i~0_307, #memory_int=|v_#memory_int_394|, ~last~0=v_~last~0_153} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] [2022-12-06 07:44:04,293 WARN L322 ript$VariableManager]: TermVariable LBE74 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:04,294 WARN L322 ript$VariableManager]: TermVariable LBE304 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:04,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:44:04,598 WARN L322 ript$VariableManager]: TermVariable LBE74 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:04,598 WARN L322 ript$VariableManager]: TermVariable LBE304 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 07:44:04,794 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:44:04,902 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:44:10,052 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 07:44:10,053 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6938 [2022-12-06 07:44:10,053 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 751 transitions, 14907 flow [2022-12-06 07:44:10,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 07:44:10,053 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:10,054 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:10,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 07:44:10,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 07:44:10,264 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:10,264 INFO L85 PathProgramCache]: Analyzing trace with hash -812279568, now seen corresponding path program 1 times [2022-12-06 07:44:10,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:10,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920826619] [2022-12-06 07:44:10,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:11,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:11,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920826619] [2022-12-06 07:44:11,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920826619] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:11,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097337140] [2022-12-06 07:44:11,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:11,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:11,394 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-12-06 07:44:11,395 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-12-06 07:44:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:11,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 32 conjunts are in the unsatisfiable core [2022-12-06 07:44:11,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:11,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:44:11,639 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:44:11,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 07:44:11,647 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-06 07:44:11,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 07:44:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:11,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:12,120 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-06 07:44:12,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 73 [2022-12-06 07:44:12,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2022-12-06 07:44:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:12,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097337140] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:44:12,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:44:12,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2022-12-06 07:44:12,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809300709] [2022-12-06 07:44:12,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:44:12,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 07:44:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:12,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 07:44:12,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=409, Unknown=1, NotChecked=0, Total=552 [2022-12-06 07:44:12,239 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 63 [2022-12-06 07:44:12,239 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 751 transitions, 14907 flow. Second operand has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 07:44:12,239 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:12,239 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 63 [2022-12-06 07:44:12,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:16,629 INFO L130 PetriNetUnfolder]: 6678/11639 cut-off events. [2022-12-06 07:44:16,629 INFO L131 PetriNetUnfolder]: For 222297/222297 co-relation queries the response was YES. [2022-12-06 07:44:16,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98106 conditions, 11639 events. 6678/11639 cut-off events. For 222297/222297 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 82854 event pairs, 718 based on Foata normal form. 13/11631 useless extension candidates. Maximal degree in co-relation 97959. Up to 4418 conditions per place. [2022-12-06 07:44:16,747 INFO L137 encePairwiseOnDemand]: 21/63 looper letters, 362 selfloop transitions, 585 changer transitions 32/979 dead transitions. [2022-12-06 07:44:16,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 979 transitions, 20609 flow [2022-12-06 07:44:16,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-06 07:44:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-06 07:44:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 165 transitions. [2022-12-06 07:44:16,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1870748299319728 [2022-12-06 07:44:16,749 INFO L175 Difference]: Start difference. First operand has 204 places, 751 transitions, 14907 flow. Second operand 14 states and 165 transitions. [2022-12-06 07:44:16,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 979 transitions, 20609 flow [2022-12-06 07:44:18,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 979 transitions, 20053 flow, removed 132 selfloop flow, removed 8 redundant places. [2022-12-06 07:44:18,669 INFO L231 Difference]: Finished difference. Result has 216 places, 850 transitions, 18625 flow [2022-12-06 07:44:18,670 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=14543, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=487, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=18625, PETRI_PLACES=216, PETRI_TRANSITIONS=850} [2022-12-06 07:44:18,670 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 191 predicate places. [2022-12-06 07:44:18,670 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:18,670 INFO L89 Accepts]: Start accepts. Operand has 216 places, 850 transitions, 18625 flow [2022-12-06 07:44:18,674 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:18,674 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:18,674 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 216 places, 850 transitions, 18625 flow [2022-12-06 07:44:18,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 850 transitions, 18625 flow [2022-12-06 07:44:19,362 INFO L130 PetriNetUnfolder]: 1602/4092 cut-off events. [2022-12-06 07:44:19,362 INFO L131 PetriNetUnfolder]: For 85545/85646 co-relation queries the response was YES. [2022-12-06 07:44:19,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34577 conditions, 4092 events. 1602/4092 cut-off events. For 85545/85646 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 35486 event pairs, 11 based on Foata normal form. 5/4072 useless extension candidates. Maximal degree in co-relation 33780. Up to 1598 conditions per place. [2022-12-06 07:44:19,521 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 215 places, 850 transitions, 18625 flow [2022-12-06 07:44:19,522 INFO L188 LiptonReduction]: Number of co-enabled transitions 3238 [2022-12-06 07:44:20,586 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] [2022-12-06 07:44:20,622 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:44:20,734 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:44:20,735 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2065 [2022-12-06 07:44:20,735 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 850 transitions, 18661 flow [2022-12-06 07:44:20,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 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-12-06 07:44:20,735 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:20,735 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:20,742 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-12-06 07:44:20,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 07:44:20,940 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:20,941 INFO L85 PathProgramCache]: Analyzing trace with hash 807369168, now seen corresponding path program 1 times [2022-12-06 07:44:20,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:20,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334469442] [2022-12-06 07:44:20,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:21,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:21,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334469442] [2022-12-06 07:44:21,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334469442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:21,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329952673] [2022-12-06 07:44:21,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:21,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:21,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:21,884 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-12-06 07:44:21,928 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-12-06 07:44:22,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:22,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 07:44:22,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:22,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:44:22,157 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:44:22,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-12-06 07:44:22,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-06 07:44:22,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 07:44:22,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:22,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:44:22,572 INFO L321 Elim1Store]: treesize reduction 19, result has 62.7 percent of original size [2022-12-06 07:44:22,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 73 [2022-12-06 07:44:22,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2022-12-06 07:44:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:44:22,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329952673] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:44:22,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:44:22,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 18 [2022-12-06 07:44:22,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064793346] [2022-12-06 07:44:22,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:44:22,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:44:22,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:22,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:44:22,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=279, Unknown=2, NotChecked=0, Total=380 [2022-12-06 07:44:22,694 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 07:44:22,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 850 transitions, 18661 flow. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 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-12-06 07:44:22,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:22,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 07:44:22,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:27,949 INFO L130 PetriNetUnfolder]: 8403/14597 cut-off events. [2022-12-06 07:44:27,949 INFO L131 PetriNetUnfolder]: For 305029/305029 co-relation queries the response was YES. [2022-12-06 07:44:28,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127789 conditions, 14597 events. 8403/14597 cut-off events. For 305029/305029 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 106966 event pairs, 855 based on Foata normal form. 13/14589 useless extension candidates. Maximal degree in co-relation 125457. Up to 6939 conditions per place. [2022-12-06 07:44:28,166 INFO L137 encePairwiseOnDemand]: 25/66 looper letters, 670 selfloop transitions, 544 changer transitions 38/1252 dead transitions. [2022-12-06 07:44:28,166 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 1252 transitions, 28487 flow [2022-12-06 07:44:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 07:44:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 07:44:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 217 transitions. [2022-12-06 07:44:28,168 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19340463458110516 [2022-12-06 07:44:28,168 INFO L175 Difference]: Start difference. First operand has 215 places, 850 transitions, 18661 flow. Second operand 17 states and 217 transitions. [2022-12-06 07:44:28,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 1252 transitions, 28487 flow [2022-12-06 07:44:30,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 1252 transitions, 28210 flow, removed 110 selfloop flow, removed 4 redundant places. [2022-12-06 07:44:30,497 INFO L231 Difference]: Finished difference. Result has 237 places, 1039 transitions, 25025 flow [2022-12-06 07:44:30,497 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=18478, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=354, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=25025, PETRI_PLACES=237, PETRI_TRANSITIONS=1039} [2022-12-06 07:44:30,498 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 212 predicate places. [2022-12-06 07:44:30,498 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:30,498 INFO L89 Accepts]: Start accepts. Operand has 237 places, 1039 transitions, 25025 flow [2022-12-06 07:44:30,503 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:30,504 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:30,504 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 237 places, 1039 transitions, 25025 flow [2022-12-06 07:44:30,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 235 places, 1039 transitions, 25025 flow [2022-12-06 07:44:31,484 INFO L130 PetriNetUnfolder]: 2034/5163 cut-off events. [2022-12-06 07:44:31,484 INFO L131 PetriNetUnfolder]: For 118848/118970 co-relation queries the response was YES. [2022-12-06 07:44:31,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45708 conditions, 5163 events. 2034/5163 cut-off events. For 118848/118970 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 46649 event pairs, 10 based on Foata normal form. 8/5142 useless extension candidates. Maximal degree in co-relation 45605. Up to 2037 conditions per place. [2022-12-06 07:44:31,575 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 235 places, 1039 transitions, 25025 flow [2022-12-06 07:44:31,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 4018 [2022-12-06 07:44:31,583 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:31,584 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1086 [2022-12-06 07:44:31,584 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 1039 transitions, 25025 flow [2022-12-06 07:44:31,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 19 states have internal predecessors, (48), 0 states have call successors, (0), 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-12-06 07:44:31,584 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:31,584 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:31,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-06 07:44:31,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 07:44:31,790 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:31,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash -572349839, now seen corresponding path program 1 times [2022-12-06 07:44:31,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:31,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918714951] [2022-12-06 07:44:31,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:31,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:44:31,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:31,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918714951] [2022-12-06 07:44:31,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918714951] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:31,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535335378] [2022-12-06 07:44:31,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:31,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:31,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:31,890 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:44:31,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 07:44:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:31,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:44:31,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:44:32,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:44:32,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535335378] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:32,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:44:32,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2022-12-06 07:44:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212852145] [2022-12-06 07:44:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:32,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:44:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:44:32,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:44:32,044 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 65 [2022-12-06 07:44:32,044 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 1039 transitions, 25025 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-12-06 07:44:32,044 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:32,044 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 65 [2022-12-06 07:44:32,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:36,408 INFO L130 PetriNetUnfolder]: 7579/13434 cut-off events. [2022-12-06 07:44:36,408 INFO L131 PetriNetUnfolder]: For 316303/316303 co-relation queries the response was YES. [2022-12-06 07:44:36,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120967 conditions, 13434 events. 7579/13434 cut-off events. For 316303/316303 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 98889 event pairs, 2851 based on Foata normal form. 254/13675 useless extension candidates. Maximal degree in co-relation 120757. Up to 12527 conditions per place. [2022-12-06 07:44:36,572 INFO L137 encePairwiseOnDemand]: 49/65 looper letters, 905 selfloop transitions, 4 changer transitions 132/1041 dead transitions. [2022-12-06 07:44:36,573 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 1041 transitions, 26545 flow [2022-12-06 07:44:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:44:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:44:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 07:44:36,574 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.29846153846153844 [2022-12-06 07:44:36,574 INFO L175 Difference]: Start difference. First operand has 235 places, 1039 transitions, 25025 flow. Second operand 5 states and 97 transitions. [2022-12-06 07:44:36,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 1041 transitions, 26545 flow [2022-12-06 07:44:38,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 1041 transitions, 25979 flow, removed 88 selfloop flow, removed 4 redundant places. [2022-12-06 07:44:38,735 INFO L231 Difference]: Finished difference. Result has 238 places, 909 transitions, 20923 flow [2022-12-06 07:44:38,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=21835, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=20923, PETRI_PLACES=238, PETRI_TRANSITIONS=909} [2022-12-06 07:44:38,736 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 213 predicate places. [2022-12-06 07:44:38,736 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:38,737 INFO L89 Accepts]: Start accepts. Operand has 238 places, 909 transitions, 20923 flow [2022-12-06 07:44:38,741 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:38,741 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:38,741 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 909 transitions, 20923 flow [2022-12-06 07:44:38,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 909 transitions, 20923 flow [2022-12-06 07:44:39,576 INFO L130 PetriNetUnfolder]: 1777/4513 cut-off events. [2022-12-06 07:44:39,576 INFO L131 PetriNetUnfolder]: For 100354/100459 co-relation queries the response was YES. [2022-12-06 07:44:39,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40324 conditions, 4513 events. 1777/4513 cut-off events. For 100354/100459 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 39621 event pairs, 10 based on Foata normal form. 4/4490 useless extension candidates. Maximal degree in co-relation 39438. Up to 1787 conditions per place. [2022-12-06 07:44:39,656 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 233 places, 909 transitions, 20923 flow [2022-12-06 07:44:39,656 INFO L188 LiptonReduction]: Number of co-enabled transitions 3542 [2022-12-06 07:44:50,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:44:50,470 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 07:44:50,473 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11737 [2022-12-06 07:44:50,473 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 908 transitions, 20967 flow [2022-12-06 07:44:50,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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-12-06 07:44:50,473 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:50,474 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:50,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 07:44:50,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 07:44:50,674 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:50,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:50,674 INFO L85 PathProgramCache]: Analyzing trace with hash 304382526, now seen corresponding path program 1 times [2022-12-06 07:44:50,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:50,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215336093] [2022-12-06 07:44:50,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:50,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:44:50,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:50,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215336093] [2022-12-06 07:44:50,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215336093] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:50,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074054176] [2022-12-06 07:44:50,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:50,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:50,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:50,750 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:44:50,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 07:44:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:50,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 07:44:50,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 07:44:50,907 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:44:50,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074054176] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:50,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:44:50,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2022-12-06 07:44:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180566693] [2022-12-06 07:44:50,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:50,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:50,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:50,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:50,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 07:44:50,908 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 66 [2022-12-06 07:44:50,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 908 transitions, 20967 flow. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-12-06 07:44:50,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:50,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 66 [2022-12-06 07:44:50,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:44:54,501 INFO L130 PetriNetUnfolder]: 7056/12343 cut-off events. [2022-12-06 07:44:54,501 INFO L131 PetriNetUnfolder]: For 273651/273651 co-relation queries the response was YES. [2022-12-06 07:44:54,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112270 conditions, 12343 events. 7056/12343 cut-off events. For 273651/273651 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 88367 event pairs, 2648 based on Foata normal form. 88/12417 useless extension candidates. Maximal degree in co-relation 110400. Up to 12015 conditions per place. [2022-12-06 07:44:54,805 INFO L137 encePairwiseOnDemand]: 61/66 looper letters, 873 selfloop transitions, 0 changer transitions 50/923 dead transitions. [2022-12-06 07:44:54,805 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 923 transitions, 22888 flow [2022-12-06 07:44:54,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:44:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:44:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-12-06 07:44:54,806 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2022-12-06 07:44:54,806 INFO L175 Difference]: Start difference. First operand has 232 places, 908 transitions, 20967 flow. Second operand 4 states and 88 transitions. [2022-12-06 07:44:54,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 923 transitions, 22888 flow [2022-12-06 07:44:56,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 923 transitions, 22664 flow, removed 103 selfloop flow, removed 7 redundant places. [2022-12-06 07:44:56,438 INFO L231 Difference]: Finished difference. Result has 230 places, 873 transitions, 19916 flow [2022-12-06 07:44:56,439 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=20152, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=886, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=886, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=19916, PETRI_PLACES=230, PETRI_TRANSITIONS=873} [2022-12-06 07:44:56,439 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 205 predicate places. [2022-12-06 07:44:56,439 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:44:56,439 INFO L89 Accepts]: Start accepts. Operand has 230 places, 873 transitions, 19916 flow [2022-12-06 07:44:56,444 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:44:56,444 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:44:56,444 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 230 places, 873 transitions, 19916 flow [2022-12-06 07:44:56,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 221 places, 873 transitions, 19916 flow [2022-12-06 07:44:57,226 INFO L130 PetriNetUnfolder]: 1699/4328 cut-off events. [2022-12-06 07:44:57,226 INFO L131 PetriNetUnfolder]: For 93737/93836 co-relation queries the response was YES. [2022-12-06 07:44:57,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38144 conditions, 4328 events. 1699/4328 cut-off events. For 93737/93836 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 37813 event pairs, 10 based on Foata normal form. 4/4306 useless extension candidates. Maximal degree in co-relation 38054. Up to 1727 conditions per place. [2022-12-06 07:44:57,298 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 221 places, 873 transitions, 19916 flow [2022-12-06 07:44:57,299 INFO L188 LiptonReduction]: Number of co-enabled transitions 3414 [2022-12-06 07:44:57,304 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:44:57,305 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 866 [2022-12-06 07:44:57,305 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 873 transitions, 19916 flow [2022-12-06 07:44:57,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-12-06 07:44:57,305 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:44:57,305 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:44:57,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 07:44:57,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 07:44:57,511 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:44:57,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:44:57,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1556203263, now seen corresponding path program 1 times [2022-12-06 07:44:57,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:44:57,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281104495] [2022-12-06 07:44:57,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:57,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:44:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:44:57,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:44:57,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281104495] [2022-12-06 07:44:57,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281104495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:44:57,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398214963] [2022-12-06 07:44:57,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:44:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:44:57,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:44:57,665 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:44:57,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 07:44:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:44:57,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 07:44:57,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:44:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:44:57,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 07:44:57,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398214963] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:44:57,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 07:44:57,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2022-12-06 07:44:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391051619] [2022-12-06 07:44:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:44:57,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:44:57,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:44:57,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:44:57,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:44:57,815 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 62 [2022-12-06 07:44:57,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 873 transitions, 19916 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-12-06 07:44:57,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:44:57,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 62 [2022-12-06 07:44:57,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:00,764 INFO L130 PetriNetUnfolder]: 5918/10337 cut-off events. [2022-12-06 07:45:00,764 INFO L131 PetriNetUnfolder]: For 227748/227748 co-relation queries the response was YES. [2022-12-06 07:45:00,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93776 conditions, 10337 events. 5918/10337 cut-off events. For 227748/227748 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 72089 event pairs, 2182 based on Foata normal form. 25/10349 useless extension candidates. Maximal degree in co-relation 93684. Up to 9742 conditions per place. [2022-12-06 07:45:00,859 INFO L137 encePairwiseOnDemand]: 60/62 looper letters, 676 selfloop transitions, 0 changer transitions 104/780 dead transitions. [2022-12-06 07:45:00,859 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 780 transitions, 19017 flow [2022-12-06 07:45:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:45:00,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:45:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2022-12-06 07:45:00,860 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3225806451612903 [2022-12-06 07:45:00,860 INFO L175 Difference]: Start difference. First operand has 221 places, 873 transitions, 19916 flow. Second operand 4 states and 80 transitions. [2022-12-06 07:45:00,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 780 transitions, 19017 flow [2022-12-06 07:45:01,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 780 transitions, 18308 flow, removed 246 selfloop flow, removed 9 redundant places. [2022-12-06 07:45:01,928 INFO L231 Difference]: Finished difference. Result has 214 places, 676 transitions, 14619 flow [2022-12-06 07:45:01,928 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=16520, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=758, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=14619, PETRI_PLACES=214, PETRI_TRANSITIONS=676} [2022-12-06 07:45:01,929 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 189 predicate places. [2022-12-06 07:45:01,929 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:01,929 INFO L89 Accepts]: Start accepts. Operand has 214 places, 676 transitions, 14619 flow [2022-12-06 07:45:01,932 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:01,932 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:01,932 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 214 places, 676 transitions, 14619 flow [2022-12-06 07:45:01,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 676 transitions, 14619 flow [2022-12-06 07:45:02,583 INFO L130 PetriNetUnfolder]: 1376/3488 cut-off events. [2022-12-06 07:45:02,584 INFO L131 PetriNetUnfolder]: For 69781/69877 co-relation queries the response was YES. [2022-12-06 07:45:02,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29388 conditions, 3488 events. 1376/3488 cut-off events. For 69781/69877 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 29351 event pairs, 8 based on Foata normal form. 5/3469 useless extension candidates. Maximal degree in co-relation 28937. Up to 1393 conditions per place. [2022-12-06 07:45:02,640 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 676 transitions, 14619 flow [2022-12-06 07:45:02,640 INFO L188 LiptonReduction]: Number of co-enabled transitions 2730 [2022-12-06 07:45:05,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:05,436 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [695] L101-4-->L54: Formula: (and (= (store |v_#memory_int_261| |v_ULTIMATE.start_main_~#t2~0#1.base_78| (store (select |v_#memory_int_261| |v_ULTIMATE.start_main_~#t2~0#1.base_78|) |v_ULTIMATE.start_main_~#t2~0#1.offset_76| |v_ULTIMATE.start_main_#t~pre17#1_68|)) |v_#memory_int_260|) (= |v_#pthreadsForks_99| (+ |v_#pthreadsForks_100| 1)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| 0)) (= |v_ULTIMATE.start_main_#t~pre17#1_68| |v_#pthreadsForks_100|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|) (not (= (ite (and (<= 0 v_~end~0_201) (< v_~end~0_201 v_~n~0_113)) 1 0) 0)) (= v_~end~0_200 (+ v_~end~0_201 1)) (= (ite (= (select (select |v_#memory_int_260| v_~queue~0.base_106) (+ v_~queue~0.offset_107 (* v_~end~0_201 4))) (select (select |v_#memory_int_260| v_~A~0.base_130) (+ v_~A~0.offset_130 (* v_~i~0_188 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|)) InVars {~A~0.base=v_~A~0.base_130, ~queue~0.offset=v_~queue~0.offset_107, ~A~0.offset=v_~A~0.offset_130, #pthreadsForks=|v_#pthreadsForks_100|, ~i~0=v_~i~0_188, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_76|, #memory_int=|v_#memory_int_261|, ~end~0=v_~end~0_201, ~queue~0.base=v_~queue~0.base_106, ~n~0=v_~n~0_113, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_78|} OutVars{~A~0.base=v_~A~0.base_130, ~queue~0.offset=v_~queue~0.offset_107, ~i~0=v_~i~0_188, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_76|, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_43|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_43|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_68|, ~queue~0.base=v_~queue~0.base_106, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_68|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_43|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_49|, ~A~0.offset=v_~A~0.offset_130, #pthreadsForks=|v_#pthreadsForks_99|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_43|, #memory_int=|v_#memory_int_260|, ~end~0=v_~end~0_200, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_43|, ~n~0=v_~n~0_113, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, #memory_int, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, ULTIMATE.start_main_#t~pre15#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:45:08,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:08,306 INFO L203 LiptonReduction]: Total number of compositions: 8 [2022-12-06 07:45:08,309 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6380 [2022-12-06 07:45:08,309 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 672 transitions, 14659 flow [2022-12-06 07:45:08,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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-12-06 07:45:08,309 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:08,309 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:08,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:08,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 07:45:08,514 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:45:08,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:08,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1919445975, now seen corresponding path program 1 times [2022-12-06 07:45:08,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:08,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129635310] [2022-12-06 07:45:08,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:08,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:10,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:10,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:10,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129635310] [2022-12-06 07:45:10,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129635310] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:10,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376430852] [2022-12-06 07:45:10,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:10,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:10,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:10,299 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:45:10,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 07:45:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:10,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 72 conjunts are in the unsatisfiable core [2022-12-06 07:45:10,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:10,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:45:10,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:45:10,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:10,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:10,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-06 07:45:10,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:10,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:45:10,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:10,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:45:11,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:11,170 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 26 [2022-12-06 07:45:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:11,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:12,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376430852] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:12,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:12,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 31 [2022-12-06 07:45:12,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693304325] [2022-12-06 07:45:12,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:12,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 07:45:12,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 07:45:12,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=849, Unknown=2, NotChecked=0, Total=1056 [2022-12-06 07:45:12,290 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 56 [2022-12-06 07:45:12,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 672 transitions, 14659 flow. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 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-12-06 07:45:12,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:12,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 56 [2022-12-06 07:45:12,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:13,942 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (* c_~start~0 4)) (.cse30 (* c_~end~0 4))) (let ((.cse3 (+ .cse30 c_~queue~0.offset)) (.cse22 (< c_~end~0 0)) (.cse23 (<= c_~n~0 (+ c_~end~0 1))) (.cse6 (+ .cse30 c_~queue~0.offset 4)) (.cse15 (not (= (mod c_~ok~0 256) 0))) (.cse1 (+ .cse29 c_~queue~0.offset 4)) (.cse2 (+ .cse29 c_~queue~0.offset)) (.cse21 (* c_~i~0 4))) (and (= c_~ok~0 1) (or (let ((.cse9 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse8 .cse9)) (.cse5 (select .cse8 (+ (* v_~i~0_424 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse0 (select .cse7 c_~queue~0.base))) (or (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1)) (not (= (select .cse0 .cse3) .cse4)) (< .cse4 .cse5) (not (= .cse5 (select .cse0 .cse6)))))))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse14 .cse9)) (.cse12 (select .cse14 (+ (* v_~i~0_424 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse10 (select .cse13 c_~queue~0.base))) (or (not (= (select .cse10 .cse3) .cse11)) (< .cse11 .cse12) (not (= .cse12 (select .cse10 .cse6)))))))) .cse15) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse20 .cse9)) (.cse18 (select .cse20 (+ (* v_~i~0_424 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse16 (select .cse19 c_~queue~0.base))) (or (< (select .cse16 .cse2) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse16 .cse3) .cse17)) (< .cse17 .cse18) (not (= .cse18 (select .cse16 .cse6)))))))))) .cse22 .cse23) (let ((.cse27 (select |c_#memory_int| c_~A~0.base))) (let ((.cse25 (select .cse27 (+ c_~A~0.offset .cse21))) (.cse24 (select |c_#memory_int| c_~queue~0.base))) (or (not (= (select .cse24 .cse3) .cse25)) .cse22 .cse23 (forall ((v_~i~0_424 Int)) (let ((.cse26 (select .cse27 (+ c_~A~0.offset (* v_~i~0_424 4))))) (or (not (= .cse26 (select .cse24 .cse6))) (< .cse25 .cse26)))) (let ((.cse28 (select .cse24 .cse2))) (and .cse15 (<= .cse28 c_~v_old~0) (< (select .cse24 .cse1) (+ .cse28 1)))))))))) is different from false [2022-12-06 07:45:17,655 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse29 (* c_~i~0 4))) (let ((.cse50 (* c_~start~0 4)) (.cse48 (select |c_#memory_int| c_~queue~0.base)) (.cse37 (+ c_~A~0.offset .cse29)) (.cse49 (* c_~end~0 4))) (let ((.cse11 (+ .cse49 c_~queue~0.offset)) (.cse3 (select (select |c_#memory_int| c_~A~0.base) .cse37)) (.cse51 (+ c_~end~0 1)) (.cse2 (select .cse48 (+ c_~queue~0.offset 4))) (.cse10 (+ .cse50 c_~queue~0.offset))) (let ((.cse6 (= .cse10 0)) (.cse0 (<= .cse2 c_~v_old~0)) (.cse4 (<= (+ c_~start~0 c_~n~0) .cse51)) (.cse1 (<= 0 c_~start~0)) (.cse5 (let ((.cse52 (= .cse49 4))) (and (or (not (= (select .cse48 .cse11) .cse3)) (not .cse52)) (or (and (< 0 c_~end~0) (<= c_~n~0 2)) .cse52)))) (.cse30 (< c_~end~0 0)) (.cse31 (<= c_~n~0 .cse51)) (.cse9 (+ .cse50 c_~queue~0.offset 4)) (.cse23 (not (= (mod c_~ok~0 256) 0))) (.cse14 (+ .cse49 c_~queue~0.offset 4)) (.cse7 (= (select .cse48 .cse10) c_~v_old~0))) (and (<= c_~start~0 0) (not (<= c_~N~0 0)) .cse0 .cse1 (or (and (<= (+ .cse2 c_~last~0) (+ .cse3 c_~v_old~0)) .cse4 .cse1) .cse5) (= c_~ok~0 1) (or (<= c_~n~0 c_~end~0) (and .cse6 .cse7)) (= c_~A~0.offset 0) (or (let ((.cse17 (+ .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse12 (select .cse16 .cse17)) (.cse13 (select .cse16 (+ (* v_~i~0_424 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse8 (select .cse15 c_~queue~0.base))) (or (< (select .cse8 .cse9) (+ (select .cse8 .cse10) 1)) (not (= (select .cse8 .cse11) .cse12)) (< .cse12 .cse13) (not (= .cse13 (select .cse8 .cse14)))))))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse22 .cse17)) (.cse20 (select .cse22 (+ (* v_~i~0_424 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse18 (select .cse21 c_~queue~0.base))) (or (not (= (select .cse18 .cse11) .cse19)) (< .cse19 .cse20) (not (= .cse20 (select .cse18 .cse14)))))))) .cse23) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse28 .cse17)) (.cse26 (select .cse28 (+ (* v_~i~0_424 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse24 (select .cse27 c_~queue~0.base))) (or (< (select .cse24 .cse10) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse24 .cse11) .cse25)) (< .cse25 .cse26) (not (= .cse26 (select .cse24 .cse14)))))))))) .cse30 .cse31) .cse6 (or (and .cse0 .cse4 .cse1) .cse5) (or .cse30 .cse31 (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse35 (select .cse36 c_~A~0.base))) (let ((.cse33 (select .cse35 .cse37)) (.cse32 (select .cse36 c_~queue~0.base)) (.cse34 (select .cse35 (+ c_~A~0.offset (* v_~i~0_424 4))))) (or (not (= (select .cse32 .cse11) .cse33)) (< (select .cse32 .cse9) (+ (select .cse32 .cse10) 1)) (< .cse33 .cse34) (not (= (select .cse32 .cse14) .cse34))))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse41 (select .cse42 c_~A~0.base))) (let ((.cse39 (select .cse41 .cse37)) (.cse38 (select .cse42 c_~queue~0.base)) (.cse40 (select .cse41 (+ c_~A~0.offset (* v_~i~0_424 4))))) (or (not (= (select .cse38 .cse11) .cse39)) (<= (select .cse38 .cse10) c_~v_old~0) (< .cse39 .cse40) (not (= (select .cse38 .cse14) .cse40))))))) (or .cse23 (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse46 (select .cse47 c_~A~0.base))) (let ((.cse44 (select .cse46 .cse37)) (.cse43 (select .cse47 c_~queue~0.base)) (.cse45 (select .cse46 (+ c_~A~0.offset (* v_~i~0_424 4))))) (or (not (= (select .cse43 .cse11) .cse44)) (< .cse44 .cse45) (not (= (select .cse43 .cse14) .cse45)))))))))) .cse7))))) is different from false [2022-12-06 07:45:19,813 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (* c_~i~0 4)) (.cse45 (* c_~end~0 4)) (.cse46 (* c_~start~0 4))) (let ((.cse22 (< c_~end~0 0)) (.cse23 (<= c_~n~0 (+ c_~end~0 1))) (.cse1 (+ .cse46 c_~queue~0.offset 4)) (.cse2 (+ .cse46 c_~queue~0.offset)) (.cse15 (not (= (mod c_~ok~0 256) 0))) (.cse3 (+ .cse45 c_~queue~0.offset)) (.cse6 (+ .cse45 c_~queue~0.offset 4)) (.cse29 (+ c_~A~0.offset .cse21))) (and (= c_~ok~0 1) (or (let ((.cse9 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse8 .cse9)) (.cse5 (select .cse8 (+ (* v_~i~0_424 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse0 (select .cse7 c_~queue~0.base))) (or (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1)) (not (= (select .cse0 .cse3) .cse4)) (< .cse4 .cse5) (not (= .cse5 (select .cse0 .cse6)))))))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse14 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse14 .cse9)) (.cse12 (select .cse14 (+ (* v_~i~0_424 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse10 (select .cse13 c_~queue~0.base))) (or (not (= (select .cse10 .cse3) .cse11)) (< .cse11 .cse12) (not (= .cse12 (select .cse10 .cse6)))))))) .cse15) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse20 .cse9)) (.cse18 (select .cse20 (+ (* v_~i~0_424 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse16 (select .cse19 c_~queue~0.base))) (or (< (select .cse16 .cse2) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (not (= (select .cse16 .cse3) .cse17)) (< .cse17 .cse18) (not (= .cse18 (select .cse16 .cse6)))))))))) .cse22 .cse23) (let ((.cse27 (select |c_#memory_int| c_~A~0.base))) (let ((.cse25 (select .cse27 .cse29)) (.cse24 (select |c_#memory_int| c_~queue~0.base))) (or (not (= (select .cse24 .cse3) .cse25)) .cse22 .cse23 (forall ((v_~i~0_424 Int)) (let ((.cse26 (select .cse27 (+ c_~A~0.offset (* v_~i~0_424 4))))) (or (not (= .cse26 (select .cse24 .cse6))) (< .cse25 .cse26)))) (let ((.cse28 (select .cse24 .cse2))) (and .cse15 (<= .cse28 c_~v_old~0) (< (select .cse24 .cse1) (+ .cse28 1))))))) (or .cse22 .cse23 (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse33 (select .cse34 c_~A~0.base))) (let ((.cse31 (select .cse33 .cse29)) (.cse30 (select .cse34 c_~queue~0.base)) (.cse32 (select .cse33 (+ c_~A~0.offset (* v_~i~0_424 4))))) (or (not (= (select .cse30 .cse3) .cse31)) (< (select .cse30 .cse1) (+ (select .cse30 .cse2) 1)) (< .cse31 .cse32) (not (= (select .cse30 .cse6) .cse32))))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (let ((.cse39 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse38 (select .cse39 c_~A~0.base))) (let ((.cse36 (select .cse38 .cse29)) (.cse35 (select .cse39 c_~queue~0.base)) (.cse37 (select .cse38 (+ c_~A~0.offset (* v_~i~0_424 4))))) (or (not (= (select .cse35 .cse3) .cse36)) (<= (select .cse35 .cse2) c_~v_old~0) (< .cse36 .cse37) (not (= (select .cse35 .cse6) .cse37))))))) (or .cse15 (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897))) (let ((.cse43 (select .cse44 c_~A~0.base))) (let ((.cse41 (select .cse43 .cse29)) (.cse40 (select .cse44 c_~queue~0.base)) (.cse42 (select .cse43 (+ c_~A~0.offset (* v_~i~0_424 4))))) (or (not (= (select .cse40 .cse3) .cse41)) (< .cse41 .cse42) (not (= (select .cse40 .cse6) .cse42))))))))))))) is different from false [2022-12-06 07:45:32,849 INFO L130 PetriNetUnfolder]: 14243/24309 cut-off events. [2022-12-06 07:45:32,850 INFO L131 PetriNetUnfolder]: For 533163/533163 co-relation queries the response was YES. [2022-12-06 07:45:33,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217518 conditions, 24309 events. 14243/24309 cut-off events. For 533163/533163 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 191047 event pairs, 1492 based on Foata normal form. 31/24311 useless extension candidates. Maximal degree in co-relation 213679. Up to 8974 conditions per place. [2022-12-06 07:45:33,123 INFO L137 encePairwiseOnDemand]: 6/56 looper letters, 920 selfloop transitions, 1394 changer transitions 125/2439 dead transitions. [2022-12-06 07:45:33,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 2439 transitions, 55775 flow [2022-12-06 07:45:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-12-06 07:45:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-12-06 07:45:33,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 566 transitions. [2022-12-06 07:45:33,126 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.1554945054945055 [2022-12-06 07:45:33,126 INFO L175 Difference]: Start difference. First operand has 189 places, 672 transitions, 14659 flow. Second operand 65 states and 566 transitions. [2022-12-06 07:45:33,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 2439 transitions, 55775 flow [2022-12-06 07:45:36,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 2439 transitions, 52083 flow, removed 977 selfloop flow, removed 18 redundant places. [2022-12-06 07:45:36,758 INFO L231 Difference]: Finished difference. Result has 280 places, 1971 transitions, 48016 flow [2022-12-06 07:45:36,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=56, PETRI_DIFFERENCE_MINUEND_FLOW=13863, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=48016, PETRI_PLACES=280, PETRI_TRANSITIONS=1971} [2022-12-06 07:45:36,759 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 255 predicate places. [2022-12-06 07:45:36,759 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:45:36,759 INFO L89 Accepts]: Start accepts. Operand has 280 places, 1971 transitions, 48016 flow [2022-12-06 07:45:36,767 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:45:36,767 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:45:36,767 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 280 places, 1971 transitions, 48016 flow [2022-12-06 07:45:36,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 1971 transitions, 48016 flow [2022-12-06 07:45:40,435 INFO L130 PetriNetUnfolder]: 6446/14143 cut-off events. [2022-12-06 07:45:40,435 INFO L131 PetriNetUnfolder]: For 395594/395858 co-relation queries the response was YES. [2022-12-06 07:45:40,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132813 conditions, 14143 events. 6446/14143 cut-off events. For 395594/395858 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 140194 event pairs, 756 based on Foata normal form. 51/13503 useless extension candidates. Maximal degree in co-relation 132594. Up to 4906 conditions per place. [2022-12-06 07:45:40,751 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 276 places, 1971 transitions, 48016 flow [2022-12-06 07:45:40,751 INFO L188 LiptonReduction]: Number of co-enabled transitions 6718 [2022-12-06 07:45:40,774 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:40,863 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:40,951 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:41,038 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [726] $Ultimate##0-->L79: Formula: (and (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| 0)) (= (ite (and (< v_~start~0_219 v_~end~0_258) (< v_~start~0_219 v_~n~0_153) (<= 0 v_~start~0_219)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|) (= v_~new~0_96 (select (select |v_#memory_int_364| v_~queue~0.base_156) (+ (* v_~start~0_219 4) v_~queue~0.offset_157))) (= (+ v_~start~0_219 1) v_~start~0_218) (= v_~new~0_96 v_~v_old~0_147) (= (ite (= (ite (or (< v_~i~0_275 v_~N~0_205) (< v_~start~0_218 v_~end~0_258)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_139|) (= (ite (= (ite (and (<= v_~new~0_96 v_~v_old~0_148) (not (= (mod v_~ok~0_157 256) 0))) 1 0) 0) 0 1) v_~ok~0_156) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|)) InVars {~start~0=v_~start~0_219, ~queue~0.offset=v_~queue~0.offset_157, ~ok~0=v_~ok~0_157, ~i~0=v_~i~0_275, #memory_int=|v_#memory_int_364|, ~end~0=v_~end~0_258, ~N~0=v_~N~0_205, ~v_old~0=v_~v_old~0_148, ~queue~0.base=v_~queue~0.base_156, ~n~0=v_~n~0_153} OutVars{~start~0=v_~start~0_218, ~new~0=v_~new~0_96, ~queue~0.offset=v_~queue~0.offset_157, ~ok~0=v_~ok~0_156, ~i~0=v_~i~0_275, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_53|, ~N~0=v_~N~0_205, ~queue~0.base=v_~queue~0.base_156, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_53|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_53|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_139|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_53|, #memory_int=|v_#memory_int_364|, ~end~0=v_~end~0_258, ~v_old~0=v_~v_old~0_147, ~n~0=v_~n~0_153} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:41,122 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:41,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:41,305 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:41,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:41,516 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:41,611 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [759] $Ultimate##0-->L59: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_213| (ite (= (ite (or (< v_~start~0_290 v_~end~0_306) (< v_~i~0_359 v_~N~0_247)) 1 0) 0) 0 1)) (= (+ v_~i~0_359 1) v_~i~0_358)) InVars {~start~0=v_~start~0_290, ~i~0=v_~i~0_359, ~end~0=v_~end~0_306, ~N~0=v_~N~0_247} OutVars{~start~0=v_~start~0_290, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_159|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_213|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_84|, ~i~0=v_~i~0_358, ~end~0=v_~end~0_306, ~N~0=v_~N~0_247} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:45:41,637 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:41,730 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:45:41,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:41,843 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:41,937 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:42,029 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:42,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:42,247 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [760] $Ultimate##0-->L79: Formula: (and (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_93| |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= v_~new~0_136 v_~v_old~0_219) (= v_~start~0_292 (+ v_~start~0_293 1)) (= (ite (= (ite (and (not (= (mod v_~ok~0_229 256) 0)) (<= v_~new~0_136 v_~v_old~0_220)) 1 0) 0) 0 1) v_~ok~0_228) (= |v_thread2Thread1of1ForFork1_~cond~0#1_215| (ite (= (ite (or (< v_~i~0_362 v_~N~0_249) (< v_~start~0_292 v_~end~0_308)) 1 0) 0) 0 1)) (= (ite (and (< v_~start~0_293 v_~end~0_308) (<= 0 v_~start~0_293) (< v_~start~0_293 v_~n~0_191)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|) (= v_~new~0_136 (select (select |v_#memory_int_440| v_~queue~0.base_196) (+ (* v_~start~0_293 4) v_~queue~0.offset_197))) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_93| 0))) InVars {~start~0=v_~start~0_293, ~queue~0.offset=v_~queue~0.offset_197, ~ok~0=v_~ok~0_229, ~i~0=v_~i~0_362, #memory_int=|v_#memory_int_440|, ~end~0=v_~end~0_308, ~N~0=v_~N~0_249, ~v_old~0=v_~v_old~0_220, ~queue~0.base=v_~queue~0.base_196, ~n~0=v_~n~0_191} OutVars{~start~0=v_~start~0_292, ~new~0=v_~new~0_136, ~queue~0.offset=v_~queue~0.offset_197, ~ok~0=v_~ok~0_228, ~i~0=v_~i~0_362, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_93|, ~N~0=v_~N~0_249, ~queue~0.base=v_~queue~0.base_196, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_93|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_93|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_215|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_93|, #memory_int=|v_#memory_int_440|, ~end~0=v_~end~0_308, ~v_old~0=v_~v_old~0_219, ~n~0=v_~n~0_191} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:42,370 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:45:42,520 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:42,613 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:42,710 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:42,803 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:45:42,841 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:45:42,878 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:42,979 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:43,070 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:43,159 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:43,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:43,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:45:43,406 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:43,598 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:43,765 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [578] L59-->L50: Formula: (and (<= (select (select |v_#memory_int_77| v_~A~0.base_37) (+ (* v_~i~0_49 4) v_~A~0.offset_37)) v_~last~0_22) (< v_~i~0_49 v_~N~0_31)) InVars {~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, ~last~0=v_~last~0_22} OutVars{~A~0.base=v_~A~0.base_37, ~A~0.offset=v_~A~0.offset_37, ~i~0=v_~i~0_49, #memory_int=|v_#memory_int_77|, ~N~0=v_~N~0_31, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_27|, ~last~0=v_~last~0_22} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:45:43,886 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 07:45:43,887 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7128 [2022-12-06 07:45:43,887 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 1968 transitions, 48444 flow [2022-12-06 07:45:43,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 32 states have internal predecessors, (60), 0 states have call successors, (0), 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-12-06 07:45:43,887 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:45:43,887 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:45:43,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-06 07:45:44,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:44,088 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:45:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:45:44,089 INFO L85 PathProgramCache]: Analyzing trace with hash 2117145537, now seen corresponding path program 1 times [2022-12-06 07:45:44,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:45:44,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217262377] [2022-12-06 07:45:44,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:44,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:45:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:45,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:45,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:45:45,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217262377] [2022-12-06 07:45:45,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217262377] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:45:45,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650669370] [2022-12-06 07:45:45,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:45:45,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:45:45,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:45:45,541 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:45:45,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-06 07:45:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:45:45,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-06 07:45:45,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:45:45,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-12-06 07:45:45,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2022-12-06 07:45:45,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:45:45,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:45:46,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:45:46,088 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-06 07:45:46,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 75 [2022-12-06 07:45:46,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:46,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 42 [2022-12-06 07:45:46,331 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:45:46,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 10 [2022-12-06 07:45:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:45:46,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:45:46,616 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse1 (* c_~start~0 4))) (let ((.cse2 (+ .cse1 c_~queue~0.offset))) (and (forall ((v_ArrVal_961 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base))) (< (select .cse0 (+ .cse1 c_~queue~0.offset 4)) (+ (select .cse0 .cse2) 1)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base) .cse2) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0))))) (and (not (< c_~start~0 c_~end~0)) (not (< c_~i~0 c_~N~0)))) is different from false [2022-12-06 07:45:46,727 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~end~0) (< c_~end~0 0) (forall ((~i~0 Int)) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse0) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ (* c_~end~0 4) c_~queue~0.offset)) .cse0)) (<= c_~N~0 ~i~0)))) (let ((.cse2 (* c_~start~0 4))) (let ((.cse3 (+ .cse2 c_~queue~0.offset))) (and (forall ((v_ArrVal_961 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base))) (< (select .cse1 (+ .cse2 c_~queue~0.offset 4)) (+ (select .cse1 .cse3) 1)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base) .cse3) c_~v_old~0)) (not (= (mod c_~ok~0 256) 0)))))) is different from false [2022-12-06 07:45:49,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-06 07:45:49,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650669370] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:45:49,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:45:49,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2022-12-06 07:45:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537551510] [2022-12-06 07:45:49,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:45:49,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 07:45:49,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:45:49,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 07:45:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=716, Unknown=2, NotChecked=114, Total=992 [2022-12-06 07:45:49,439 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 101 [2022-12-06 07:45:49,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 1968 transitions, 48444 flow. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 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-12-06 07:45:49,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:45:49,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 101 [2022-12-06 07:45:49,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:45:49,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_~end~0 4)) (.cse29 (* c_~start~0 4))) (let ((.cse6 (< c_~end~0 0)) (.cse7 (<= c_~n~0 (+ c_~end~0 1))) (.cse9 (+ .cse29 c_~queue~0.offset 4)) (.cse11 (not (= (mod c_~ok~0 256) 0))) (.cse10 (+ .cse29 c_~queue~0.offset)) (.cse1 (+ .cse28 c_~queue~0.offset)) (.cse4 (+ .cse28 c_~queue~0.offset 4))) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (let ((.cse5 (select |c_#memory_int| ~A~0.base))) (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (select .cse5 (+ (* v_~i~0_550 4) ~A~0.offset))) (.cse2 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select .cse0 .cse1) .cse2)) (not (= .cse3 (select .cse0 .cse4))) (< .cse2 .cse3) (< c_~last~0 .cse2) (<= c_~N~0 v_~i~0_550))))) .cse6 .cse7 (and (forall ((v_ArrVal_961 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base))) (< (select .cse8 .cse9) (+ (select .cse8 .cse10) 1)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base) .cse10) c_~v_old~0)) .cse11)) (= c_~ok~0 1) (or .cse6 .cse7 (<= c_~N~0 0) (and (forall ((v_~i~0_550 Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse17 (select .cse15 ~A~0.base))) (let ((.cse12 (select .cse15 c_~queue~0.base)) (.cse13 (select .cse17 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (not (= (select .cse12 .cse4) .cse13)) (forall ((v_ArrVal_961 (Array Int Int))) (let ((.cse14 (select (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base))) (< (select .cse14 .cse9) (+ (select .cse14 .cse10) 1)))) (forall ((~i~0 Int)) (let ((.cse16 (select .cse17 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse16 (select .cse12 .cse1))) (< .cse16 .cse13))))))))) (<= c_~N~0 v_~i~0_550))) (or .cse11 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse21 (select .cse22 ~A~0.base))) (let ((.cse18 (select .cse22 c_~queue~0.base)) (.cse20 (select .cse21 (+ (* ~i~0 4) ~A~0.offset))) (.cse19 (select .cse21 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (not (= (select .cse18 .cse4) .cse19)) (<= c_~N~0 v_~i~0_550) (not (= .cse20 (select .cse18 .cse1))) (< .cse20 .cse19))))))) (forall ((v_~i~0_550 Int)) (or (<= c_~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse27 (select .cse23 ~A~0.base))) (let ((.cse25 (select .cse23 c_~queue~0.base)) (.cse26 (select .cse27 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (forall ((~i~0 Int)) (let ((.cse24 (select .cse27 (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base) .cse10) (+ .cse24 1))) (not (= .cse24 (select .cse25 .cse1))) (< .cse24 .cse26)))) (not (= (select .cse25 .cse4) .cse26)))))))))))))) is different from false [2022-12-06 07:45:51,421 WARN L837 $PredicateComparison]: unable to prove that (and (= c_~ok~0 1) (or (< c_~end~0 0) (<= c_~n~0 (+ c_~end~0 1)) (<= c_~N~0 0) (let ((.cse20 (* c_~end~0 4)) (.cse4 (* c_~start~0 4))) (let ((.cse5 (+ .cse4 c_~queue~0.offset)) (.cse8 (+ .cse20 c_~queue~0.offset)) (.cse1 (+ .cse20 c_~queue~0.offset 4))) (and (forall ((v_~i~0_550 Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse9 (select .cse6 ~A~0.base))) (let ((.cse0 (select .cse6 c_~queue~0.base)) (.cse2 (select .cse9 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (not (= (select .cse0 .cse1) .cse2)) (forall ((v_ArrVal_961 (Array Int Int))) (let ((.cse3 (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base))) (< (select .cse3 (+ .cse4 c_~queue~0.offset 4)) (+ (select .cse3 .cse5) 1)))) (forall ((~i~0 Int)) (let ((.cse7 (select .cse9 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse7 (select .cse0 .cse8))) (< .cse7 .cse2))))))))) (<= c_~N~0 v_~i~0_550))) (or (not (= (mod c_~ok~0 256) 0)) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse13 (select .cse14 ~A~0.base))) (let ((.cse10 (select .cse14 c_~queue~0.base)) (.cse12 (select .cse13 (+ (* ~i~0 4) ~A~0.offset))) (.cse11 (select .cse13 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (not (= (select .cse10 .cse1) .cse11)) (<= c_~N~0 v_~i~0_550) (not (= .cse12 (select .cse10 .cse8))) (< .cse12 .cse11))))))) (forall ((v_~i~0_550 Int)) (or (<= c_~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse19 (select .cse15 ~A~0.base))) (let ((.cse17 (select .cse15 c_~queue~0.base)) (.cse18 (select .cse19 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (forall ((~i~0 Int)) (let ((.cse16 (select .cse19 (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base) .cse5) (+ .cse16 1))) (not (= .cse16 (select .cse17 .cse8))) (< .cse16 .cse18)))) (not (= (select .cse17 .cse1) .cse18)))))))))))))) is different from false [2022-12-06 07:45:52,645 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse28 (* c_~end~0 4)) (.cse29 (* c_~start~0 4))) (let ((.cse6 (< c_~end~0 0)) (.cse7 (<= c_~n~0 (+ c_~end~0 1))) (.cse9 (+ .cse29 c_~queue~0.offset 4)) (.cse11 (not (= (mod c_~ok~0 256) 0))) (.cse10 (+ .cse29 c_~queue~0.offset)) (.cse1 (+ .cse28 c_~queue~0.offset)) (.cse4 (+ .cse28 c_~queue~0.offset 4))) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (let ((.cse5 (select |c_#memory_int| ~A~0.base))) (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (select .cse5 (+ (* v_~i~0_550 4) ~A~0.offset))) (.cse2 (select .cse5 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= (select .cse0 .cse1) .cse2)) (not (= .cse3 (select .cse0 .cse4))) (< .cse2 .cse3) (< c_~last~0 .cse2) (<= c_~N~0 v_~i~0_550))))) .cse6 .cse7 (and (forall ((v_ArrVal_961 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base))) (< (select .cse8 .cse9) (+ (select .cse8 .cse10) 1)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base) .cse10) c_~v_old~0)) .cse11)) (or .cse6 .cse7 (<= c_~N~0 0) (and (forall ((v_~i~0_550 Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse17 (select .cse15 ~A~0.base))) (let ((.cse12 (select .cse15 c_~queue~0.base)) (.cse13 (select .cse17 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (not (= (select .cse12 .cse4) .cse13)) (forall ((v_ArrVal_961 (Array Int Int))) (let ((.cse14 (select (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base))) (< (select .cse14 .cse9) (+ (select .cse14 .cse10) 1)))) (forall ((~i~0 Int)) (let ((.cse16 (select .cse17 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse16 (select .cse12 .cse1))) (< .cse16 .cse13))))))))) (<= c_~N~0 v_~i~0_550))) (or .cse11 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse21 (select .cse22 ~A~0.base))) (let ((.cse18 (select .cse22 c_~queue~0.base)) (.cse20 (select .cse21 (+ (* ~i~0 4) ~A~0.offset))) (.cse19 (select .cse21 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (not (= (select .cse18 .cse4) .cse19)) (<= c_~N~0 v_~i~0_550) (not (= .cse20 (select .cse18 .cse1))) (< .cse20 .cse19))))))) (forall ((v_~i~0_550 Int)) (or (<= c_~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse27 (select .cse23 ~A~0.base))) (let ((.cse25 (select .cse23 c_~queue~0.base)) (.cse26 (select .cse27 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (forall ((~i~0 Int)) (let ((.cse24 (select .cse27 (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store .cse23 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base) .cse10) (+ .cse24 1))) (not (= .cse24 (select .cse25 .cse1))) (< .cse24 .cse26)))) (not (= (select .cse25 .cse4) .cse26)))))))))))))) is different from false [2022-12-06 07:46:11,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:46:13,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:46:15,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 07:46:36,811 WARN L233 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 112 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:47:00,708 WARN L233 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 139 DAG size of output: 115 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:47:31,532 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 89 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:47:47,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:48:00,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:48:29,990 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse30 (* c_~end~0 4)) (.cse32 (* c_~start~0 4))) (let ((.cse13 (+ .cse32 c_~queue~0.offset 4)) (.cse14 (+ .cse32 c_~queue~0.offset)) (.cse19 (not (= (mod c_~ok~0 256) 0))) (.cse5 (select |c_#memory_int| c_~A~0.base)) (.cse17 (+ .cse30 c_~queue~0.offset))) (let ((.cse0 (<= c_~n~0 c_~end~0)) (.cse2 (select (select |c_#memory_int| c_~queue~0.base) .cse17)) (.cse4 (select .cse5 (+ c_~A~0.offset (* c_~i~0 4)))) (.cse6 (and (forall ((v_ArrVal_961 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base))) (< (select .cse31 .cse13) (+ (select .cse31 .cse14) 1)))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base) .cse14) c_~v_old~0)) .cse19)) (.cse1 (< c_~end~0 0)) (.cse8 (+ c_~end~0 1))) (and (or .cse0 .cse1 (forall ((v_~i~0_550 Int)) (let ((.cse3 (select .cse5 (+ c_~A~0.offset (* v_~i~0_550 4))))) (or (not (= .cse2 .cse3)) (< .cse4 .cse3) (<= c_~N~0 v_~i~0_550)))) .cse6) (or .cse0 .cse1 (forall ((~i~0 Int)) (let ((.cse7 (select .cse5 (+ c_~A~0.offset (* ~i~0 4))))) (or (< c_~last~0 .cse7) (not (= .cse2 .cse7)) (<= c_~N~0 ~i~0)))) .cse6) (= c_~ok~0 1) (or (not (< c_~end~0 c_~n~0)) (not (= .cse2 .cse4)) (and (not (< c_~i~0 c_~N~0)) (not (< c_~start~0 .cse8))) (not (<= 0 c_~end~0)) .cse6) (or .cse1 (<= c_~n~0 .cse8) (<= c_~N~0 0) (let ((.cse10 (+ .cse30 c_~queue~0.offset 4))) (and (forall ((v_~i~0_550 Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse18 (select .cse15 ~A~0.base))) (let ((.cse9 (select .cse15 c_~queue~0.base)) (.cse11 (select .cse18 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (not (= (select .cse9 .cse10) .cse11)) (forall ((v_ArrVal_961 (Array Int Int))) (let ((.cse12 (select (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base))) (< (select .cse12 .cse13) (+ (select .cse12 .cse14) 1)))) (forall ((~i~0 Int)) (let ((.cse16 (select .cse18 (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse16 (select .cse9 .cse17))) (< .cse16 .cse11))))))))) (<= c_~N~0 v_~i~0_550))) (or .cse19 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse23 (select .cse24 ~A~0.base))) (let ((.cse20 (select .cse24 c_~queue~0.base)) (.cse22 (select .cse23 (+ (* ~i~0 4) ~A~0.offset))) (.cse21 (select .cse23 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (not (= (select .cse20 .cse10) .cse21)) (<= c_~N~0 v_~i~0_550) (not (= .cse22 (select .cse20 .cse17))) (< .cse22 .cse21))))))) (forall ((v_~i~0_550 Int)) (or (<= c_~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960))) (let ((.cse29 (select .cse25 ~A~0.base))) (let ((.cse27 (select .cse25 c_~queue~0.base)) (.cse28 (select .cse29 (+ (* v_~i~0_550 4) ~A~0.offset)))) (or (forall ((~i~0 Int)) (let ((.cse26 (select .cse29 (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store .cse25 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) c_~queue~0.base) .cse14) (+ .cse26 1))) (not (= .cse26 (select .cse27 .cse17))) (< .cse26 .cse28)))) (not (= (select .cse27 .cse10) .cse28)))))))))))))))) is different from false [2022-12-06 07:49:16,091 INFO L130 PetriNetUnfolder]: 22339/38088 cut-off events. [2022-12-06 07:49:16,091 INFO L131 PetriNetUnfolder]: For 1076419/1076419 co-relation queries the response was YES. [2022-12-06 07:49:16,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372937 conditions, 38088 events. 22339/38088 cut-off events. For 1076419/1076419 co-relation queries the response was YES. Maximal size of possible extension queue 1479. Compared 312363 event pairs, 3469 based on Foata normal form. 117/38120 useless extension candidates. Maximal degree in co-relation 372625. Up to 18651 conditions per place. [2022-12-06 07:49:16,868 INFO L137 encePairwiseOnDemand]: 34/101 looper letters, 2242 selfloop transitions, 1819 changer transitions 304/4365 dead transitions. [2022-12-06 07:49:16,868 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 4365 transitions, 101857 flow [2022-12-06 07:49:16,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-12-06 07:49:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2022-12-06 07:49:16,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 896 transitions. [2022-12-06 07:49:16,872 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.08290922550198945 [2022-12-06 07:49:16,872 INFO L175 Difference]: Start difference. First operand has 273 places, 1968 transitions, 48444 flow. Second operand 107 states and 896 transitions. [2022-12-06 07:49:16,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 4365 transitions, 101857 flow [2022-12-06 07:49:29,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 4365 transitions, 96417 flow, removed 2103 selfloop flow, removed 6 redundant places. [2022-12-06 07:49:29,671 INFO L231 Difference]: Finished difference. Result has 448 places, 3377 transitions, 82934 flow [2022-12-06 07:49:29,673 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=101, PETRI_DIFFERENCE_MINUEND_FLOW=45496, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1960, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=593, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=107, PETRI_FLOW=82934, PETRI_PLACES=448, PETRI_TRANSITIONS=3377} [2022-12-06 07:49:29,673 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 423 predicate places. [2022-12-06 07:49:29,673 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:49:29,673 INFO L89 Accepts]: Start accepts. Operand has 448 places, 3377 transitions, 82934 flow [2022-12-06 07:49:29,687 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:49:29,687 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:49:29,687 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 448 places, 3377 transitions, 82934 flow [2022-12-06 07:49:29,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 429 places, 3377 transitions, 82934 flow [2022-12-06 07:49:37,878 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([517] thread2EXIT-->L104-2: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem20#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_5|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][2478], [1427#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~queue~0.base Int) (~queue~0.offset Int)) (or (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))), Black: 1577#(and (<= ~start~0 2) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1565#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (= ~i~0 0) (or (<= ~start~0 2) (<= ~n~0 3)) (= ~queue~0.offset 0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1499#(= ~ok~0 1), Black: 1581#(and (<= ~start~0 2) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1573#(and (<= ~start~0 2) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~i~0 0) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2532#(and (or (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= ~n~0 2) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))))) (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0)))) (or (and (= (* ~end~0 4) 4) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2584#(and (or (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (or (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (or (and (or (and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 2491#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2600#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 2)) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2458#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (= ~ok~0 1)), Black: 2558#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 2468#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~start~0) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))))))))))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= ~end~0 2) (< ~i~0 ~N~0) (= (+ ~start~0 2) ~end~0) (<= 2 ~N~0) (exists ((~A~0.offset Int) (v_~i~0_547 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_547 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_547 4) ~A~0.offset)) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_547 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (= ~ok~0 1)), Black: 999#(and (or (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (forall ((~queue~0.offset Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (<= ~n~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (<= ~end~0 0)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (= ~last~0 ~v_old~0)))) (or (not (<= ~end~0 1)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (or (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (<= ~start~0 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0)))) (= ~ok~0 1)), Black: 1005#(and (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~start~0 0))) (<= ~end~0 0))) (= ~start~0 ~end~0) (= ~i~0 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~end~0 1))) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (< ~start~0 0) (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (not (<= ~end~0 1)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (= ~ok~0 1)), Black: 2588#(and (or (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (or (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (or (and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 983#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (<= ~n~0 2) (= ~i~0 0) (< ~start~0 ~n~0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0))) (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~end~0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2406#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (= ~last~0 ~v_old~0) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~queue~0.offset 0) (<= 2 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (= ~ok~0 1)), Black: 2408#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t1~0#1.base|) (= ~queue~0.offset 0) (<= 2 ~N~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| ~queue~0.base)) (= ~ok~0 1)), Black: 2475#(and (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~start~0 (+ ~end~0 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0)) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (<= ~n~0 ~end~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (<= ~N~0 0) (and (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))))))))))) (= ~ok~0 1)), Black: 2528#(and (<= 0 ~start~0) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0)) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (<= ~n~0 ~end~0)) (<= ~start~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 1049#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)))) (not (= (mod ~ok~0 256) 0))), Black: 2508#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1)), Black: 2414#(and (or (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= ~end~0 ~start~0)) (or (<= ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (= ~queue~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (or (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 2))) (and (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (or (<= ~n~0 2) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 2)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~ok~0 1)), Black: 1064#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0))) (<= ~end~0 ~start~0))), Black: 2485#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (<= ~N~0 0) (and (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))))))))))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (or (<= ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2502#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2562#(and (or (< ~end~0 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~N~0 ~i~0))) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0)) (not (= (mod ~ok~0 256) 0))) (<= ~n~0 ~end~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (<= ~N~0 v_~i~0_550) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)))))))))) (< ~end~0 0) (<= ~N~0 0)) (or (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0)) (not (= (mod ~ok~0 256) 0))) (<= ~n~0 ~end~0)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (and (not (< ~start~0 (+ ~end~0 1))) (not (< ~i~0 ~N~0))) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0)) (not (= (mod ~ok~0 256) 0))) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 1068#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (not (= (mod ~ok~0 256) 0))), Black: 2577#(and (<= 0 ~start~0) (<= ~start~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 1023#(and (or (< ~start~0 0) (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0)) (not (= ~start~0 0))) (<= ~end~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~end~0 1)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0))) (= ~ok~0 1))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (not (<= ~end~0 1)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (or (< ~start~0 0) (forall ((~queue~0.offset Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0)))), Black: 2504#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 895#(= ~ok~0 1), Black: 477#true, Black: 2534#(and (or (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= ~n~0 2) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))))) (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0)))) (or (and (= (* ~end~0 4) 4) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~ok~0 1)), Black: 981#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)))) (= ~ok~0 1)), Black: 2579#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (or (and (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 479#(not (<= ~N~0 ~i~0)), Black: 2543#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~queue~0.offset 0) (or (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (= (* ~end~0 4) 4) (= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4))))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 512#(= |thread2Thread1of1ForFork1_~cond~0#1| 1), Black: 2380#(or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (and (not (< ~start~0 (+ ~end~0 1))) (not (< ~i~0 ~N~0))) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0)) (not (= (mod ~ok~0 256) 0))) (not (<= 0 ~end~0))), Black: 508#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 1013#(and (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0)) (not (= ~start~0 0))) (<= ~end~0 0))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~end~0 1)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0) (= ~last~0 ~v_old~0))))) (or (< ~start~0 0) (< ~last~0 (+ ~v_old~0 1)) (not (< ~end~0 ~n~0))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (not (<= ~end~0 1)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (or (< ~start~0 0) (forall ((~queue~0.offset Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 964#(or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0)))), Black: 2524#(and (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2606#(and (or (<= ~n~0 (+ ~end~0 1)) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (<= ~N~0 v_~i~0_550) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)))))))))) (< ~end~0 0) (<= ~N~0 0)) (or (<= ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0)) (not (= (mod ~ok~0 256) 0)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 729#(<= ~end~0 (+ ~start~0 1)), Black: 2432#(and (or (<= ~n~0 (+ ~end~0 1)) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (<= ~N~0 v_~i~0_550) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)))))))))) (< ~end~0 0) (<= ~N~0 0)) (or (<= ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0)) (not (= (mod ~ok~0 256) 0))))), Black: 2497#(and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (or (and (= (* ~end~0 4) 4) (= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), 348#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0))) (<= ~end~0 ~start~0)), Black: 728#(<= ~end~0 ~start~0), Black: 1011#(and (or (not (<= ~end~0 1)) (and (= ~A~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (and (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~start~0 0))) (<= ~end~0 0))) (= ~start~0 ~end~0) (= ~i~0 0) (or (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (= ~end~0 1))) (or (and (<= 0 ~queue~0.offset) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= ~end~0 1)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= ~n~0 2) (<= ~end~0 1)) (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (not (<= ~end~0 1)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0))) (= ~ok~0 1)), Black: 2602#(and (or (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= ~end~0 ~start~0)) (or (<= ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 2)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (or (and (or (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 2))) (and (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (or (<= ~n~0 2) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 2404#(and (or (<= ~n~0 (+ ~end~0 1)) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (<= ~N~0 v_~i~0_550) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)))))))))) (< ~end~0 0) (<= ~N~0 0)) (or (<= ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0)) (not (= (mod ~ok~0 256) 0)))) (= ~ok~0 1)), Black: 2424#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (<= 0 ~start~0) (< ~start~0 ~n~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (< ~i~0 ~N~0) (= ~end~0 (+ ~start~0 1)) (exists ((~i~0 Int)) (and (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= 2 ~N~0) (= ~ok~0 1)), Black: 1045#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0))))), Black: 1041#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 2514#(and (<= 0 ~start~0) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0)) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (<= ~n~0 ~end~0)) (<= ~start~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0)))) (= ~ok~0 1)), Black: 2547#(and (or (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (= (* ~end~0 4) 4) (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4))))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 991#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (< ~start~0 ~n~0) (or (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0))) (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~end~0 (+ ~start~0 1)) (= ~ok~0 1)), Black: 2384#(or (< ~end~0 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~N~0 ~i~0))) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0)) (not (= (mod ~ok~0 256) 0))) (<= ~n~0 ~end~0)), Black: 1025#(and (or (<= ~n~0 ~start~0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (or (and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~start~0 0) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (<= ~start~0 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< 0 (+ ~start~0 1)) (not (= ~start~0 0)))) (= ~ok~0 1)), Black: 2460#(and (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~start~0 (+ ~end~0 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0)) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (<= ~n~0 ~end~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (<= ~N~0 0) (and (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))))))))))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2521#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 2582#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (or (and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 859#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (= ~ok~0 1)), Black: 2596#(and (or (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (or (and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 2594#(and (or (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (or (and (or (and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 2586#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (or (and (or (and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 2590#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (or (< ~end~0 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~N~0 ~i~0))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (or (and (or (and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 2464#(and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 2493#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= ~n~0 2) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))))) (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0))) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (or (and (= (* ~end~0 4) 4) (= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 1055#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)))) (= ~ok~0 1)), Black: 2536#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~queue~0.offset 0) (or (and (= (* ~end~0 4) 4) (= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 2538#(and (<= 0 ~start~0) (or (< ~end~0 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~N~0 ~i~0))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~n~0 ~end~0)) (<= ~start~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 2500#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 2)) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 1031#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)))) (= ~ok~0 1)), Black: 2495#(and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 1047#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)))) (not (= (mod ~ok~0 256) 0))), Black: 2518#(and (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~start~0 (+ ~end~0 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0)) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= ~end~0 ~start~0)) (= ~queue~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (or (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 2))) (and (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (or (<= ~n~0 2) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 2)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2540#(and (<= 0 ~start~0) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (<= ~n~0 ~end~0)) (<= ~start~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 2569#(and (or (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (= (* ~end~0 4) 4) (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4))))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2449#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 ~start~0) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))))))))))) (<= ~end~0 2) (< ~i~0 ~N~0) (= (+ ~start~0 2) ~end~0) (<= 2 ~N~0) (exists ((~A~0.offset Int) (v_~i~0_547 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_547 4) ~A~0.offset))) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_547 4) ~A~0.offset)) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_547 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (= ~ok~0 1)), Black: 2526#(and (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (< ~end~0 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~N~0 ~i~0))) (<= ~n~0 ~end~0)) (<= 0 ~start~0) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (<= ~n~0 ~end~0)) (<= ~start~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 2422#(and (or (<= ~n~0 (+ ~end~0 1)) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (<= ~N~0 v_~i~0_550) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)))))))))) (< ~end~0 0) (<= ~N~0 0)) (= ~ok~0 1)), Black: 2506#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (<= ~N~0 0) (and (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))))))))))) (or (<= ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~ok~0 1)), Black: 2426#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (< ~start~0 ~n~0) (= ~queue~0.offset 0) (= ~end~0 (+ ~start~0 1)) (exists ((~i~0 Int)) (and (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= 2 ~N~0) (= ~ok~0 1)), Black: 2592#(and (or (and (or (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2572#(and (or (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= ~end~0 ~start~0)) (or (<= ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (= ~queue~0.offset 0) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 2)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (or (and (or (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 2))) (and (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (or (<= ~n~0 2) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~ok~0 1)) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 2575#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (<= ~N~0 0) (and (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))))))))))) (or (<= ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2402#(or (<= ~n~0 (+ ~end~0 1)) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (<= ~N~0 v_~i~0_550) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)))))))))) (< ~end~0 0) (<= ~N~0 0)), Black: 2530#(and (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (<= ~N~0 0) (and (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))))))))))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2604#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (= (* ~start~0 4) 4) (= ~queue~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2453#(and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= ~n~0 2) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))))) (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0))) (= ~queue~0.offset 0) (or (and (= (* ~end~0 4) 4) (= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 2565#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (or (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (= ~queue~0.offset 0) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (or (and (or (and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), 731#(and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)), Black: 2489#(and (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~start~0 (+ ~end~0 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0)) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= ~end~0 ~start~0)) (= ~queue~0.offset 0) (or (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (and (or (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0) (<= (+ ~start~0 ~n~0) (+ ~end~0 2))) (and (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset)))) (or (<= ~n~0 2) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)))) (or (<= (+ ~start~0 ~n~0) (+ ~end~0 2)) (<= (+ ~queue~0.offset (* ~start~0 4)) 0)) (= ~ok~0 1)), Black: 2510#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~ok~0 1)), Black: 2376#(or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0)) (not (= (mod ~ok~0 256) 0)))), Black: 2428#(and (or (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (or (and (<= ~n~0 2) (or (not (= (+ ~queue~0.offset (* ~end~0 4)) 0)) (not (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))))) (and (<= ~end~0 ~start~0) (= ~last~0 ~v_old~0)))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 2287#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (<= 0 ~start~0) (< ~start~0 ~n~0) (= ~end~0 (+ ~start~0 1)) (exists ((~i~0 Int)) (and (<= ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (<= 2 ~N~0) (= ~ok~0 1)), Black: 2567#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (or (< ~end~0 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~N~0 ~i~0))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= ~n~0 ~end~0)) (= ~queue~0.offset 0) (= ~ok~0 1) (or (and (or (and (<= (select (select |#memory_int| ~queue~0.base) ~queue~0.offset) ~v_old~0) (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0)))), Black: 2451#(and (<= ~n~0 2) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= ~queue~0.offset 0) (< ~i~0 ~N~0) (= (+ ~start~0 2) ~end~0) (<= 2 ~N~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 2481#(and (<= 0 ~start~0) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((~A~0.offset Int) (~i~0 Int) (v_~i~0_550 Int) (~A~0.base Int)) (or (<= ~N~0 v_~i~0_550) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (< ~last~0 (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))))) (< ~end~0 0)) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (forall ((v_~i~0_550 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)))) (<= ~N~0 v_~i~0_550) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))))) (< ~end~0 0) (<= ~n~0 ~end~0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (<= ~N~0 0) (and (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))))))))))) (<= ~start~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 2609#(and (or (<= ~n~0 (+ ~end~0 1)) (and (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_960 (Array Int Int)) (v_~i~0_550 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (<= ~N~0 v_~i~0_550) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))))) (forall ((v_~i~0_550 Int)) (or (<= ~N~0 v_~i~0_550) (forall ((~A~0.offset Int) (v_ArrVal_960 (Array Int Int)) (~A~0.base Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (forall ((~i~0 Int)) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* v_~i~0_550 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_960) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)))))))))) (< ~end~0 0) (<= ~N~0 0)) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 2276#(and (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 2) (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (<= 2 ~N~0) (= ~ok~0 1)), Black: 2483#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))) (or (and (forall ((v_ArrVal_961 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_ArrVal_961 (Array Int Int))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_961) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0)))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2329#(= ~ok~0 1), Black: 2316#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (<= ~start~0 1) (<= 1 ~start~0) (= ~ok~0 1)), Black: 2466#(and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (or (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) ~queue~0.offset))) (and (= (* ~end~0 4) 4) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (<= (* ~n~0 4) (+ 3 ~queue~0.offset (* ~end~0 4)))) (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (= (+ ~queue~0.offset (* ~start~0 4)) 0))) (= ~queue~0.offset 0) (= ~ok~0 1)), 161#L104-2true, 2058#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), Black: 1421#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (<= ~end~0 1)) (and (<= ~end~0 0) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 4)) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (< ~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), 845#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~i~0 ~N~0)), Black: 1417#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= ~A~0.offset 0) (= ~start~0 ~end~0) (= ~i~0 0) (or (not (<= (+ ~queue~0.offset (* ~start~0 4) 1) 0)) (<= (* ~end~0 4) (+ ~queue~0.offset (* ~start~0 4)))) (<= (+ ~A~0.base 2) |ULTIMATE.start_main_~#t2~0#1.base|) (or (not (<= ~end~0 1)) (and (<= ~end~0 0) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= (+ ~queue~0.offset (* ~start~0 4)) 4)) (= ~last~0 ~v_old~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (< ~i~0 ~N~0) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1)), Black: 1344#(= ~ok~0 1), Black: 1363#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))), Black: 2150#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2110#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2134#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2208#(and (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 2114#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (mod ~ok~0 256) 0))))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2138#(and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (or (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= 0 ~start~0) (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0))) (and (or (not (= (* ~end~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= (* ~end~0 4) 4) (and (<= ~n~0 2) (< 0 ~end~0))))) (or (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0)))) (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0)) (= ~A~0.offset 0) (<= 0 ~start~0) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (mod ~ok~0 256) 0))))) (<= ~start~0 0) (or (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= 0 ~start~0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) ~v_old~0)) (and (or (not (= (* ~end~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= (* ~end~0 4) 4) (and (<= ~n~0 2) (< 0 ~end~0))))) (not (<= ~N~0 0)) (or (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) ~v_old~0) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (= ~ok~0 1)), Black: 2190#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 2156#(and (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (= ~ok~0 1)), Black: 2122#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 171#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 2124#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2178#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2102#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (= ~ok~0 1)), Black: 2132#(and (or (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= 0 ~start~0) (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0))) (and (or (not (= (* ~end~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= (* ~end~0 4) 4) (and (<= ~n~0 2) (< 0 ~end~0))))) (= ~A~0.offset 0) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (<= ~N~0 0)) (or (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (= ~ok~0 1)), Black: 2140#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2198#(and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (<= ~N~0 0)) (= (* ~start~0 4) 4) (= ~ok~0 1)), Black: 2176#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), 179#true, Black: 2184#(and (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2116#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2025#(= ~ok~0 1), Black: 2196#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (= ~ok~0 1)), Black: 2182#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2204#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))))), Black: 181#(or (not (<= ~end~0 ~start~0)) (not (<= ~N~0 ~i~0))), Black: 2108#(and (= ~A~0.offset 0) (<= ~n~0 2) (= ~i~0 0) (or (not (= (* ~end~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0))) (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (or (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (< ~i~0 ~N~0) (or (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (<= (select (select |#memory_int| ~A~0.base) ~A~0.offset) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (not (= ~A~0.base ~queue~0.base)) (= ~ok~0 1) (<= 1 ~end~0)), Black: 2136#(and (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1)), Black: 2144#(and (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (= ~A~0.offset 0) (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (not (< ~end~0 ~n~0)) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= 0 ~start~0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4)) ~v_old~0)) (and (or (not (= (* ~end~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= (* ~end~0 4) 4) (and (<= ~n~0 2) (< 0 ~end~0))))) (not (<= ~N~0 0)) (or (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (or (and (or (not (= (* ~end~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= (* ~end~0 4) 4) (and (<= ~n~0 2) (< 0 ~end~0)))) (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (= ~ok~0 1)), Black: 2164#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2073#(or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))), Black: 190#(= ~ok~0 1), Black: 2118#(and (or (and (<= (+ ~start~0 ~n~0) (+ ~end~0 1)) (<= 0 ~start~0) (<= (+ ~last~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset 4))) (+ (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0))) (and (or (not (= (* ~end~0 4) 4)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (or (= (* ~end~0 4) 4) (and (<= ~n~0 2) (< 0 ~end~0))))) (= ~A~0.offset 0) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (not (<= ~N~0 0)) (or (and (= ~v_old~0 (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= (+ ~queue~0.offset (* ~start~0 4)) 0)) (<= ~n~0 ~end~0)) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (or (<= ~n~0 (+ ~end~0 1)) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (= ~ok~0 1)), Black: 2106#(and (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (= ~ok~0 1)), Black: 2174#(and (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0)))), Black: 1721#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~ok~0 1)), Black: 2160#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2081#(or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))), Black: 1646#(= ~ok~0 1), Black: 2152#(and (or (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (not (= (mod ~ok~0 256) 0)))) (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0)) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))) (or (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (not (= (mod ~ok~0 256) 0))))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2188#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (<= ~N~0 0)) (= (* ~start~0 4) 4) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (= ~ok~0 1)), Black: 411#(and (or (forall ((~queue~0.base Int)) (or (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0))) (or (forall ((~queue~0.base Int) (v_ArrVal_156 (Array Int Int))) (or (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_156) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0))) (or (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (and (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), Black: 2170#(and (<= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) ~v_old~0) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int) (v_ArrVal_896 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~i~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* v_~i~0_424 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_896) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ (select (select |#memory_int| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)))))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (and (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (<= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))) (forall ((v_ArrVal_897 (Array Int Int)) (v_~i~0_424 Int)) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_897) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))))))) (not (<= ~N~0 0)) (= (* ~start~0 4) 4) (exists ((~i~0 Int) (~A~0.base Int)) (and (= (select (select |#memory_int| ~queue~0.base) (+ (- 4) ~queue~0.offset (* ~start~0 4))) (select (select |#memory_int| ~A~0.base) 0)) (= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (<= (select (select |#memory_int| ~A~0.base) (* ~i~0 4)) (select (select |#memory_int| ~A~0.base) 0)) (not (= ~A~0.base ~queue~0.base)))) (= ~ok~0 1) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)))), Black: 2168#(and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2186#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))))), Black: 1963#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (not (<= ~N~0 0)) (= (* ~start~0 4) 4)), Black: 2158#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))), Black: 2146#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((~i~0 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (not (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (= ~ok~0 1)), Black: 2202#(and (or (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset))))) (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (and (not (< ~start~0 ~end~0)) (not (< ~i~0 ~N~0))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) ~last~0)) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (not (< ~end~0 ~n~0)) (not (<= 0 ~end~0))) (or (<= ~n~0 (+ ~end~0 1)) (< ~end~0 0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))) (forall ((v_~i~0_424 Int)) (or (not (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4) 4)))) (< (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_424 4) ~A~0.offset)))))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0))))), Black: 421#(and (or (<= ~n~0 ~start~0) (< ~start~0 0) (<= ~end~0 ~start~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))) (= ~ok~0 1)), Black: 409#(and (= ~A~0.offset 0) (= ~i~0 0) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= ~end~0 (+ ~start~0 1)) (< ~end~0 (+ ~n~0 1)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= (+ ~queue~0.offset (* ~start~0 4)) 0) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~ok~0 1) (<= 1 ~end~0)), Black: 401#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (and (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= ~A~0.base |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (< ~end~0 ~n~0))) (= ~ok~0 1)), 669#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0)))), 2362#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (and (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4) 4)) (+ (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (mod ~ok~0 256) 0)))), 1053#(and (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (forall ((~queue~0.offset Int)) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (forall ((v_ArrVal_426 (Array Int Int))) (< (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_426) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1))))) (not (< ~end~0 ~n~0))) (or (< ~start~0 0) (<= (+ ~end~0 1) ~start~0) (not (< ~end~0 ~n~0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (< ~last~0 (+ ~v_old~0 1)) (= (* ~start~0 4) (* ~end~0 4)) (not (= (mod ~ok~0 256) 0)))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= ~n~0 ~start~0) (< ~start~0 0) (and (< (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) (+ ~v_old~0 1)) (not (= (mod ~ok~0 256) 0))) (<= ~end~0 ~start~0))), Black: 1144#(and (= ~start~0 ~end~0) (<= ~last~0 ~v_old~0) (= ~ok~0 1)), Black: 200#(<= ~end~0 ~start~0), Black: 1264#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~ok~0 1)), Black: 1132#(and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) ~v_old~0) (= ~ok~0 1)), Black: 1174#(and (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (not (< ~start~0 ~end~0))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1)) (exists ((~A~0.offset Int) (v_~i~0_337 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_337 4) ~A~0.offset)) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* v_~i~0_337 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (= ~ok~0 1)), Black: 1131#(and (< 0 (+ ~queue~0.offset (* ~start~0 4) 1)) (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (= ~ok~0 1)), Black: 1254#(and (= ~start~0 ~end~0) (or (not (<= ~end~0 1)) (and (<= (* ~start~0 4) (+ ~queue~0.offset (* ~end~0 4))) (<= (+ ~queue~0.offset (* ~end~0 4)) 0)) (= 4 (+ ~queue~0.offset (* ~end~0 4)))) (= ~last~0 ~v_old~0) (or (<= 0 ~queue~0.offset) (not (<= (+ ~queue~0.offset (* ~end~0 4) 1) 0))) (= ~ok~0 1)), Black: 1161#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~v_old~0) (= (select (select |#memory_int| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (= ~ok~0 1)), Black: 1187#(= ~ok~0 1)]) [2022-12-06 07:49:37,882 INFO L382 tUnfolder$Statistics]: this new event has 19 ancestors and is not cut-off event [2022-12-06 07:49:37,883 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:49:37,883 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:49:37,883 INFO L385 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2022-12-06 07:49:41,416 INFO L130 PetriNetUnfolder]: 14171/27570 cut-off events. [2022-12-06 07:49:41,416 INFO L131 PetriNetUnfolder]: For 1551911/1561166 co-relation queries the response was YES. [2022-12-06 07:49:41,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355961 conditions, 27570 events. 14171/27570 cut-off events. For 1551911/1561166 co-relation queries the response was YES. Maximal size of possible extension queue 1501. Compared 262635 event pairs, 2364 based on Foata normal form. 110/26174 useless extension candidates. Maximal degree in co-relation 355496. Up to 10615 conditions per place. [2022-12-06 07:49:42,367 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 429 places, 3377 transitions, 82934 flow [2022-12-06 07:49:42,367 INFO L188 LiptonReduction]: Number of co-enabled transitions 9610 [2022-12-06 07:49:45,898 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:45,996 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:46,094 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:49:46,110 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] [2022-12-06 07:49:46,134 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:49:46,155 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:49:46,176 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:46,273 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:46,412 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:46,522 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:46,620 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:46,719 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:46,819 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:46,914 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:47,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:49:47,030 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:47,129 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:47,227 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:47,325 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:47,423 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:47,537 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] and [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:49:47,602 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:47,721 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:47,816 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:47,913 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [592] L55-1-->L59: Formula: (= v_~i~0_63 (+ v_~i~0_64 1)) InVars {~i~0=v_~i~0_64} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_13|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_7|, ~i~0=v_~i~0_63} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:48,092 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [591] L49-4-->L59: Formula: (= v_~i~0_59 (+ v_~i~0_60 1)) InVars {~i~0=v_~i~0_60} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|, ~i~0=v_~i~0_59, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread1Thread1of1ForFork0_#t~mem1#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:48,223 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [591] L49-4-->L59: Formula: (= v_~i~0_59 (+ v_~i~0_60 1)) InVars {~i~0=v_~i~0_60} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_5|, ~i~0=v_~i~0_59, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_31|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0, thread1Thread1of1ForFork0_#t~mem1#1] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:48,408 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [777] L59-->L54: Formula: (let ((.cse0 (select (select |v_#memory_int_535| v_~A~0.base_266) (+ (* v_~i~0_410 4) v_~A~0.offset_266)))) (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (= v_~end~0_346 (+ v_~end~0_347 1)) (= (ite (= (select (select |v_#memory_int_535| v_~queue~0.base_237) (+ (* v_~end~0_347 4) v_~queue~0.offset_238)) .cse0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78| 0)) (<= .cse0 v_~last~0_220) (< v_~i~0_410 v_~N~0_281) (not (= (ite (and (< v_~end~0_347 v_~n~0_215) (<= 0 v_~end~0_347)) 1 0) 0)))) InVars {~A~0.base=v_~A~0.base_266, ~queue~0.offset=v_~queue~0.offset_238, ~A~0.offset=v_~A~0.offset_266, ~i~0=v_~i~0_410, #memory_int=|v_#memory_int_535|, ~end~0=v_~end~0_347, ~N~0=v_~N~0_281, ~queue~0.base=v_~queue~0.base_237, ~n~0=v_~n~0_215, ~last~0=v_~last~0_220} OutVars{~A~0.base=v_~A~0.base_266, ~queue~0.offset=v_~queue~0.offset_238, ~i~0=v_~i~0_410, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_78|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_78|, ~N~0=v_~N~0_281, ~queue~0.base=v_~queue~0.base_237, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_78|, ~A~0.offset=v_~A~0.offset_266, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_78|, #memory_int=|v_#memory_int_535|, ~end~0=v_~end~0_346, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_78|, ~n~0=v_~n~0_215, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_96|, ~last~0=v_~last~0_220} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:49:48,752 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [861] L59-->L55-1: Formula: (let ((.cse0 (select (select |v_#memory_int_750| v_~A~0.base_387) (+ (* v_~i~0_665 4) v_~A~0.offset_387)))) (and (not (= (ite (and (< v_~end~0_494 v_~n~0_333) (<= 0 v_~end~0_494)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| 0)) (= v_~last~0_345 |v_thread1Thread1of1ForFork0_#t~mem5#1_323|) (< v_~i~0_665 v_~N~0_436) (= (ite (= .cse0 (select (select |v_#memory_int_750| v_~queue~0.base_359) (+ (* v_~end~0_494 4) v_~queue~0.offset_360))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|) (= v_~end~0_493 (+ v_~end~0_494 1)) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_323| .cse0) (<= .cse0 v_~last~0_346) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|))) InVars {~A~0.base=v_~A~0.base_387, ~queue~0.offset=v_~queue~0.offset_360, ~A~0.offset=v_~A~0.offset_387, ~i~0=v_~i~0_665, #memory_int=|v_#memory_int_750|, ~end~0=v_~end~0_494, ~N~0=v_~N~0_436, ~queue~0.base=v_~queue~0.base_359, ~n~0=v_~n~0_333, ~last~0=v_~last~0_346} OutVars{~A~0.base=v_~A~0.base_387, ~queue~0.offset=v_~queue~0.offset_360, ~i~0=v_~i~0_665, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_92|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_92|, ~N~0=v_~N~0_436, ~queue~0.base=v_~queue~0.base_359, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_323|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_92|, ~A~0.offset=v_~A~0.offset_387, #memory_int=|v_#memory_int_750|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_92|, ~end~0=v_~end~0_493, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_92|, ~n~0=v_~n~0_333, ~last~0=v_~last~0_345, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_143|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1, ~last~0, thread1Thread1of1ForFork0_#t~mem1#1] and [651] L101-4-->L102-3: Formula: (and (= (store |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27| (store (select |v_#memory_int_122| |v_ULTIMATE.start_main_~#t2~0#1.base_27|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre17#1_23|)) |v_#memory_int_121|) (= |v_ULTIMATE.start_main_#t~pre17#1_23| |v_#pthreadsForks_22|) (= |v_#pthreadsForks_21| (+ |v_#pthreadsForks_22| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_22|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_122|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_7|, #pthreadsForks=|v_#pthreadsForks_21|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #memory_int=|v_#memory_int_121|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_15|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_23|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_27|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:49:48,881 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [668] L102-4-->L103-1: Formula: (= |v_ULTIMATE.start_main_#t~mem19#1_14| (select (select |v_#memory_int_143| |v_ULTIMATE.start_main_~#t1~0#1.base_35|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|)) InVars {#memory_int=|v_#memory_int_143|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|} OutVars{ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_14|, #memory_int=|v_#memory_int_143|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_9|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_35|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_29|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre17#1] [2022-12-06 07:49:49,531 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:49,684 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:49,796 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:49,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:50,025 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [862] L59-->L102-3: Formula: (let ((.cse0 (select (select |v_#memory_int_753| v_~A~0.base_389) (+ (* v_~i~0_667 4) v_~A~0.offset_389)))) (and (= |v_ULTIMATE.start_main_#t~pre17#1_201| |v_#pthreadsForks_231|) (= (+ |v_#pthreadsForks_231| 1) |v_#pthreadsForks_230|) (<= .cse0 v_~last~0_349) (= v_~end~0_497 (+ v_~end~0_498 1)) (= (ite (= (select (select |v_#memory_int_753| v_~queue~0.base_361) (+ (* v_~end~0_498 4) v_~queue~0.offset_362)) .cse0) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|) (= (store |v_#memory_int_753| |v_ULTIMATE.start_main_~#t2~0#1.base_154| (store (select |v_#memory_int_753| |v_ULTIMATE.start_main_~#t2~0#1.base_154|) |v_ULTIMATE.start_main_~#t2~0#1.offset_149| |v_ULTIMATE.start_main_#t~pre17#1_201|)) |v_#memory_int_752|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94| 0)) (< v_~i~0_667 v_~N~0_438) (not (= (ite (and (<= 0 v_~end~0_498) (< v_~end~0_498 v_~n~0_335)) 1 0) 0)))) InVars {~A~0.base=v_~A~0.base_389, ~queue~0.offset=v_~queue~0.offset_362, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_149|, ~i~0=v_~i~0_667, ~N~0=v_~N~0_438, ~queue~0.base=v_~queue~0.base_361, ~A~0.offset=v_~A~0.offset_389, #pthreadsForks=|v_#pthreadsForks_231|, #memory_int=|v_#memory_int_753|, ~end~0=v_~end~0_498, ~n~0=v_~n~0_335, ~last~0=v_~last~0_349, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_154|} OutVars{~A~0.base=v_~A~0.base_389, ~queue~0.offset=v_~queue~0.offset_362, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_149|, ~i~0=v_~i~0_667, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_94|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_94|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_168|, ~N~0=v_~N~0_438, ~queue~0.base=v_~queue~0.base_361, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_201|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_132|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_94|, ~A~0.offset=v_~A~0.offset_389, #pthreadsForks=|v_#pthreadsForks_230|, #memory_int=|v_#memory_int_752|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_94|, ~end~0=v_~end~0_497, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_94|, ~n~0=v_~n~0_335, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_145|, ~last~0=v_~last~0_349, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_154|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #pthreadsForks, thread1Thread1of1ForFork0_#t~post4#1, #memory_int, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, ULTIMATE.start_main_#t~pre15#1, thread1Thread1of1ForFork0_#t~mem3#1, ULTIMATE.start_main_#t~pre17#1, thread1Thread1of1ForFork0_#t~mem1#1] and [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] [2022-12-06 07:49:50,141 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [870] L54-->L50: Formula: (let ((.cse0 (select |v_#memory_int_772| v_~A~0.base_405))) (and (< v_~i~0_693 v_~N~0_450) (= (+ v_~i~0_694 1) v_~i~0_693) (<= (select .cse0 (+ v_~A~0.offset_405 (* v_~i~0_693 4))) v_~last~0_371) (= v_~last~0_371 (select .cse0 (+ (* v_~i~0_694 4) v_~A~0.offset_405))))) InVars {~A~0.base=v_~A~0.base_405, ~A~0.offset=v_~A~0.offset_405, ~i~0=v_~i~0_694, #memory_int=|v_#memory_int_772|, ~N~0=v_~N~0_450} OutVars{~A~0.base=v_~A~0.base_405, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_349|, ~A~0.offset=v_~A~0.offset_405, ~i~0=v_~i~0_693, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_174|, #memory_int=|v_#memory_int_772|, ~N~0=v_~N~0_450, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_155|, ~last~0=v_~last~0_371} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:50,267 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [870] L54-->L50: Formula: (let ((.cse0 (select |v_#memory_int_772| v_~A~0.base_405))) (and (< v_~i~0_693 v_~N~0_450) (= (+ v_~i~0_694 1) v_~i~0_693) (<= (select .cse0 (+ v_~A~0.offset_405 (* v_~i~0_693 4))) v_~last~0_371) (= v_~last~0_371 (select .cse0 (+ (* v_~i~0_694 4) v_~A~0.offset_405))))) InVars {~A~0.base=v_~A~0.base_405, ~A~0.offset=v_~A~0.offset_405, ~i~0=v_~i~0_694, #memory_int=|v_#memory_int_772|, ~N~0=v_~N~0_450} OutVars{~A~0.base=v_~A~0.base_405, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_349|, ~A~0.offset=v_~A~0.offset_405, ~i~0=v_~i~0_693, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_174|, #memory_int=|v_#memory_int_772|, ~N~0=v_~N~0_450, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_155|, ~last~0=v_~last~0_371} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread1Thread1of1ForFork0_#t~mem1#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:50,390 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:49:50,453 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:50,553 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:49:50,578 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:50,681 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [502] $Ultimate##0-->L79: Formula: (= (ite (= (ite (or (< v_~start~0_6 v_~end~0_7) (< v_~i~0_9 v_~N~0_4)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_1|) InVars {~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, ~i~0=v_~i~0_9} OutVars{~start~0=v_~start~0_6, ~end~0=v_~end~0_7, ~N~0=v_~N~0_4, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_1|, ~i~0=v_~i~0_9} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~cond~0#1] [2022-12-06 07:49:50,705 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:49:50,814 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L54-->L59: Formula: (and (= (+ v_~i~0_282 1) v_~i~0_281) (= v_~last~0_131 (select (select |v_#memory_int_366| v_~A~0.base_178) (+ v_~A~0.offset_178 (* v_~i~0_282 4))))) InVars {~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, ~i~0=v_~i~0_282, #memory_int=|v_#memory_int_366|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_101|, ~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_62|, ~i~0=v_~i~0_281, #memory_int=|v_#memory_int_366|, ~last~0=v_~last~0_131} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:49:50,908 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L54-->L59: Formula: (and (= (+ v_~i~0_282 1) v_~i~0_281) (= v_~last~0_131 (select (select |v_#memory_int_366| v_~A~0.base_178) (+ v_~A~0.offset_178 (* v_~i~0_282 4))))) InVars {~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, ~i~0=v_~i~0_282, #memory_int=|v_#memory_int_366|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_101|, ~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_62|, ~i~0=v_~i~0_281, #memory_int=|v_#memory_int_366|, ~last~0=v_~last~0_131} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:49:51,017 INFO L203 LiptonReduction]: Total number of compositions: 15 [2022-12-06 07:49:51,018 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21345 [2022-12-06 07:49:51,018 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 3370 transitions, 83910 flow [2022-12-06 07:49:51,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 0 states have call successors, (0), 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-12-06 07:49:51,018 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:49:51,018 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:49:51,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-06 07:49:51,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:51,223 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:49:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:49:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash -487918629, now seen corresponding path program 1 times [2022-12-06 07:49:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:49:51,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857937334] [2022-12-06 07:49:51,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:49:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:49:52,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857937334] [2022-12-06 07:49:52,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857937334] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:49:52,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326758841] [2022-12-06 07:49:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:49:52,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:49:52,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:49:52,668 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:49:52,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-06 07:49:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:49:52,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-06 07:49:52,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:49:52,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-06 07:49:52,821 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:49:52,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 07:49:52,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2022-12-06 07:49:52,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 07:49:53,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:49:53,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 28 [2022-12-06 07:49:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:53,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:49:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:49:54,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326758841] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:49:54,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:49:54,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 19 [2022-12-06 07:49:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159438180] [2022-12-06 07:49:54,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:49:54,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 07:49:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:49:54,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 07:49:54,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=319, Unknown=1, NotChecked=0, Total=420 [2022-12-06 07:49:54,314 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 153 [2022-12-06 07:49:54,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 3370 transitions, 83910 flow. Second operand has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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-12-06 07:49:54,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:49:54,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 153 [2022-12-06 07:49:54,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:50:10,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:50:48,194 INFO L130 PetriNetUnfolder]: 28291/48671 cut-off events. [2022-12-06 07:50:48,195 INFO L131 PetriNetUnfolder]: For 3162381/3162381 co-relation queries the response was YES. [2022-12-06 07:50:49,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696105 conditions, 48671 events. 28291/48671 cut-off events. For 3162381/3162381 co-relation queries the response was YES. Maximal size of possible extension queue 1860. Compared 421722 event pairs, 3844 based on Foata normal form. 359/48942 useless extension candidates. Maximal degree in co-relation 695333. Up to 22591 conditions per place. [2022-12-06 07:50:49,487 INFO L137 encePairwiseOnDemand]: 57/153 looper letters, 2694 selfloop transitions, 2327 changer transitions 158/5179 dead transitions. [2022-12-06 07:50:49,487 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 5179 transitions, 137136 flow [2022-12-06 07:50:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-06 07:50:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-12-06 07:50:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 453 transitions. [2022-12-06 07:50:49,489 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.10209601081812035 [2022-12-06 07:50:49,489 INFO L175 Difference]: Start difference. First operand has 422 places, 3370 transitions, 83910 flow. Second operand 29 states and 453 transitions. [2022-12-06 07:50:49,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 5179 transitions, 137136 flow [2022-12-06 07:51:30,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 5179 transitions, 129201 flow, removed 3938 selfloop flow, removed 22 redundant places. [2022-12-06 07:51:31,089 INFO L231 Difference]: Finished difference. Result has 453 places, 4432 transitions, 116870 flow [2022-12-06 07:51:31,091 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=79084, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1341, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=116870, PETRI_PLACES=453, PETRI_TRANSITIONS=4432} [2022-12-06 07:51:31,091 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 428 predicate places. [2022-12-06 07:51:31,091 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:51:31,092 INFO L89 Accepts]: Start accepts. Operand has 453 places, 4432 transitions, 116870 flow [2022-12-06 07:51:31,117 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:51:31,117 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:51:31,117 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 453 places, 4432 transitions, 116870 flow [2022-12-06 07:51:31,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 449 places, 4432 transitions, 116870 flow [2022-12-06 07:51:49,777 INFO L130 PetriNetUnfolder]: 18164/35953 cut-off events. [2022-12-06 07:51:49,777 INFO L131 PetriNetUnfolder]: For 1930991/1946219 co-relation queries the response was YES. [2022-12-06 07:51:50,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453361 conditions, 35953 events. 18164/35953 cut-off events. For 1930991/1946219 co-relation queries the response was YES. Maximal size of possible extension queue 1821. Compared 365022 event pairs, 3841 based on Foata normal form. 189/33782 useless extension candidates. Maximal degree in co-relation 452717. Up to 14836 conditions per place. [2022-12-06 07:51:51,342 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 449 places, 4432 transitions, 116870 flow [2022-12-06 07:51:51,343 INFO L188 LiptonReduction]: Number of co-enabled transitions 12154 [2022-12-06 07:51:51,354 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [804] $Ultimate##0-->L55-1: Formula: (and (= |v_thread2Thread1of1ForFork1_~cond~0#1_311| (ite (= (ite (or (< v_~start~0_407 v_~end~0_399) (< v_~i~0_491 v_~N~0_327)) 1 0) 0) 0 1)) (= (select (select |v_#memory_int_596| v_~A~0.base_305) (+ v_~A~0.offset_305 (* v_~i~0_491 4))) |v_thread1Thread1of1ForFork0_#t~mem5#1_240|) (= v_~last~0_261 |v_thread1Thread1of1ForFork0_#t~mem5#1_240|)) InVars {~start~0=v_~start~0_407, ~A~0.base=v_~A~0.base_305, ~A~0.offset=v_~A~0.offset_305, ~i~0=v_~i~0_491, #memory_int=|v_#memory_int_596|, ~end~0=v_~end~0_399, ~N~0=v_~N~0_327} OutVars{~start~0=v_~start~0_407, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_240|, ~A~0.base=v_~A~0.base_305, ~A~0.offset=v_~A~0.offset_305, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_311|, ~i~0=v_~i~0_491, #memory_int=|v_#memory_int_596|, ~end~0=v_~end~0_399, ~N~0=v_~N~0_327, ~last~0=v_~last~0_261} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_~cond~0#1, ~last~0] and [787] L79-->L59: Formula: (and (= (+ v_~start~0_360 1) v_~start~0_359) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_266| 256) 0)) (= (ite (and (< v_~start~0_360 v_~end~0_373) (<= 0 v_~start~0_360) (< v_~start~0_360 v_~n~0_233)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_118|) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_118| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|) (= v_~i~0_445 (+ v_~i~0_446 1)) (= (ite (= (ite (and (<= v_~new~0_172 v_~v_old~0_288) (not (= (mod v_~ok~0_293 256) 0))) 1 0) 0) 0 1) v_~ok~0_292) (= (ite (= (ite (or (< v_~i~0_446 v_~N~0_301) (< v_~start~0_359 v_~end~0_373)) 1 0) 0) 0 1) |v_thread2Thread1of1ForFork1_~cond~0#1_265|) (= (select (select |v_#memory_int_562| v_~queue~0.base_255) (+ (* v_~start~0_360 4) v_~queue~0.offset_256)) v_~new~0_172) (= v_~new~0_172 v_~v_old~0_287) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118| 0))) InVars {~start~0=v_~start~0_360, ~queue~0.offset=v_~queue~0.offset_256, ~ok~0=v_~ok~0_293, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_266|, ~i~0=v_~i~0_446, #memory_int=|v_#memory_int_562|, ~end~0=v_~end~0_373, ~N~0=v_~N~0_301, ~v_old~0=v_~v_old~0_288, ~queue~0.base=v_~queue~0.base_255, ~n~0=v_~n~0_233} OutVars{~start~0=v_~start~0_359, ~new~0=v_~new~0_172, ~queue~0.offset=v_~queue~0.offset_256, ~ok~0=v_~ok~0_292, ~i~0=v_~i~0_445, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_118|, ~N~0=v_~N~0_301, ~queue~0.base=v_~queue~0.base_255, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_118|, thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_196|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_118|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_265|, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_109|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_118|, #memory_int=|v_#memory_int_562|, ~end~0=v_~end~0_373, ~v_old~0=v_~v_old~0_287, ~n~0=v_~n~0_233} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem5#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, ~i~0, thread1Thread1of1ForFork0_#t~post6#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:51:51,530 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:51:51,635 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:51:51,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [545] L54-->L55-1: Formula: (and (= v_~last~0_8 |v_thread1Thread1of1ForFork0_#t~mem5#1_11|) (= |v_thread1Thread1of1ForFork0_#t~mem5#1_11| (select (select |v_#memory_int_51| v_~A~0.base_21) (+ (* v_~i~0_35 4) v_~A~0.offset_21)))) InVars {~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_11|, ~A~0.base=v_~A~0.base_21, ~A~0.offset=v_~A~0.offset_21, ~i~0=v_~i~0_35, #memory_int=|v_#memory_int_51|, ~last~0=v_~last~0_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, ~last~0] and [664] L79-->L79: Formula: (and (= (ite (= (ite (and (not (= (mod v_~ok~0_51 256) 0)) (<= v_~new~0_39 v_~v_old~0_45)) 1 0) 0) 0 1) v_~ok~0_50) (= v_~new~0_39 (select (select |v_#memory_int_139| v_~queue~0.base_47) (+ (* v_~start~0_75 4) v_~queue~0.offset_47))) (not (= (mod |v_thread2Thread1of1ForFork1_~cond~0#1_24| 256) 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|) (= (ite (and (<= 0 v_~start~0_75) (< v_~start~0_75 v_~n~0_54) (< v_~start~0_75 v_~end~0_90)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|) (= v_~new~0_39 v_~v_old~0_44) (= (+ v_~start~0_75 1) v_~start~0_74) (= |v_thread2Thread1of1ForFork1_~cond~0#1_23| (ite (= (ite (or (< v_~i~0_81 v_~N~0_75) (< v_~start~0_74 v_~end~0_90)) 1 0) 0) 0 1)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9| 0))) InVars {~start~0=v_~start~0_75, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_51, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_24|, ~i~0=v_~i~0_81, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~N~0=v_~N~0_75, ~v_old~0=v_~v_old~0_45, ~queue~0.base=v_~queue~0.base_47, ~n~0=v_~n~0_54} OutVars{~start~0=v_~start~0_74, ~new~0=v_~new~0_39, ~queue~0.offset=v_~queue~0.offset_47, ~ok~0=v_~ok~0_50, ~i~0=v_~i~0_81, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_9|, ~N~0=v_~N~0_75, ~queue~0.base=v_~queue~0.base_47, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_9|, thread2Thread1of1ForFork1_#t~mem7#1=|v_thread2Thread1of1ForFork1_#t~mem7#1_9|, thread2Thread1of1ForFork1_~cond~0#1=|v_thread2Thread1of1ForFork1_~cond~0#1_23|, thread2Thread1of1ForFork1_#t~post8#1=|v_thread2Thread1of1ForFork1_#t~post8#1_9|, #memory_int=|v_#memory_int_139|, ~end~0=v_~end~0_90, ~v_old~0=v_~v_old~0_44, ~n~0=v_~n~0_54} AuxVars[] AssignedVars[~start~0, ~new~0, thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem7#1, ~ok~0, thread2Thread1of1ForFork1_~cond~0#1, thread2Thread1of1ForFork1_#t~post8#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, ~v_old~0] [2022-12-06 07:51:51,883 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L54-->L59: Formula: (and (= (+ v_~i~0_282 1) v_~i~0_281) (= v_~last~0_131 (select (select |v_#memory_int_366| v_~A~0.base_178) (+ v_~A~0.offset_178 (* v_~i~0_282 4))))) InVars {~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, ~i~0=v_~i~0_282, #memory_int=|v_#memory_int_366|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_101|, ~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_62|, ~i~0=v_~i~0_281, #memory_int=|v_#memory_int_366|, ~last~0=v_~last~0_131} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:51:51,970 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L54-->L59: Formula: (and (= (+ v_~i~0_282 1) v_~i~0_281) (= v_~last~0_131 (select (select |v_#memory_int_366| v_~A~0.base_178) (+ v_~A~0.offset_178 (* v_~i~0_282 4))))) InVars {~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, ~i~0=v_~i~0_282, #memory_int=|v_#memory_int_366|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_101|, ~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_62|, ~i~0=v_~i~0_281, #memory_int=|v_#memory_int_366|, ~last~0=v_~last~0_131} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:51:52,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [728] L54-->L59: Formula: (and (= (+ v_~i~0_282 1) v_~i~0_281) (= v_~last~0_131 (select (select |v_#memory_int_366| v_~A~0.base_178) (+ v_~A~0.offset_178 (* v_~i~0_282 4))))) InVars {~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, ~i~0=v_~i~0_282, #memory_int=|v_#memory_int_366|} OutVars{thread1Thread1of1ForFork0_#t~mem5#1=|v_thread1Thread1of1ForFork0_#t~mem5#1_101|, ~A~0.base=v_~A~0.base_178, ~A~0.offset=v_~A~0.offset_178, thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_62|, ~i~0=v_~i~0_281, #memory_int=|v_#memory_int_366|, ~last~0=v_~last~0_131} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem5#1, thread1Thread1of1ForFork0_#t~post6#1, ~i~0, ~last~0] and [497] L50-->L54: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (not (= (ite (and (<= 0 v_~end~0_47) (< v_~end~0_47 v_~n~0_20)) 1 0) 0)) (= (ite (= (select (select |v_#memory_int_35| v_~queue~0.base_21) (+ (* v_~end~0_47 4) v_~queue~0.offset_21)) (select (select |v_#memory_int_35| v_~A~0.base_17) (+ (* v_~i~0_29 4) v_~A~0.offset_17))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= (+ v_~end~0_47 1) v_~end~0_46)) InVars {~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~A~0.offset=v_~A~0.offset_17, ~i~0=v_~i~0_29, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_47, ~queue~0.base=v_~queue~0.base_21, ~n~0=v_~n~0_20} OutVars{~A~0.base=v_~A~0.base_17, ~queue~0.offset=v_~queue~0.offset_21, ~i~0=v_~i~0_29, thread1Thread1of1ForFork0_#t~post4#1=|v_thread1Thread1of1ForFork0_#t~post4#1_1|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_1|, ~queue~0.base=v_~queue~0.base_21, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~A~0.offset=v_~A~0.offset_17, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, #memory_int=|v_#memory_int_35|, ~end~0=v_~end~0_46, thread1Thread1of1ForFork0_#t~mem3#1=|v_thread1Thread1of1ForFork0_#t~mem3#1_1|, ~n~0=v_~n~0_20} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post4#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, ~end~0, thread1Thread1of1ForFork0_#t~mem3#1] [2022-12-06 07:51:52,168 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:51:52,169 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21078 [2022-12-06 07:51:52,169 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 4432 transitions, 116934 flow [2022-12-06 07:51:52,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.55) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 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-12-06 07:51:52,169 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:51:52,169 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:51:52,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-06 07:51:52,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:52,369 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 07:51:52,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:51:52,370 INFO L85 PathProgramCache]: Analyzing trace with hash 514838015, now seen corresponding path program 1 times [2022-12-06 07:51:52,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:51:52,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185608857] [2022-12-06 07:51:52,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:52,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:51:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:53,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:51:53,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185608857] [2022-12-06 07:51:53,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185608857] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:51:53,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669102583] [2022-12-06 07:51:53,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:51:53,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:51:53,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:51:53,068 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:51:53,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-06 07:51:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:51:53,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 85 conjunts are in the unsatisfiable core [2022-12-06 07:51:53,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:51:53,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:51:53,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2022-12-06 07:51:53,219 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-06 07:51:53,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-06 07:51:53,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-12-06 07:51:53,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:51:53,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 56 [2022-12-06 07:51:53,876 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:51:53,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 28 [2022-12-06 07:51:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:53,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:51:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:51:54,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669102583] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:51:54,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:51:54,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-06 07:51:54,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587852946] [2022-12-06 07:51:54,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:51:54,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 07:51:54,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:51:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 07:51:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=273, Unknown=4, NotChecked=0, Total=380 [2022-12-06 07:51:54,727 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 161 [2022-12-06 07:51:54,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 4432 transitions, 116934 flow. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 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-12-06 07:51:54,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:51:54,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 161 [2022-12-06 07:51:54,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:51:59,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:52:07,925 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 83 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:52:17,181 WARN L233 SmtUtils]: Spent 8.41s on a formula simplification. DAG size of input: 111 DAG size of output: 102 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:52:23,790 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 115 DAG size of output: 104 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:52:26,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:52:39,031 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 95 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:52:45,387 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 83 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:52:56,758 WARN L233 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 99 DAG size of output: 90 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:53:06,297 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 101 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:53:13,291 WARN L233 SmtUtils]: Spent 6.23s on a formula simplification. DAG size of input: 86 DAG size of output: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:53:27,796 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 85 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:53:38,961 WARN L233 SmtUtils]: Spent 10.57s on a formula simplification. DAG size of input: 104 DAG size of output: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:53:43,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:53:46,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 07:53:57,084 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 67 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:54:06,108 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse16 (* c_~start~0 4))) (let ((.cse15 (select |c_#memory_int| c_~queue~0.base)) (.cse8 (+ .cse16 c_~queue~0.offset)) (.cse17 (+ c_~start~0 1))) (let ((.cse2 (not (< c_~end~0 c_~n~0))) (.cse9 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse11 (+ c_~A~0.offset (* c_~i~0 4))) (.cse3 (< .cse17 0)) (.cse4 (<= c_~n~0 .cse17)) (.cse5 (not (<= 0 c_~end~0))) (.cse1 (not (= (mod c_~ok~0 256) 0))) (.cse7 (+ .cse16 c_~queue~0.offset 4)) (.cse0 (select .cse15 .cse8))) (and (= c_~ok~0 1) (or (and (< .cse0 (+ c_~v_old~0 1)) .cse1) (< c_~start~0 0) (= (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (<= c_~end~0 c_~start~0) (<= c_~n~0 c_~start~0)) (or .cse2 .cse3 .cse4 .cse5 (and (forall ((v_ArrVal_1164 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1164))) (let ((.cse6 (select .cse10 c_~queue~0.base))) (or (< (select .cse6 .cse7) (+ (select .cse6 .cse8) 1)) (not (= (select .cse6 .cse9) (select (select .cse10 c_~A~0.base) .cse11))))))) (or (forall ((v_ArrVal_1164 (Array Int Int))) (not (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1164))) (= (select (select .cse12 c_~queue~0.base) .cse9) (select (select .cse12 c_~A~0.base) .cse11))))) .cse1) (forall ((v_ArrVal_1164 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1164))) (let ((.cse13 (select .cse14 c_~queue~0.base))) (or (<= (select .cse13 .cse8) c_~v_old~0) (not (= (select .cse13 .cse9) (select (select .cse14 c_~A~0.base) .cse11))))))))) (or .cse2 (not (= (select .cse15 .cse9) (select (select |c_#memory_int| c_~A~0.base) .cse11))) .cse3 .cse4 .cse5 (and .cse1 (<= .cse0 c_~v_old~0) (< (select .cse15 .cse7) (+ .cse0 1)))))))) is different from false Received shutdown request... [2022-12-06 07:54:41,301 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 07:54:41,346 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-12-06 07:54:42,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-06 07:54:42,548 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-06 07:54:42,607 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 137 [2022-12-06 07:54:42,801 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 07:54:42,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 07:54:42,802 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 07:54:42,803 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 07:54:42,803 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 07:54:42,804 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:54:42,806 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:54:42,806 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:54:42,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:54:42 BasicIcfg [2022-12-06 07:54:42,809 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:54:42,809 INFO L158 Benchmark]: Toolchain (without parser) took 819059.83ms. Allocated memory was 183.5MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 158.6MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2022-12-06 07:54:42,810 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:54:42,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.13ms. Allocated memory is still 183.5MB. Free memory was 158.1MB in the beginning and 145.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 07:54:42,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.14ms. Allocated memory is still 183.5MB. Free memory was 145.5MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:54:42,811 INFO L158 Benchmark]: Boogie Preprocessor took 35.30ms. Allocated memory is still 183.5MB. Free memory was 143.4MB in the beginning and 141.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:54:42,812 INFO L158 Benchmark]: RCFGBuilder took 506.13ms. Allocated memory is still 183.5MB. Free memory was 141.3MB in the beginning and 116.6MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-06 07:54:42,812 INFO L158 Benchmark]: TraceAbstraction took 818197.75ms. Allocated memory was 183.5MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 116.1MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2022-12-06 07:54:42,821 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.10ms. Allocated memory is still 183.5MB. Free memory was 160.1MB in the beginning and 160.0MB in the end (delta: 86.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.13ms. Allocated memory is still 183.5MB. Free memory was 158.1MB in the beginning and 145.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.14ms. Allocated memory is still 183.5MB. Free memory was 145.5MB in the beginning and 143.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.30ms. Allocated memory is still 183.5MB. Free memory was 143.4MB in the beginning and 141.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 506.13ms. Allocated memory is still 183.5MB. Free memory was 141.3MB in the beginning and 116.6MB in the end (delta: 24.6MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 818197.75ms. Allocated memory was 183.5MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 116.1MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 155 PlacesBefore, 25 PlacesAfterwards, 163 TransitionsBefore, 23 TransitionsAfterwards, 690 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 110 TrivialYvCompositions, 20 ConcurrentYvCompositions, 10 ChoiceCompositions, 140 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 454, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 482, independent: 454, independent conditional: 0, independent unconditional: 454, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 423, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 423, independent: 407, independent conditional: 0, independent unconditional: 407, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 29, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 423, unknown conditional: 0, unknown unconditional: 423] , Statistics on independence cache: Total cache size (in pairs): 638, Positive cache size: 623, Positive conditional cache size: 0, Positive unconditional cache size: 623, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 25, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 10, dependent conditional: 2, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 2, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 2, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 25, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 21, unknown conditional: 2, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 9, Negative conditional cache size: 2, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 27 PlacesBefore, 26 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 30, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 50, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 24, dependent conditional: 8, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 22, dependent conditional: 6, dependent unconditional: 16, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 12, Positive conditional cache size: 0, Positive unconditional cache size: 12, Negative cache size: 11, Negative conditional cache size: 4, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 152 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 9, dependent conditional: 9, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, independent: 18, independent conditional: 9, independent unconditional: 9, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 6, independent conditional: 2, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, independent: 12, independent conditional: 7, independent unconditional: 5, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 8, unknown conditional: 2, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 13, Negative conditional cache size: 4, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 33 PlacesBefore, 33 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 38, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 38, independent conditional: 24, independent unconditional: 14, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 35 PlacesBefore, 35 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 18, independent conditional: 12, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 38 PlacesBefore, 37 PlacesAfterwards, 42 TransitionsBefore, 41 TransitionsAfterwards, 168 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 48, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, independent: 48, independent conditional: 24, independent unconditional: 24, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 18, Positive conditional cache size: 2, Positive unconditional cache size: 16, Negative cache size: 15, Negative conditional cache size: 4, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 91 PlacesBefore, 87 PlacesAfterwards, 165 TransitionsBefore, 161 TransitionsAfterwards, 644 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 996, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 996, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 999, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 83, dependent conditional: 83, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 999, independent: 916, independent conditional: 916, independent unconditional: 0, dependent: 83, dependent conditional: 83, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 999, independent: 913, independent conditional: 913, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 25, Positive conditional cache size: 5, Positive unconditional cache size: 20, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 88 PlacesBefore, 88 PlacesAfterwards, 198 TransitionsBefore, 198 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 628, independent: 550, independent conditional: 550, independent unconditional: 0, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 25, Positive conditional cache size: 5, Positive unconditional cache size: 20, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.3s, 108 PlacesBefore, 107 PlacesAfterwards, 282 TransitionsBefore, 281 TransitionsAfterwards, 1092 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1304, independent: 1204, independent conditional: 1204, independent unconditional: 0, dependent: 100, dependent conditional: 100, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1304, independent: 1204, independent conditional: 1104, independent unconditional: 100, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1304, independent: 1204, independent conditional: 1104, independent unconditional: 100, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1304, independent: 1204, independent conditional: 1104, independent unconditional: 100, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1304, independent: 1204, independent conditional: 1104, independent unconditional: 100, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 29, Positive conditional cache size: 5, Positive unconditional cache size: 24, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 112 PlacesBefore, 111 PlacesAfterwards, 280 TransitionsBefore, 279 TransitionsAfterwards, 974 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1342, independent: 1222, independent conditional: 1222, independent unconditional: 0, dependent: 120, dependent conditional: 120, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1342, independent: 1222, independent conditional: 1214, independent unconditional: 8, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1342, independent: 1222, independent conditional: 1210, independent unconditional: 12, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1342, independent: 1222, independent conditional: 1210, independent unconditional: 12, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 3, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1342, independent: 1215, independent conditional: 1207, independent unconditional: 8, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 7, unknown conditional: 3, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 36, Positive conditional cache size: 8, Positive unconditional cache size: 28, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 213 PlacesBefore, 206 PlacesAfterwards, 660 TransitionsBefore, 653 TransitionsAfterwards, 2276 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92, independent: 92, independent conditional: 92, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 92, independent: 92, independent conditional: 92, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92, independent: 92, independent conditional: 92, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92, independent: 92, independent conditional: 92, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 92, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 46, Positive conditional cache size: 14, Positive unconditional cache size: 32, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 219 PlacesBefore, 219 PlacesAfterwards, 867 TransitionsBefore, 867 TransitionsAfterwards, 3112 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 46, Positive conditional cache size: 14, Positive unconditional cache size: 32, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.3s, 207 PlacesBefore, 204 PlacesAfterwards, 754 TransitionsBefore, 751 TransitionsAfterwards, 2816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 68, Positive conditional cache size: 24, Positive unconditional cache size: 44, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 215 PlacesBefore, 215 PlacesAfterwards, 850 TransitionsBefore, 850 TransitionsAfterwards, 3238 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 71, Positive conditional cache size: 27, Positive unconditional cache size: 44, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 235 PlacesBefore, 235 PlacesAfterwards, 1039 TransitionsBefore, 1039 TransitionsAfterwards, 4018 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 71, Positive conditional cache size: 27, Positive unconditional cache size: 44, Negative cache size: 19, Negative conditional cache size: 8, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.8s, 233 PlacesBefore, 232 PlacesAfterwards, 909 TransitionsBefore, 908 TransitionsAfterwards, 3542 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 5, dependent conditional: 3, dependent unconditional: 2, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 76, Positive conditional cache size: 28, Positive unconditional cache size: 48, Negative cache size: 22, Negative conditional cache size: 11, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 221 PlacesBefore, 221 PlacesAfterwards, 873 TransitionsBefore, 873 TransitionsAfterwards, 3414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 76, Positive conditional cache size: 28, Positive unconditional cache size: 48, Negative cache size: 22, Negative conditional cache size: 11, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 192 PlacesBefore, 189 PlacesAfterwards, 676 TransitionsBefore, 672 TransitionsAfterwards, 2730 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13, independent: 13, independent conditional: 13, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 88, Positive conditional cache size: 32, Positive unconditional cache size: 56, Negative cache size: 22, Negative conditional cache size: 11, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 276 PlacesBefore, 273 PlacesAfterwards, 1971 TransitionsBefore, 1968 TransitionsAfterwards, 6718 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 45, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, independent: 45, independent conditional: 41, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 41, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 3, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 45, independent: 41, independent conditional: 38, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 3, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 99, Positive conditional cache size: 36, Positive unconditional cache size: 63, Negative cache size: 22, Negative conditional cache size: 11, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7s, 429 PlacesBefore, 422 PlacesAfterwards, 3377 TransitionsBefore, 3370 TransitionsAfterwards, 9610 CoEnabledTransitionPairs, 2 FixpointIterations, 4 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 25, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, independent: 15, independent conditional: 14, independent unconditional: 1, dependent: 5, dependent conditional: 5, dependent unconditional: 0, unknown: 13, unknown conditional: 12, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 153, Positive conditional cache size: 43, Positive unconditional cache size: 110, Negative cache size: 27, Negative conditional cache size: 16, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 449 PlacesBefore, 449 PlacesAfterwards, 4432 TransitionsBefore, 4432 TransitionsAfterwards, 12154 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, independent: 7, independent conditional: 7, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 181, Positive cache size: 154, Positive conditional cache size: 44, Positive unconditional cache size: 110, Negative cache size: 27, Negative conditional cache size: 16, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 183 locations, 3 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: 818.1s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 658.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.6s, HoareTripleCheckerStatistics: 309 mSolverCounterUnknown, 5902 SdHoareTripleChecker+Valid, 66.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5902 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 63.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1428 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 1775 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21869 IncrementalHoareTripleChecker+Invalid, 25381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1775 mSolverCounterUnsat, 3 mSDtfsCounter, 21869 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1017 GetRequests, 363 SyntacticMatches, 28 SemanticMatches, 626 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 12176 ImplicationChecksByTransitivity, 401.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116934occurred in iteration=21, InterpolantAutomatonStates: 430, 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, 1.1s SatisfiabilityAnalysisTime, 52.7s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 899 ConstructedInterpolants, 106 QuantifiedInterpolants, 25645 SizeOfPredicates, 305 NumberOfNonLiveVariables, 4353 ConjunctsInSsa, 588 ConjunctsInUnsatCore, 52 InterpolantComputations, 9 PerfectInterpolantSequences, 71/189 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 !ENTRY org.eclipse.osgi 4 0 2022-12-06 07:54:42.907 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3588e4470/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3588e4470/.metadata/.log.