/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-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 19:41:45,168 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 19:41:45,170 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 19:41:45,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 19:41:45,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 19:41:45,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 19:41:45,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 19:41:45,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 19:41:45,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 19:41:45,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 19:41:45,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 19:41:45,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 19:41:45,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 19:41:45,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 19:41:45,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 19:41:45,241 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 19:41:45,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 19:41:45,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 19:41:45,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 19:41:45,244 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 19:41:45,245 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 19:41:45,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 19:41:45,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 19:41:45,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 19:41:45,253 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 19:41:45,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 19:41:45,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 19:41:45,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 19:41:45,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 19:41:45,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 19:41:45,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 19:41:45,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 19:41:45,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 19:41:45,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 19:41:45,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 19:41:45,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 19:41:45,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 19:41:45,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 19:41:45,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 19:41:45,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 19:41:45,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 19:41:45,262 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-11 19:41:45,289 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 19:41:45,289 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 19:41:45,291 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 19:41:45,291 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 19:41:45,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 19:41:45,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 19:41:45,292 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 19:41:45,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 19:41:45,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 19:41:45,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 19:41:45,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 19:41:45,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 19:41:45,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 19:41:45,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 19:41:45,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 19:41:45,294 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 19:41:45,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 19:41:45,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 19:41:45,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 19:41:45,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 19:41:45,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 19:41:45,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 19:41:45,294 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 19:41:45,294 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:41:45,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 19:41:45,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 19:41:45,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 19:41:45,295 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 19:41:45,295 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 19:41:45,295 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 19:41:45,295 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 19:41:45,295 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-11 19:41:45,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 19:41:45,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 19:41:45,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 19:41:45,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 19:41:45,574 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 19:41:45,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-11 19:41:46,520 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 19:41:46,705 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 19:41:46,705 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-11 19:41:46,711 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52141836/37235dca2f6b4a7898ff9d5831b20319/FLAG1e01e64f2 [2022-12-11 19:41:46,732 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d52141836/37235dca2f6b4a7898ff9d5831b20319 [2022-12-11 19:41:46,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 19:41:46,734 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 19:41:46,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 19:41:46,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 19:41:46,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 19:41:46,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:46,739 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c506a4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46, skipping insertion in model container [2022-12-11 19:41:46,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:46,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 19:41:46,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 19:41:46,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,898 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,899 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,900 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,901 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,905 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,914 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-channel-sum.wvr.c[2947,2960] [2022-12-11 19:41:46,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:41:46,934 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 19:41:46,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,954 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,955 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 19:41:46,957 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 19:41:46,960 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-channel-sum.wvr.c[2947,2960] [2022-12-11 19:41:46,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 19:41:46,993 INFO L208 MainTranslator]: Completed translation [2022-12-11 19:41:46,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46 WrapperNode [2022-12-11 19:41:46,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 19:41:46,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 19:41:46,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 19:41:46,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 19:41:47,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,039 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 151 [2022-12-11 19:41:47,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 19:41:47,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 19:41:47,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 19:41:47,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 19:41:47,046 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,046 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,061 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,062 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,063 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 19:41:47,067 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 19:41:47,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 19:41:47,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 19:41:47,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (1/1) ... [2022-12-11 19:41:47,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 19:41:47,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:41:47,099 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-11 19:41:47,130 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-11 19:41:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 19:41:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 19:41:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 19:41:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 19:41:47,143 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 19:41:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 19:41:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 19:41:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 19:41:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 19:41:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 19:41:47,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 19:41:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 19:41:47,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 19:41:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 19:41:47,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 19:41:47,145 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 19:41:47,237 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 19:41:47,251 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 19:41:47,455 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 19:41:47,510 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 19:41:47,510 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-11 19:41:47,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:41:47 BoogieIcfgContainer [2022-12-11 19:41:47,516 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 19:41:47,518 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 19:41:47,518 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 19:41:47,520 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 19:41:47,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 07:41:46" (1/3) ... [2022-12-11 19:41:47,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615db55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:41:47, skipping insertion in model container [2022-12-11 19:41:47,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 07:41:46" (2/3) ... [2022-12-11 19:41:47,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615db55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 07:41:47, skipping insertion in model container [2022-12-11 19:41:47,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 07:41:47" (3/3) ... [2022-12-11 19:41:47,522 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-12-11 19:41:47,535 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 19:41:47,535 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 19:41:47,536 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 19:41:47,608 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-11 19:41:47,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 131 transitions, 278 flow [2022-12-11 19:41:47,690 INFO L130 PetriNetUnfolder]: 11/129 cut-off events. [2022-12-11 19:41:47,690 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 19:41:47,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 11/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 123 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-11 19:41:47,694 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 131 transitions, 278 flow [2022-12-11 19:41:47,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 121 transitions, 254 flow [2022-12-11 19:41:47,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 19:41:47,708 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@602b86f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 19:41:47,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-11 19:41:47,730 INFO L130 PetriNetUnfolder]: 11/120 cut-off events. [2022-12-11 19:41:47,730 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-11 19:41:47,730 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:41:47,731 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:41:47,731 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-11 19:41:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:41:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1903356989, now seen corresponding path program 1 times [2022-12-11 19:41:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:41:47,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259087885] [2022-12-11 19:41:47,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:41:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:41:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:41:47,933 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-11 19:41:47,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:41:47,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259087885] [2022-12-11 19:41:47,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259087885] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:41:47,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:41:47,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 19:41:47,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144610615] [2022-12-11 19:41:47,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:41:47,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-11 19:41:47,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:41:47,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-11 19:41:47,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-11 19:41:47,970 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 131 [2022-12-11 19:41:47,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 121 transitions, 254 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:41:47,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:41:47,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 131 [2022-12-11 19:41:47,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:41:48,042 INFO L130 PetriNetUnfolder]: 11/138 cut-off events. [2022-12-11 19:41:48,043 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-11 19:41:48,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 138 events. 11/138 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 206 event pairs, 4 based on Foata normal form. 19/148 useless extension candidates. Maximal degree in co-relation 86. Up to 21 conditions per place. [2022-12-11 19:41:48,045 INFO L137 encePairwiseOnDemand]: 124/131 looper letters, 9 selfloop transitions, 0 changer transitions 3/114 dead transitions. [2022-12-11 19:41:48,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 114 transitions, 258 flow [2022-12-11 19:41:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-11 19:41:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-11 19:41:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 244 transitions. [2022-12-11 19:41:48,092 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9312977099236641 [2022-12-11 19:41:48,093 INFO L175 Difference]: Start difference. First operand has 117 places, 121 transitions, 254 flow. Second operand 2 states and 244 transitions. [2022-12-11 19:41:48,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 114 transitions, 258 flow [2022-12-11 19:41:48,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 114 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-11 19:41:48,098 INFO L231 Difference]: Finished difference. Result has 114 places, 111 transitions, 226 flow [2022-12-11 19:41:48,100 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=226, PETRI_PLACES=114, PETRI_TRANSITIONS=111} [2022-12-11 19:41:48,102 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2022-12-11 19:41:48,102 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 111 transitions, 226 flow [2022-12-11 19:41:48,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:41:48,103 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:41:48,103 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:41:48,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 19:41:48,106 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-11 19:41:48,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:41:48,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1276074944, now seen corresponding path program 1 times [2022-12-11 19:41:48,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:41:48,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985446914] [2022-12-11 19:41:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:41:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:41:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:41:48,450 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-11 19:41:48,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:41:48,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985446914] [2022-12-11 19:41:48,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985446914] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:41:48,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:41:48,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 19:41:48,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484854794] [2022-12-11 19:41:48,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:41:48,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 19:41:48,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:41:48,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 19:41:48,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-11 19:41:48,456 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 131 [2022-12-11 19:41:48,457 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 111 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 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-11 19:41:48,457 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:41:48,457 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 131 [2022-12-11 19:41:48,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:41:48,588 INFO L130 PetriNetUnfolder]: 27/278 cut-off events. [2022-12-11 19:41:48,589 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-11 19:41:48,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 278 events. 27/278 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1008 event pairs, 4 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 346. Up to 34 conditions per place. [2022-12-11 19:41:48,594 INFO L137 encePairwiseOnDemand]: 126/131 looper letters, 29 selfloop transitions, 2 changer transitions 4/123 dead transitions. [2022-12-11 19:41:48,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 123 transitions, 323 flow [2022-12-11 19:41:48,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 19:41:48,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 19:41:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2022-12-11 19:41:48,601 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7954198473282442 [2022-12-11 19:41:48,601 INFO L175 Difference]: Start difference. First operand has 114 places, 111 transitions, 226 flow. Second operand 5 states and 521 transitions. [2022-12-11 19:41:48,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 123 transitions, 323 flow [2022-12-11 19:41:48,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 123 transitions, 323 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-11 19:41:48,605 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 242 flow [2022-12-11 19:41:48,605 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2022-12-11 19:41:48,605 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2022-12-11 19:41:48,606 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 242 flow [2022-12-11 19:41:48,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 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-11 19:41:48,606 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:41:48,606 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:41:48,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 19:41:48,607 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-11 19:41:48,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:41:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1373865795, now seen corresponding path program 1 times [2022-12-11 19:41:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:41:48,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722464917] [2022-12-11 19:41:48,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:41:48,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:41:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:41:48,841 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-11 19:41:48,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:41:48,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722464917] [2022-12-11 19:41:48,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722464917] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:41:48,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:41:48,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 19:41:48,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016899629] [2022-12-11 19:41:48,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:41:48,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 19:41:48,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:41:48,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 19:41:48,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-11 19:41:48,844 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 131 [2022-12-11 19:41:48,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:41:48,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:41:48,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 131 [2022-12-11 19:41:48,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:41:48,936 INFO L130 PetriNetUnfolder]: 105/414 cut-off events. [2022-12-11 19:41:48,936 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-11 19:41:48,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 414 events. 105/414 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1560 event pairs, 39 based on Foata normal form. 0/383 useless extension candidates. Maximal degree in co-relation 628. Up to 163 conditions per place. [2022-12-11 19:41:48,939 INFO L137 encePairwiseOnDemand]: 126/131 looper letters, 27 selfloop transitions, 6 changer transitions 3/127 dead transitions. [2022-12-11 19:41:48,939 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 127 transitions, 347 flow [2022-12-11 19:41:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-11 19:41:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-11 19:41:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 445 transitions. [2022-12-11 19:41:48,940 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8492366412213741 [2022-12-11 19:41:48,941 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 242 flow. Second operand 4 states and 445 transitions. [2022-12-11 19:41:48,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 127 transitions, 347 flow [2022-12-11 19:41:48,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 127 transitions, 341 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-11 19:41:48,944 INFO L231 Difference]: Finished difference. Result has 118 places, 117 transitions, 273 flow [2022-12-11 19:41:48,945 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=118, PETRI_TRANSITIONS=117} [2022-12-11 19:41:48,946 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2022-12-11 19:41:48,946 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 117 transitions, 273 flow [2022-12-11 19:41:48,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 19:41:48,946 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:41:48,947 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:41:48,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 19:41:48,947 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-11 19:41:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:41:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1881315654, now seen corresponding path program 1 times [2022-12-11 19:41:48,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:41:48,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455664910] [2022-12-11 19:41:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:41:48,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:41:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:41:49,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:41:49,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:41:49,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455664910] [2022-12-11 19:41:49,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455664910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:41:49,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:41:49,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-11 19:41:49,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874122824] [2022-12-11 19:41:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:41:49,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-11 19:41:49,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:41:49,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-11 19:41:49,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-11 19:41:49,156 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 131 [2022-12-11 19:41:49,156 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 117 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 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-11 19:41:49,156 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:41:49,157 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 131 [2022-12-11 19:41:49,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:41:49,249 INFO L130 PetriNetUnfolder]: 110/425 cut-off events. [2022-12-11 19:41:49,249 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-11 19:41:49,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 425 events. 110/425 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1624 event pairs, 42 based on Foata normal form. 4/403 useless extension candidates. Maximal degree in co-relation 717. Up to 119 conditions per place. [2022-12-11 19:41:49,251 INFO L137 encePairwiseOnDemand]: 125/131 looper letters, 27 selfloop transitions, 4 changer transitions 11/133 dead transitions. [2022-12-11 19:41:49,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 133 transitions, 396 flow [2022-12-11 19:41:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-11 19:41:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-11 19:41:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2022-12-11 19:41:49,253 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8442748091603054 [2022-12-11 19:41:49,253 INFO L175 Difference]: Start difference. First operand has 118 places, 117 transitions, 273 flow. Second operand 5 states and 553 transitions. [2022-12-11 19:41:49,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 133 transitions, 396 flow [2022-12-11 19:41:49,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 133 transitions, 396 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-11 19:41:49,258 INFO L231 Difference]: Finished difference. Result has 123 places, 114 transitions, 268 flow [2022-12-11 19:41:49,258 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=268, PETRI_PLACES=123, PETRI_TRANSITIONS=114} [2022-12-11 19:41:49,259 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2022-12-11 19:41:49,260 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 114 transitions, 268 flow [2022-12-11 19:41:49,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 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-11 19:41:49,263 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:41:49,263 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:41:49,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 19:41:49,264 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-11 19:41:49,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:41:49,264 INFO L85 PathProgramCache]: Analyzing trace with hash 826183445, now seen corresponding path program 1 times [2022-12-11 19:41:49,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:41:49,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365229479] [2022-12-11 19:41:49,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:41:49,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:41:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:41:49,342 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-11 19:41:49,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:41:49,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365229479] [2022-12-11 19:41:49,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365229479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:41:49,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:41:49,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 19:41:49,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381483709] [2022-12-11 19:41:49,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:41:49,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 19:41:49,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:41:49,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 19:41:49,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 19:41:49,345 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 131 [2022-12-11 19:41:49,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 114 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-11 19:41:49,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:41:49,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 131 [2022-12-11 19:41:49,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:41:49,374 INFO L130 PetriNetUnfolder]: 22/180 cut-off events. [2022-12-11 19:41:49,374 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-12-11 19:41:49,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 180 events. 22/180 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 431 event pairs, 12 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 256. Up to 46 conditions per place. [2022-12-11 19:41:49,375 INFO L137 encePairwiseOnDemand]: 128/131 looper letters, 17 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2022-12-11 19:41:49,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 118 transitions, 310 flow [2022-12-11 19:41:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 19:41:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 19:41:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2022-12-11 19:41:49,376 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8905852417302799 [2022-12-11 19:41:49,376 INFO L175 Difference]: Start difference. First operand has 123 places, 114 transitions, 268 flow. Second operand 3 states and 350 transitions. [2022-12-11 19:41:49,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 118 transitions, 310 flow [2022-12-11 19:41:49,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 118 transitions, 298 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-11 19:41:49,378 INFO L231 Difference]: Finished difference. Result has 120 places, 114 transitions, 261 flow [2022-12-11 19:41:49,379 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=120, PETRI_TRANSITIONS=114} [2022-12-11 19:41:49,380 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2022-12-11 19:41:49,380 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 114 transitions, 261 flow [2022-12-11 19:41:49,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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-11 19:41:49,381 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:41:49,381 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:41:49,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-11 19:41:49,381 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-11 19:41:49,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:41:49,382 INFO L85 PathProgramCache]: Analyzing trace with hash 534202022, now seen corresponding path program 2 times [2022-12-11 19:41:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:41:49,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018679118] [2022-12-11 19:41:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:41:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:41:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:41:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:41:49,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:41:49,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018679118] [2022-12-11 19:41:49,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018679118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:41:49,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:41:49,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-11 19:41:49,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047965671] [2022-12-11 19:41:49,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:41:49,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-11 19:41:49,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:41:49,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-11 19:41:49,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-11 19:41:49,581 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 131 [2022-12-11 19:41:49,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 114 transitions, 261 flow. Second operand has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 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-11 19:41:49,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:41:49,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 131 [2022-12-11 19:41:49,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:41:49,861 INFO L130 PetriNetUnfolder]: 169/638 cut-off events. [2022-12-11 19:41:49,861 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-11 19:41:49,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 638 events. 169/638 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2922 event pairs, 40 based on Foata normal form. 0/592 useless extension candidates. Maximal degree in co-relation 1065. Up to 117 conditions per place. [2022-12-11 19:41:49,865 INFO L137 encePairwiseOnDemand]: 119/131 looper letters, 47 selfloop transitions, 6 changer transitions 41/170 dead transitions. [2022-12-11 19:41:49,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 170 transitions, 584 flow [2022-12-11 19:41:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-11 19:41:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-11 19:41:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1125 transitions. [2022-12-11 19:41:49,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7156488549618321 [2022-12-11 19:41:49,867 INFO L175 Difference]: Start difference. First operand has 120 places, 114 transitions, 261 flow. Second operand 12 states and 1125 transitions. [2022-12-11 19:41:49,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 170 transitions, 584 flow [2022-12-11 19:41:49,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 170 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-11 19:41:49,871 INFO L231 Difference]: Finished difference. Result has 136 places, 115 transitions, 293 flow [2022-12-11 19:41:49,871 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=293, PETRI_PLACES=136, PETRI_TRANSITIONS=115} [2022-12-11 19:41:49,873 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 19 predicate places. [2022-12-11 19:41:49,873 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 115 transitions, 293 flow [2022-12-11 19:41:49,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 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-11 19:41:49,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:41:49,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:41:49,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-11 19:41:49,874 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-11 19:41:49,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:41:49,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1632876133, now seen corresponding path program 1 times [2022-12-11 19:41:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:41:49,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794592034] [2022-12-11 19:41:49,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:41:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:41:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:41:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:41:50,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:41:50,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794592034] [2022-12-11 19:41:50,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794592034] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:41:50,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400666775] [2022-12-11 19:41:50,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:41:50,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:41:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:41:50,135 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-11 19:41:50,136 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-11 19:41:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:41:50,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-11 19:41:50,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:41:50,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 19:41:50,403 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-11 19:41:50,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-11 19:41:50,717 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 19:41:50,718 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 15 treesize of output 15 [2022-12-11 19:41:50,822 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-11 19:41:51,046 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-11 19:41:51,104 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-11 19:41:51,307 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-11 19:41:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:41:51,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:41:52,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:41:52,462 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 1 case distinctions, treesize of input 63 treesize of output 51 [2022-12-11 19:41:52,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:41:52,471 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 325 treesize of output 305 [2022-12-11 19:41:52,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:41:52,481 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 293 treesize of output 257 [2022-12-11 19:41:52,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:41:52,493 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 245 treesize of output 233 [2022-12-11 19:41:52,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:41:52,691 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 1 case distinctions, treesize of input 63 treesize of output 51 [2022-12-11 19:41:52,720 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-11 19:41:52,720 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 153 treesize of output 141 [2022-12-11 19:41:52,728 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-11 19:41:52,730 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 137 treesize of output 129 [2022-12-11 19:41:52,738 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-11 19:41:52,740 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 125 treesize of output 105 [2022-12-11 19:41:55,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:41:55,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400666775] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:41:55,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:41:55,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28, 28] total 55 [2022-12-11 19:41:55,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691252405] [2022-12-11 19:41:55,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:41:55,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-12-11 19:41:55,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:41:55,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-11 19:41:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=538, Invalid=2400, Unknown=32, NotChecked=0, Total=2970 [2022-12-11 19:41:55,507 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 131 [2022-12-11 19:41:55,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 115 transitions, 293 flow. Second operand has 55 states, 55 states have (on average 45.14545454545455) internal successors, (2483), 55 states have internal predecessors, (2483), 0 states have call successors, (0), 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-11 19:41:55,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:41:55,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 131 [2022-12-11 19:41:55,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:42:19,053 INFO L130 PetriNetUnfolder]: 1850/4180 cut-off events. [2022-12-11 19:42:19,054 INFO L131 PetriNetUnfolder]: For 809/809 co-relation queries the response was YES. [2022-12-11 19:42:19,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8588 conditions, 4180 events. 1850/4180 cut-off events. For 809/809 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 31745 event pairs, 136 based on Foata normal form. 10/4035 useless extension candidates. Maximal degree in co-relation 8574. Up to 697 conditions per place. [2022-12-11 19:42:19,075 INFO L137 encePairwiseOnDemand]: 94/131 looper letters, 337 selfloop transitions, 215 changer transitions 27/617 dead transitions. [2022-12-11 19:42:19,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 617 transitions, 2833 flow [2022-12-11 19:42:19,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-12-11 19:42:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2022-12-11 19:42:19,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 4988 transitions. [2022-12-11 19:42:19,085 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.36263177026535803 [2022-12-11 19:42:19,085 INFO L175 Difference]: Start difference. First operand has 136 places, 115 transitions, 293 flow. Second operand 105 states and 4988 transitions. [2022-12-11 19:42:19,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 617 transitions, 2833 flow [2022-12-11 19:42:19,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 617 transitions, 2657 flow, removed 74 selfloop flow, removed 7 redundant places. [2022-12-11 19:42:19,097 INFO L231 Difference]: Finished difference. Result has 288 places, 353 transitions, 1843 flow [2022-12-11 19:42:19,097 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=1843, PETRI_PLACES=288, PETRI_TRANSITIONS=353} [2022-12-11 19:42:19,097 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 171 predicate places. [2022-12-11 19:42:19,098 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 353 transitions, 1843 flow [2022-12-11 19:42:19,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 45.14545454545455) internal successors, (2483), 55 states have internal predecessors, (2483), 0 states have call successors, (0), 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-11 19:42:19,098 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:42:19,099 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:42:19,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-11 19:42:19,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:19,305 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-11 19:42:19,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:42:19,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2015065474, now seen corresponding path program 2 times [2022-12-11 19:42:19,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:42:19,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201441826] [2022-12-11 19:42:19,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:42:19,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:42:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:42:19,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:19,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:42:19,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201441826] [2022-12-11 19:42:19,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201441826] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:42:19,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352025902] [2022-12-11 19:42:19,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 19:42:19,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:19,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:42:19,472 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-11 19:42:19,474 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-11 19:42:19,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 19:42:19,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:42:19,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-11 19:42:19,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:42:19,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:19,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:42:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:19,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352025902] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:42:19,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:42:19,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2022-12-11 19:42:19,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294692095] [2022-12-11 19:42:19,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:42:19,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 19:42:19,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:42:19,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 19:42:19,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-11 19:42:19,837 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 131 [2022-12-11 19:42:19,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 353 transitions, 1843 flow. Second operand has 11 states, 11 states have (on average 100.45454545454545) internal successors, (1105), 11 states have internal predecessors, (1105), 0 states have call successors, (0), 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-11 19:42:19,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:42:19,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 131 [2022-12-11 19:42:19,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:42:20,770 INFO L130 PetriNetUnfolder]: 1840/4678 cut-off events. [2022-12-11 19:42:20,770 INFO L131 PetriNetUnfolder]: For 82604/82722 co-relation queries the response was YES. [2022-12-11 19:42:20,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21934 conditions, 4678 events. 1840/4678 cut-off events. For 82604/82722 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 34864 event pairs, 208 based on Foata normal form. 24/4483 useless extension candidates. Maximal degree in co-relation 21862. Up to 950 conditions per place. [2022-12-11 19:42:20,878 INFO L137 encePairwiseOnDemand]: 118/131 looper letters, 343 selfloop transitions, 138 changer transitions 0/646 dead transitions. [2022-12-11 19:42:20,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 646 transitions, 4980 flow [2022-12-11 19:42:20,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-11 19:42:20,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-11 19:42:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1791 transitions. [2022-12-11 19:42:20,895 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8042209250112259 [2022-12-11 19:42:20,896 INFO L175 Difference]: Start difference. First operand has 288 places, 353 transitions, 1843 flow. Second operand 17 states and 1791 transitions. [2022-12-11 19:42:20,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 646 transitions, 4980 flow [2022-12-11 19:42:21,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 646 transitions, 4863 flow, removed 45 selfloop flow, removed 17 redundant places. [2022-12-11 19:42:21,007 INFO L231 Difference]: Finished difference. Result has 296 places, 453 transitions, 3060 flow [2022-12-11 19:42:21,008 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3060, PETRI_PLACES=296, PETRI_TRANSITIONS=453} [2022-12-11 19:42:21,008 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 179 predicate places. [2022-12-11 19:42:21,008 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 453 transitions, 3060 flow [2022-12-11 19:42:21,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.45454545454545) internal successors, (1105), 11 states have internal predecessors, (1105), 0 states have call successors, (0), 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-11 19:42:21,009 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:42:21,009 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:42:21,015 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-11 19:42:21,212 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,SelfDestructingSolverStorable7 [2022-12-11 19:42:21,214 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-11 19:42:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:42:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -435767007, now seen corresponding path program 1 times [2022-12-11 19:42:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:42:21,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408576342] [2022-12-11 19:42:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:42:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:42:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:42:21,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:21,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:42:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408576342] [2022-12-11 19:42:21,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408576342] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:42:21,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762864124] [2022-12-11 19:42:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:42:21,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:21,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:42:21,360 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-11 19:42:21,362 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-11 19:42:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:42:21,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-11 19:42:21,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:42:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:21,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:42:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:21,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762864124] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:42:21,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:42:21,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 11 [2022-12-11 19:42:21,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381648281] [2022-12-11 19:42:21,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:42:21,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-11 19:42:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:42:21,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-11 19:42:21,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-12-11 19:42:21,652 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 131 [2022-12-11 19:42:21,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 453 transitions, 3060 flow. Second operand has 11 states, 11 states have (on average 100.45454545454545) internal successors, (1105), 11 states have internal predecessors, (1105), 0 states have call successors, (0), 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-11 19:42:21,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:42:21,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 131 [2022-12-11 19:42:21,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:42:23,623 INFO L130 PetriNetUnfolder]: 3562/9005 cut-off events. [2022-12-11 19:42:23,623 INFO L131 PetriNetUnfolder]: For 200195/200273 co-relation queries the response was YES. [2022-12-11 19:42:23,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51711 conditions, 9005 events. 3562/9005 cut-off events. For 200195/200273 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 77136 event pairs, 480 based on Foata normal form. 41/8732 useless extension candidates. Maximal degree in co-relation 51630. Up to 2053 conditions per place. [2022-12-11 19:42:23,735 INFO L137 encePairwiseOnDemand]: 118/131 looper letters, 525 selfloop transitions, 267 changer transitions 2/959 dead transitions. [2022-12-11 19:42:23,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 959 transitions, 9978 flow [2022-12-11 19:42:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-11 19:42:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-12-11 19:42:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2532 transitions. [2022-12-11 19:42:23,737 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8053435114503816 [2022-12-11 19:42:23,738 INFO L175 Difference]: Start difference. First operand has 296 places, 453 transitions, 3060 flow. Second operand 24 states and 2532 transitions. [2022-12-11 19:42:23,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 959 transitions, 9978 flow [2022-12-11 19:42:24,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 959 transitions, 9638 flow, removed 164 selfloop flow, removed 4 redundant places. [2022-12-11 19:42:24,249 INFO L231 Difference]: Finished difference. Result has 330 places, 699 transitions, 6710 flow [2022-12-11 19:42:24,249 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=2940, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6710, PETRI_PLACES=330, PETRI_TRANSITIONS=699} [2022-12-11 19:42:24,250 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 213 predicate places. [2022-12-11 19:42:24,250 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 699 transitions, 6710 flow [2022-12-11 19:42:24,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 100.45454545454545) internal successors, (1105), 11 states have internal predecessors, (1105), 0 states have call successors, (0), 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-11 19:42:24,251 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:42:24,251 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:42:24,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-11 19:42:24,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:24,458 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-11 19:42:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:42:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 343321553, now seen corresponding path program 2 times [2022-12-11 19:42:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:42:24,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142344958] [2022-12-11 19:42:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:42:24,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:42:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:42:24,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:24,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:42:24,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142344958] [2022-12-11 19:42:24,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142344958] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:42:24,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447774872] [2022-12-11 19:42:24,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 19:42:24,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:24,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:42:24,689 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-11 19:42:24,693 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-11 19:42:24,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 19:42:24,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:42:24,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-11 19:42:24,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:42:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:42:25,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:42:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:42:25,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447774872] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:42:25,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:42:25,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2022-12-11 19:42:25,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274048362] [2022-12-11 19:42:25,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:42:25,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-11 19:42:25,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:42:25,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-11 19:42:25,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2022-12-11 19:42:25,542 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 131 [2022-12-11 19:42:25,543 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 699 transitions, 6710 flow. Second operand has 30 states, 30 states have (on average 87.96666666666667) internal successors, (2639), 30 states have internal predecessors, (2639), 0 states have call successors, (0), 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-11 19:42:25,543 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:42:25,543 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 131 [2022-12-11 19:42:25,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:42:28,506 INFO L130 PetriNetUnfolder]: 3766/11201 cut-off events. [2022-12-11 19:42:28,506 INFO L131 PetriNetUnfolder]: For 361721/362220 co-relation queries the response was YES. [2022-12-11 19:42:28,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73595 conditions, 11201 events. 3766/11201 cut-off events. For 361721/362220 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 112934 event pairs, 452 based on Foata normal form. 305/10915 useless extension candidates. Maximal degree in co-relation 73500. Up to 2897 conditions per place. [2022-12-11 19:42:28,661 INFO L137 encePairwiseOnDemand]: 115/131 looper letters, 522 selfloop transitions, 114 changer transitions 0/809 dead transitions. [2022-12-11 19:42:28,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 809 transitions, 10085 flow [2022-12-11 19:42:28,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-11 19:42:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-11 19:42:28,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1799 transitions. [2022-12-11 19:42:28,663 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6866412213740458 [2022-12-11 19:42:28,663 INFO L175 Difference]: Start difference. First operand has 330 places, 699 transitions, 6710 flow. Second operand 20 states and 1799 transitions. [2022-12-11 19:42:28,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 809 transitions, 10085 flow [2022-12-11 19:42:29,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 809 transitions, 8638 flow, removed 714 selfloop flow, removed 21 redundant places. [2022-12-11 19:42:29,296 INFO L231 Difference]: Finished difference. Result has 309 places, 603 transitions, 5748 flow [2022-12-11 19:42:29,297 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=4891, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=5748, PETRI_PLACES=309, PETRI_TRANSITIONS=603} [2022-12-11 19:42:29,297 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 192 predicate places. [2022-12-11 19:42:29,297 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 603 transitions, 5748 flow [2022-12-11 19:42:29,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 87.96666666666667) internal successors, (2639), 30 states have internal predecessors, (2639), 0 states have call successors, (0), 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-11 19:42:29,298 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:42:29,298 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:42:29,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-11 19:42:29,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:29,499 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-11 19:42:29,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:42:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash -304636341, now seen corresponding path program 3 times [2022-12-11 19:42:29,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:42:29,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365800951] [2022-12-11 19:42:29,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:42:29,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:42:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:42:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-11 19:42:29,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:42:29,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365800951] [2022-12-11 19:42:29,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365800951] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 19:42:29,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 19:42:29,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-11 19:42:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615066586] [2022-12-11 19:42:29,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 19:42:29,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-11 19:42:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:42:29,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-11 19:42:29,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-11 19:42:29,601 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 131 [2022-12-11 19:42:29,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 603 transitions, 5748 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 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-11 19:42:29,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:42:29,601 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 131 [2022-12-11 19:42:29,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:42:30,639 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([372] L51-->L51-1: Formula: (= (ite (and (< v_~front~0_2 v_~n~0_1) (<= 0 v_~front~0_2)) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) InVars {~n~0=v_~n~0_1, ~front~0=v_~front~0_2} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~n~0=v_~n~0_1, ~front~0=v_~front~0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1][102], [130#true, Black: 3315#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (<= ~n~0 1)), Black: 3323#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0) (<= ~n~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), Black: 3305#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0)), Black: 3325#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 134#(= ~sum~0 0), 3336#(<= |thread2Thread1of1ForFork1_~flag~0#1| (* (div |thread2Thread1of1ForFork1_~flag~0#1| 256) 256)), Black: 2548#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~flag~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 1856#true, Black: 1859#(<= (+ ~front~0 1) ~back~0), Black: 2550#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 2572#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2570#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= (+ ~front~0 1) ~back~0)), Black: 2562#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~front~0 ~back~0)), Black: 2558#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= ~front~0 ~back~0)), Black: 2574#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))), Black: 1858#(<= ~front~0 ~back~0), 1528#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 2554#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2346#(or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0)), Black: 158#(= |thread2Thread1of1ForFork1_~flag~0#1| 1), Black: 2576#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= ~front~0 ~back~0)), 3327#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (< 0 (+ ~back~0 1)) (< 0 ~front~0) (< ~front~0 0))), Black: 2566#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~front~0 ~back~0)), 10#L68true, Black: 1836#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))), Black: 1830#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~flag~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 910#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 0)), Black: 1138#true, Black: 1834#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ 2 ~front~0) ~back~0)), Black: 1838#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ 2 ~front~0) ~back~0) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 2) ~back~0)), Black: 983#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 1446#(= |thread1Thread1of1ForFork0_~cond~0#1| 1), Black: 906#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1842#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))), Black: 948#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 985#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< 1 (+ ~sum~0 ~element~0))) (not (< (+ ~sum~0 ~element~0) 0)) (not (< 1 (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (< (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0) 0))), Black: 1832#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 1840#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~front~0 1) ~back~0) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 2) ~back~0)), 144#true, Black: 1141#(<= (+ ~front~0 1) ~back~0), Black: 175#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~front~0 ~back~0)), Black: 634#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))), Black: 1619#(or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0)), Black: 1023#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 173#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (<= ~front~0 ~back~0)), Black: 944#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1) (= (* ~front~0 4) (* ~back~0 4))), Black: 940#(and (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 904#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))), Black: 926#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~n~0 1)), Black: 995#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< 1 (+ ~sum~0 ~element~0))) (not (< (+ ~sum~0 ~element~0) 0)) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))), Black: 916#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), 192#true, Black: 997#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 946#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)))) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 914#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), Black: 934#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (<= 0 ~front~0) (<= ~front~0 0)) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~front~0) (<= ~front~0 0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~n~0 1)), Black: 954#(and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| |#StackHeapBarrier|)))) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4)))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0)))))) (<= ~n~0 ~front~0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1))))) (<= ~n~0 ~front~0)) (or (and (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (<= ~n~0 ~front~0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0)) (<= ~n~0 1)), Black: 920#(and (<= (+ 2 |ULTIMATE.start_main_#t~ret10#1.base|) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret10#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), Black: 942#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 1019#(and (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (<= 1 ~sum~0)), 2267#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 975#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< 1 (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (< (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0) 0))), Black: 956#(and (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 918#(and (<= (+ 2 |ULTIMATE.start_main_#t~ret10#1.base|) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret10#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), 7#L100-4true, Black: 930#(and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| |#StackHeapBarrier|)))) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (< 0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= ~n~0 1) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0)))))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1009#(and (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 928#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~front~0) (<= ~front~0 0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~n~0 1)), Black: 1027#(and (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (< 1 (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0))) (not (< (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0) 0))), Black: 652#(or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)), Black: 559#(and (not (< ~sum~0 0)) (not (< 1 ~sum~0))), Black: 991#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 912#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))), 3#L51-1true, Black: 1003#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 1039#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 1055#(and (not (< ~sum~0 0)) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (< 1 ~sum~0))), Black: 200#(and (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 1047#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (not (< 1 (+ ~sum~0 ~element~0))) (= ~sum~0 0) (not (< (+ ~sum~0 ~element~0) 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 950#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 960#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)))) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 922#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1))]) [2022-12-11 19:42:30,640 INFO L382 tUnfolder$Statistics]: this new event has 126 ancestors and is cut-off event [2022-12-11 19:42:30,640 INFO L385 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-12-11 19:42:30,640 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-11 19:42:30,640 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-11 19:42:30,641 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([399] L68-->L77: Formula: (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_5| 256) 0) InVars {thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_5|} OutVars{thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_5|} AuxVars[] AssignedVars[][269], [130#true, Black: 3315#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (<= ~n~0 1)), Black: 3323#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0) (<= ~n~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), Black: 3305#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0)), Black: 3325#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 134#(= ~sum~0 0), 3336#(<= |thread2Thread1of1ForFork1_~flag~0#1| (* (div |thread2Thread1of1ForFork1_~flag~0#1| 256) 256)), Black: 2548#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~flag~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 1856#true, Black: 1859#(<= (+ ~front~0 1) ~back~0), Black: 2550#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 2572#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2570#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= (+ ~front~0 1) ~back~0)), Black: 2562#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~front~0 ~back~0)), Black: 2558#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= ~front~0 ~back~0)), Black: 2267#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 2574#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))), Black: 1858#(<= ~front~0 ~back~0), Black: 2554#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= (+ ~front~0 1) ~back~0)), 1619#(or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0)), Black: 158#(= |thread2Thread1of1ForFork1_~flag~0#1| 1), Black: 2576#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= ~front~0 ~back~0)), 3327#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (< 0 (+ ~back~0 1)) (< 0 ~front~0) (< ~front~0 0))), Black: 2566#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~front~0 ~back~0)), 97#L57true, Black: 1836#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))), Black: 1830#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~flag~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 910#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 0)), Black: 1138#true, Black: 1834#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ 2 ~front~0) ~back~0)), Black: 1838#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ 2 ~front~0) ~back~0) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 2) ~back~0)), Black: 983#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 1446#(= |thread1Thread1of1ForFork0_~cond~0#1| 1), Black: 906#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 948#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 1842#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))), Black: 985#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< 1 (+ ~sum~0 ~element~0))) (not (< (+ ~sum~0 ~element~0) 0)) (not (< 1 (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (< (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0) 0))), Black: 1832#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 1840#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~front~0 1) ~back~0) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 2) ~back~0)), 144#true, Black: 1141#(<= (+ ~front~0 1) ~back~0), Black: 175#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~front~0 ~back~0)), Black: 1528#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 634#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))), Black: 1023#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 173#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (<= ~front~0 ~back~0)), Black: 944#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1) (= (* ~front~0 4) (* ~back~0 4))), Black: 940#(and (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 904#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))), Black: 926#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~n~0 1)), Black: 995#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< 1 (+ ~sum~0 ~element~0))) (not (< (+ ~sum~0 ~element~0) 0)) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))), Black: 916#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), 192#true, Black: 997#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 946#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)))) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 914#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), Black: 934#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (<= 0 ~front~0) (<= ~front~0 0)) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~front~0) (<= ~front~0 0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~n~0 1)), Black: 954#(and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| |#StackHeapBarrier|)))) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4)))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0)))))) (<= ~n~0 ~front~0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1))))) (<= ~n~0 ~front~0)) (or (and (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (<= ~n~0 ~front~0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0)) (<= ~n~0 1)), Black: 920#(and (<= (+ 2 |ULTIMATE.start_main_#t~ret10#1.base|) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret10#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), Black: 942#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 1019#(and (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 975#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< 1 (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (< (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0) 0))), Black: 956#(and (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 918#(and (<= (+ 2 |ULTIMATE.start_main_#t~ret10#1.base|) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret10#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), 7#L100-4true, Black: 930#(and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| |#StackHeapBarrier|)))) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (< 0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= ~n~0 1) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0)))))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1009#(and (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 928#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~front~0) (<= ~front~0 0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~n~0 1)), Black: 1027#(and (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (< 1 (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0))) (not (< (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0) 0))), Black: 652#(or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)), Black: 559#(and (not (< ~sum~0 0)) (not (< 1 ~sum~0))), Black: 991#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 912#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))), Black: 1003#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 1039#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), 71#L77true, Black: 1055#(and (not (< ~sum~0 0)) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (< 1 ~sum~0))), Black: 200#(and (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 1047#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (not (< 1 (+ ~sum~0 ~element~0))) (= ~sum~0 0) (not (< (+ ~sum~0 ~element~0) 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 950#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 960#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)))) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 922#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), 2346#(or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))]) [2022-12-11 19:42:30,641 INFO L382 tUnfolder$Statistics]: this new event has 125 ancestors and is cut-off event [2022-12-11 19:42:30,641 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-12-11 19:42:30,642 INFO L385 tUnfolder$Statistics]: existing Event has 111 ancestors and is cut-off event [2022-12-11 19:42:30,642 INFO L385 tUnfolder$Statistics]: existing Event has 125 ancestors and is cut-off event [2022-12-11 19:42:30,642 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([399] L68-->L77: Formula: (= (mod |v_thread2Thread1of1ForFork1_~flag~0#1_5| 256) 0) InVars {thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_5|} OutVars{thread2Thread1of1ForFork1_~flag~0#1=|v_thread2Thread1of1ForFork1_~flag~0#1_5|} AuxVars[] AssignedVars[][267], [130#true, Black: 3315#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0) (<= ~n~0 1)), Black: 3323#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~back~0) (<= ~n~0 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1))), Black: 3305#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~front~0 ~back~0)), Black: 3325#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 134#(= ~sum~0 0), 3336#(<= |thread2Thread1of1ForFork1_~flag~0#1| (* (div |thread2Thread1of1ForFork1_~flag~0#1| 256) 256)), Black: 2548#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~flag~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 1856#true, 2574#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))), Black: 1859#(<= (+ ~front~0 1) ~back~0), Black: 2550#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 2572#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2570#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= (+ ~front~0 1) ~back~0)), Black: 2562#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= ~front~0 ~back~0)), Black: 2558#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= ~front~0 ~back~0)), Black: 2267#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 1858#(<= ~front~0 ~back~0), Black: 2554#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= (+ ~front~0 1) ~back~0)), Black: 2346#(or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0)), Black: 158#(= |thread2Thread1of1ForFork1_~flag~0#1| 1), Black: 2576#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 1) ~back~0) (<= ~front~0 ~back~0)), 3327#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (< 0 (+ ~back~0 1)) (< 0 ~front~0) (< ~front~0 0))), Black: 2566#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (<= ~front~0 ~back~0)), Black: 1836#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))), Black: 1830#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~flag~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 910#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 0)), Black: 1138#true, Black: 1834#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ 2 ~front~0) ~back~0)), Black: 1838#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ 2 ~front~0) ~back~0) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 2) ~back~0)), Black: 983#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 1446#(= |thread1Thread1of1ForFork0_~cond~0#1| 1), Black: 906#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 948#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 985#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< 1 (+ ~sum~0 ~element~0))) (not (< (+ ~sum~0 ~element~0) 0)) (not (< 1 (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (< (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0) 0))), Black: 1832#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~front~0 1) ~back~0)), Black: 1840#(and (= |thread1Thread1of1ForFork0_~cond~0#1| 1) (<= (+ ~front~0 1) ~back~0) (<= (+ |thread1Thread1of1ForFork0_#t~post2#1| 2) ~back~0)), 144#true, Black: 1141#(<= (+ ~front~0 1) ~back~0), Black: 1528#(not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)), Black: 175#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~front~0 ~back~0)), Black: 634#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))), Black: 1619#(or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0)), Black: 1023#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 173#(and (<= (+ ~front~0 ~n~0) (+ ~back~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (<= ~front~0 ~back~0)), Black: 944#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1) (= (* ~front~0 4) (* ~back~0 4))), Black: 940#(and (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 904#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))), Black: 926#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~n~0 1)), Black: 995#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< 1 (+ ~sum~0 ~element~0))) (not (< (+ ~sum~0 ~element~0) 0)) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))), Black: 916#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), 192#true, Black: 997#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 946#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)))) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 914#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), Black: 934#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (<= 0 ~front~0) (<= ~front~0 0)) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~front~0) (<= ~front~0 0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~n~0 1)), Black: 954#(and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| |#StackHeapBarrier|)))) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4)))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0)))))) (<= ~n~0 ~front~0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1))))) (<= ~n~0 ~front~0)) (or (and (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (<= ~n~0 ~front~0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0)) (<= ~n~0 1)), 1842#(and (not (<= (mod |thread1Thread1of1ForFork0_~cond~0#1| 256) 0)) (or (= (mod |thread2Thread1of1ForFork1_~flag~0#1| 256) 0) (<= ~front~0 ~back~0))), Black: 920#(and (<= (+ 2 |ULTIMATE.start_main_#t~ret10#1.base|) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret10#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), Black: 942#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 1019#(and (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 975#(and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< 1 (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (< (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0) 0))), Black: 956#(and (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 918#(and (<= (+ 2 |ULTIMATE.start_main_#t~ret10#1.base|) |ULTIMATE.start_main_~#t2~0#1.base|) (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_main_#t~ret10#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1)), 7#L100-4true, Black: 930#(and (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6|) 0)) (not (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc17#1.base_6| |#StackHeapBarrier|)))) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (< 0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_main_#t~ret10#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_main_#t~ret10#1.offset|)) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 0)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (< (+ |ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (and (<= ~sum~0 0) (not (< (+ ~sum~0 1) 0)) (= (* ~front~0 4) (* ~back~0 4))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= ~n~0 1) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (< 1 (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~sum~0)))))) (<= ~n~0 ~front~0) (< ~front~0 0))), Black: 1009#(and (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 928#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~front~0) (<= ~front~0 0))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= ~n~0 1)), Black: 1027#(and (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (< 1 (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0))) (not (< (+ |thread1Thread1of1ForFork0_#t~mem1#1| ~sum~0) 0))), 8#L51true, Black: 652#(or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)), Black: 559#(and (not (< ~sum~0 0)) (not (< 1 ~sum~0))), Black: 991#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 912#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~back~0 ~front~0) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|))), Black: 1003#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (= ~element~0 1)), Black: 1039#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), 71#L77true, Black: 1055#(and (not (< ~sum~0 0)) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (not (< 1 ~sum~0))), Black: 200#(and (<= ~sum~0 1) (<= 1 ~sum~0)), Black: 1047#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (not (< 1 (+ ~sum~0 ~element~0))) (= ~sum~0 0) (not (< (+ ~sum~0 ~element~0) 0)) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1)), Black: 950#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| 1) (or (and (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))) (forall ((v_ArrVal_89 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (or (not (< 1 (+ ~sum~0 (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_89) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_90) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))))) (<= ~n~0 ~front~0)) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0)) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= 0 ~front~0) (= ~element~0 1) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (<= ~front~0 0) (<= ~n~0 1)), Black: 960#(and (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0)))) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (<= ~n~0 ~front~0) (< ~front~0 0)) (or (and (not (< 1 (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))))) (not (< (+ ~sum~0 (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 0))) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))), Black: 922#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ 2 ~queue~0.base) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~back~0 ~front~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#res#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~sum~0 0) (= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= ~queue~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 1))]) [2022-12-11 19:42:30,642 INFO L382 tUnfolder$Statistics]: this new event has 126 ancestors and is cut-off event [2022-12-11 19:42:30,642 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-11 19:42:30,642 INFO L385 tUnfolder$Statistics]: existing Event has 112 ancestors and is cut-off event [2022-12-11 19:42:30,642 INFO L385 tUnfolder$Statistics]: existing Event has 126 ancestors and is cut-off event [2022-12-11 19:42:31,258 INFO L130 PetriNetUnfolder]: 2090/8882 cut-off events. [2022-12-11 19:42:31,259 INFO L131 PetriNetUnfolder]: For 115626/116702 co-relation queries the response was YES. [2022-12-11 19:42:31,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41690 conditions, 8882 events. 2090/8882 cut-off events. For 115626/116702 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 96989 event pairs, 496 based on Foata normal form. 794/9040 useless extension candidates. Maximal degree in co-relation 41608. Up to 1770 conditions per place. [2022-12-11 19:42:31,343 INFO L137 encePairwiseOnDemand]: 127/131 looper letters, 170 selfloop transitions, 18 changer transitions 0/470 dead transitions. [2022-12-11 19:42:31,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 470 transitions, 4809 flow [2022-12-11 19:42:31,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-11 19:42:31,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-11 19:42:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2022-12-11 19:42:31,344 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8759541984732825 [2022-12-11 19:42:31,344 INFO L175 Difference]: Start difference. First operand has 309 places, 603 transitions, 5748 flow. Second operand 4 states and 459 transitions. [2022-12-11 19:42:31,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 470 transitions, 4809 flow [2022-12-11 19:42:31,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 470 transitions, 4575 flow, removed 69 selfloop flow, removed 27 redundant places. [2022-12-11 19:42:31,513 INFO L231 Difference]: Finished difference. Result has 267 places, 466 transitions, 4244 flow [2022-12-11 19:42:31,513 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=4147, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4244, PETRI_PLACES=267, PETRI_TRANSITIONS=466} [2022-12-11 19:42:31,514 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 150 predicate places. [2022-12-11 19:42:31,514 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 466 transitions, 4244 flow [2022-12-11 19:42:31,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 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-11 19:42:31,514 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:42:31,515 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:42:31,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-11 19:42:31,516 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-11 19:42:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:42:31,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1371550564, now seen corresponding path program 3 times [2022-12-11 19:42:31,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:42:31,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009938368] [2022-12-11 19:42:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:42:31,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:42:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:42:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:42:31,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:42:31,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009938368] [2022-12-11 19:42:31,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009938368] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:42:31,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852586836] [2022-12-11 19:42:31,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 19:42:31,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:31,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:42:31,779 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-11 19:42:31,781 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-11 19:42:31,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-11 19:42:31,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:42:31,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-11 19:42:31,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:42:32,044 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-11 19:42:32,101 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:42:32,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:42:32,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:42:32,240 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 30 [2022-12-11 19:42:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:42:32,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852586836] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:42:32,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:42:32,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 18 [2022-12-11 19:42:32,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202548018] [2022-12-11 19:42:32,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:42:32,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 19:42:32,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:42:32,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 19:42:32,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-12-11 19:42:32,484 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 131 [2022-12-11 19:42:32,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 466 transitions, 4244 flow. Second operand has 18 states, 18 states have (on average 76.27777777777777) internal successors, (1373), 18 states have internal predecessors, (1373), 0 states have call successors, (0), 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-11 19:42:32,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:42:32,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 131 [2022-12-11 19:42:32,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:42:38,006 INFO L130 PetriNetUnfolder]: 10964/28986 cut-off events. [2022-12-11 19:42:38,007 INFO L131 PetriNetUnfolder]: For 265099/266051 co-relation queries the response was YES. [2022-12-11 19:42:38,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129890 conditions, 28986 events. 10964/28986 cut-off events. For 265099/266051 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 322260 event pairs, 1120 based on Foata normal form. 465/27846 useless extension candidates. Maximal degree in co-relation 129819. Up to 8796 conditions per place. [2022-12-11 19:42:38,414 INFO L137 encePairwiseOnDemand]: 117/131 looper letters, 457 selfloop transitions, 68 changer transitions 4/646 dead transitions. [2022-12-11 19:42:38,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 646 transitions, 7396 flow [2022-12-11 19:42:38,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-11 19:42:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-11 19:42:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1106 transitions. [2022-12-11 19:42:38,416 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6030534351145038 [2022-12-11 19:42:38,417 INFO L175 Difference]: Start difference. First operand has 267 places, 466 transitions, 4244 flow. Second operand 14 states and 1106 transitions. [2022-12-11 19:42:38,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 646 transitions, 7396 flow [2022-12-11 19:42:38,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 646 transitions, 7375 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-11 19:42:38,929 INFO L231 Difference]: Finished difference. Result has 285 places, 474 transitions, 4466 flow [2022-12-11 19:42:38,930 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=4223, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=466, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4466, PETRI_PLACES=285, PETRI_TRANSITIONS=474} [2022-12-11 19:42:38,930 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 168 predicate places. [2022-12-11 19:42:38,930 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 474 transitions, 4466 flow [2022-12-11 19:42:38,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 76.27777777777777) internal successors, (1373), 18 states have internal predecessors, (1373), 0 states have call successors, (0), 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-11 19:42:38,931 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:42:38,931 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:42:38,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-11 19:42:39,134 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,SelfDestructingSolverStorable11 [2022-12-11 19:42:39,135 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-11 19:42:39,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:42:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1598212146, now seen corresponding path program 4 times [2022-12-11 19:42:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:42:39,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171388744] [2022-12-11 19:42:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:42:39,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:42:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:42:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:39,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:42:39,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171388744] [2022-12-11 19:42:39,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171388744] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:42:39,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900484735] [2022-12-11 19:42:39,265 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 19:42:39,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:39,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:42:39,266 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-11 19:42:39,268 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-11 19:42:39,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 19:42:39,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:42:39,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-11 19:42:39,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:42:39,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:39,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:42:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 19:42:39,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900484735] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:42:39,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:42:39,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 15] total 29 [2022-12-11 19:42:39,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847597317] [2022-12-11 19:42:39,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:42:39,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-11 19:42:39,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:42:39,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-11 19:42:39,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-12-11 19:42:39,868 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 131 [2022-12-11 19:42:39,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 474 transitions, 4466 flow. Second operand has 29 states, 29 states have (on average 85.72413793103448) internal successors, (2486), 29 states have internal predecessors, (2486), 0 states have call successors, (0), 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-11 19:42:39,937 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:42:39,937 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 131 [2022-12-11 19:42:39,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:42:43,853 INFO L130 PetriNetUnfolder]: 4707/15373 cut-off events. [2022-12-11 19:42:43,854 INFO L131 PetriNetUnfolder]: For 157090/157385 co-relation queries the response was YES. [2022-12-11 19:42:43,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74353 conditions, 15373 events. 4707/15373 cut-off events. For 157090/157385 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 163840 event pairs, 1919 based on Foata normal form. 49/14516 useless extension candidates. Maximal degree in co-relation 74276. Up to 7459 conditions per place. [2022-12-11 19:42:44,040 INFO L137 encePairwiseOnDemand]: 108/131 looper letters, 341 selfloop transitions, 73 changer transitions 32/574 dead transitions. [2022-12-11 19:42:44,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 574 transitions, 6250 flow [2022-12-11 19:42:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-11 19:42:44,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-11 19:42:44,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2411 transitions. [2022-12-11 19:42:44,043 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6573064340239912 [2022-12-11 19:42:44,043 INFO L175 Difference]: Start difference. First operand has 285 places, 474 transitions, 4466 flow. Second operand 28 states and 2411 transitions. [2022-12-11 19:42:44,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 574 transitions, 6250 flow [2022-12-11 19:42:44,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 574 transitions, 6166 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-12-11 19:42:44,314 INFO L231 Difference]: Finished difference. Result has 308 places, 489 transitions, 4954 flow [2022-12-11 19:42:44,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=4277, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=465, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4954, PETRI_PLACES=308, PETRI_TRANSITIONS=489} [2022-12-11 19:42:44,315 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 191 predicate places. [2022-12-11 19:42:44,315 INFO L495 AbstractCegarLoop]: Abstraction has has 308 places, 489 transitions, 4954 flow [2022-12-11 19:42:44,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 85.72413793103448) internal successors, (2486), 29 states have internal predecessors, (2486), 0 states have call successors, (0), 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-11 19:42:44,316 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:42:44,316 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:42:44,321 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-11 19:42:44,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:44,517 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-11 19:42:44,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:42:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash -672181065, now seen corresponding path program 4 times [2022-12-11 19:42:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:42:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351586428] [2022-12-11 19:42:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:42:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:42:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:42:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:42:46,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:42:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351586428] [2022-12-11 19:42:46,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351586428] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:42:46,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147333260] [2022-12-11 19:42:46,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 19:42:46,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:42:46,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:42:46,159 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-11 19:42:46,160 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-11 19:42:46,226 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 19:42:46,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:42:46,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-11 19:42:46,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:42:46,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:42:46,754 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 49 treesize of output 15 [2022-12-11 19:42:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:42:46,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:42:47,290 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:42:47,291 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 77 treesize of output 78 [2022-12-11 19:42:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:42:47,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147333260] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:42:47,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:42:47,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 16, 16] total 54 [2022-12-11 19:42:47,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383644879] [2022-12-11 19:42:47,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:42:47,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-11 19:42:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:42:47,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-11 19:42:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2587, Unknown=0, NotChecked=0, Total=2862 [2022-12-11 19:42:47,579 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 131 [2022-12-11 19:42:47,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 489 transitions, 4954 flow. Second operand has 54 states, 54 states have (on average 58.7037037037037) internal successors, (3170), 54 states have internal predecessors, (3170), 0 states have call successors, (0), 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-11 19:42:47,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:42:47,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 131 [2022-12-11 19:42:47,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:43:04,003 INFO L130 PetriNetUnfolder]: 22688/54109 cut-off events. [2022-12-11 19:43:04,003 INFO L131 PetriNetUnfolder]: For 580051/580847 co-relation queries the response was YES. [2022-12-11 19:43:04,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262822 conditions, 54109 events. 22688/54109 cut-off events. For 580051/580847 co-relation queries the response was YES. Maximal size of possible extension queue 1635. Compared 633436 event pairs, 2207 based on Foata normal form. 287/51996 useless extension candidates. Maximal degree in co-relation 262739. Up to 9082 conditions per place. [2022-12-11 19:43:04,958 INFO L137 encePairwiseOnDemand]: 100/131 looper letters, 1085 selfloop transitions, 484 changer transitions 19/1662 dead transitions. [2022-12-11 19:43:04,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1662 transitions, 22230 flow [2022-12-11 19:43:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-12-11 19:43:04,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2022-12-11 19:43:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 6320 transitions. [2022-12-11 19:43:04,981 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45946928389676484 [2022-12-11 19:43:04,981 INFO L175 Difference]: Start difference. First operand has 308 places, 489 transitions, 4954 flow. Second operand 105 states and 6320 transitions. [2022-12-11 19:43:04,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1662 transitions, 22230 flow [2022-12-11 19:43:07,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 1662 transitions, 20979 flow, removed 614 selfloop flow, removed 25 redundant places. [2022-12-11 19:43:07,128 INFO L231 Difference]: Finished difference. Result has 416 places, 936 transitions, 12681 flow [2022-12-11 19:43:07,129 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=4815, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=489, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=12681, PETRI_PLACES=416, PETRI_TRANSITIONS=936} [2022-12-11 19:43:07,129 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 299 predicate places. [2022-12-11 19:43:07,129 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 936 transitions, 12681 flow [2022-12-11 19:43:07,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 58.7037037037037) internal successors, (3170), 54 states have internal predecessors, (3170), 0 states have call successors, (0), 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-11 19:43:07,130 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:43:07,131 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:43:07,140 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-11 19:43:07,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:43:07,335 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-11 19:43:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:43:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1913183607, now seen corresponding path program 5 times [2022-12-11 19:43:07,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:43:07,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256743519] [2022-12-11 19:43:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:43:07,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:43:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:43:07,568 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:43:07,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:43:07,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256743519] [2022-12-11 19:43:07,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256743519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:43:07,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206093925] [2022-12-11 19:43:07,568 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 19:43:07,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:43:07,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:43:07,570 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-11 19:43:07,571 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-11 19:43:07,633 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 19:43:07,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:43:07,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-11 19:43:07,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:43:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:43:07,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:43:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-11 19:43:07,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206093925] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:43:07,852 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:43:07,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 18 [2022-12-11 19:43:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277786058] [2022-12-11 19:43:07,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:43:07,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-11 19:43:07,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:43:07,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-11 19:43:07,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-12-11 19:43:07,854 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 131 [2022-12-11 19:43:07,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 936 transitions, 12681 flow. Second operand has 18 states, 18 states have (on average 101.33333333333333) internal successors, (1824), 18 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11 19:43:07,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:43:07,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 131 [2022-12-11 19:43:07,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:43:19,301 INFO L130 PetriNetUnfolder]: 11856/34945 cut-off events. [2022-12-11 19:43:19,302 INFO L131 PetriNetUnfolder]: For 674537/675121 co-relation queries the response was YES. [2022-12-11 19:43:19,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207826 conditions, 34945 events. 11856/34945 cut-off events. For 674537/675121 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 403348 event pairs, 1568 based on Foata normal form. 450/33801 useless extension candidates. Maximal degree in co-relation 207702. Up to 5006 conditions per place. [2022-12-11 19:43:20,031 INFO L137 encePairwiseOnDemand]: 119/131 looper letters, 644 selfloop transitions, 927 changer transitions 30/1780 dead transitions. [2022-12-11 19:43:20,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 1780 transitions, 29427 flow [2022-12-11 19:43:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-11 19:43:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-12-11 19:43:20,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4156 transitions. [2022-12-11 19:43:20,035 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7931297709923664 [2022-12-11 19:43:20,035 INFO L175 Difference]: Start difference. First operand has 416 places, 936 transitions, 12681 flow. Second operand 40 states and 4156 transitions. [2022-12-11 19:43:20,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 1780 transitions, 29427 flow [2022-12-11 19:43:23,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 1780 transitions, 25820 flow, removed 1628 selfloop flow, removed 24 redundant places. [2022-12-11 19:43:23,056 INFO L231 Difference]: Finished difference. Result has 451 places, 1350 transitions, 20974 flow [2022-12-11 19:43:23,057 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=131, PETRI_DIFFERENCE_MINUEND_FLOW=10134, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=461, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=20974, PETRI_PLACES=451, PETRI_TRANSITIONS=1350} [2022-12-11 19:43:23,057 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 334 predicate places. [2022-12-11 19:43:23,057 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 1350 transitions, 20974 flow [2022-12-11 19:43:23,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 101.33333333333333) internal successors, (1824), 18 states have internal predecessors, (1824), 0 states have call successors, (0), 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-11 19:43:23,058 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 19:43:23,058 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-11 19:43:23,065 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-11 19:43:23,258 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,SelfDestructingSolverStorable14 [2022-12-11 19:43:23,258 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-11 19:43:23,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 19:43:23,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1208985741, now seen corresponding path program 6 times [2022-12-11 19:43:23,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 19:43:23,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338209555] [2022-12-11 19:43:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 19:43:23,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 19:43:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 19:43:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-11 19:43:23,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 19:43:23,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338209555] [2022-12-11 19:43:23,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338209555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 19:43:23,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809523922] [2022-12-11 19:43:23,754 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 19:43:23,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 19:43:23,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 19:43:23,756 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-11 19:43:23,758 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-11 19:43:23,875 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-11 19:43:23,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 19:43:23,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-11 19:43:23,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 19:43:24,367 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 15 treesize of output 11 [2022-12-11 19:43:24,611 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-11 19:43:24,668 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-11 19:43:25,844 INFO L321 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2022-12-11 19:43:25,845 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 48 treesize of output 21 [2022-12-11 19:43:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:43:25,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 19:43:29,626 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:43:29,626 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 1 case distinctions, treesize of input 123 treesize of output 87 [2022-12-11 19:43:29,661 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-11 19:43:29,661 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 267 treesize of output 286 [2022-12-11 19:43:29,694 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-11 19:43:29,694 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 234 treesize of output 236 [2022-12-11 19:43:29,737 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-12-11 19:43:29,738 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 184 treesize of output 211 [2022-12-11 19:43:31,975 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 19:43:31,976 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 1 case distinctions, treesize of input 123 treesize of output 87 [2022-12-11 19:43:32,006 INFO L321 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2022-12-11 19:43:32,006 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 563 treesize of output 505 [2022-12-11 19:43:32,036 INFO L321 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2022-12-11 19:43:32,036 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 497 treesize of output 455 [2022-12-11 19:43:32,073 INFO L321 Elim1Store]: treesize reduction 56, result has 13.8 percent of original size [2022-12-11 19:43:32,073 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 447 treesize of output 355 [2022-12-11 19:43:33,285 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 19:43:33,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809523922] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 19:43:33,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 19:43:33,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 37, 34] total 79 [2022-12-11 19:43:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322368520] [2022-12-11 19:43:33,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 19:43:33,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-12-11 19:43:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 19:43:33,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-12-11 19:43:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=5551, Unknown=54, NotChecked=0, Total=6162 [2022-12-11 19:43:33,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 131 [2022-12-11 19:43:33,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 1350 transitions, 20974 flow. Second operand has 79 states, 79 states have (on average 46.949367088607595) internal successors, (3709), 79 states have internal predecessors, (3709), 0 states have call successors, (0), 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-11 19:43:33,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 19:43:33,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 131 [2022-12-11 19:43:33,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 19:43:33,437 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse21 (* c_~front~0 4))) (let ((.cse8 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse21)) (.cse20 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse20)) (.cse24 (select .cse8 .cse2)) (.cse3 (+ c_~front~0 1))) (let ((.cse4 (+ c_~queue~0.offset .cse20 4)) (.cse9 (and (forall ((v_~front~0_25 Int)) (or (not (< 1 (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) .cse24))) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (not (< (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) .cse24) 0)) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))))) (.cse6 (<= c_~n~0 c_~back~0)) (.cse12 (let ((.cse37 (< c_~n~0 (+ 2 c_~front~0)))) (and (or .cse37 (< c_~n~0 (+ c_~back~0 3))) (or .cse37 (<= c_~sum~0 1)) (< c_~back~0 .cse3) (or .cse37 (<= 0 c_~sum~0))))) (.cse7 (< c_~back~0 0)) (.cse10 (not (= (+ (select .cse8 .cse1) 1) 0))) (.cse22 (<= c_~n~0 c_~front~0)) (.cse25 (< c_~front~0 0))) (and (or (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 (+ (* v_~front~0_25 4) c_~queue~0.offset))))) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse0 .cse4) 1) 0))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~queue~0.base))) (or (not (= (select .cse5 .cse1) 1)) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 (+ (* v_~front~0_25 4) c_~queue~0.offset))) 0)) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse5 .cse4) 1) 0)))))) .cse6 .cse7) (or (not (= (+ (select .cse8 .cse4) 1) 0)) .cse9) (or .cse10 (let ((.cse11 (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1))) (and (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (not (<= .cse11 v_~front~0_25)) (< v_~front~0_25 0) (not (< 1 (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) c_~element~0))))) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (not (<= .cse11 v_~front~0_25)) (< v_~front~0_25 0) (not (< (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) c_~element~0) 0))))))) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 2) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse12 .cse7) (or (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~queue~0.base))) (or (not (= (+ (select .cse13 .cse4) 1) 0)) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (not (< (+ c_~sum~0 (select .cse13 (+ (* v_~front~0_25 4) c_~queue~0.offset)) (select .cse13 .cse2)) 0)) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (not (= (select .cse13 .cse1) 1))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~queue~0.base))) (or (not (= (+ (select .cse14 .cse4) 1) 0)) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ c_~sum~0 (select .cse14 (+ (* v_~front~0_25 4) c_~queue~0.offset)) (select .cse14 .cse2)))) (< v_~front~0_25 .cse3))) (not (= (select .cse14 .cse1) 1)))))) .cse6 .cse7) (or .cse6 (let ((.cse16 (+ .cse21 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse17 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse20 4)) (.cse18 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse20))) (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (forall ((v_~front~0_25 Int)) (or (not (< (+ (select .cse15 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|)) c_~sum~0 (select .cse15 .cse16)) 0)) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse15 .cse17) 1) 0)) (not (= (select .cse15 .cse18) 1))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ (select .cse19 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|)) c_~sum~0 (select .cse19 .cse16)))) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse19 .cse17) 1) 0)) (not (= (select .cse19 .cse18) 1))))))) .cse7) (or .cse22 (let ((.cse23 (+ c_~sum~0 .cse24 c_~element~0))) (and (not (< .cse23 0)) (not (< 1 .cse23)))) .cse25) (or .cse6 (let ((.cse28 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse29 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse27 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (forall ((v_~front~0_25 Int)) (or (not (< 1 (+ (select .cse26 .cse27) c_~sum~0 (select .cse26 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse26 .cse28) 1) 0)) (not (= (select .cse26 .cse29) 1))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (+ (select .cse30 .cse28) 1) 0)) (not (= (select .cse30 .cse29) 1)) (forall ((v_~front~0_25 Int)) (or (not (< (+ (select .cse30 .cse27) c_~sum~0 (select .cse30 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 0)) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3)))))))) .cse7) (or .cse6 .cse12 .cse7 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (let ((.cse32 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse33 (+ .cse20 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse34 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse31 .cse32) 1)) (not (= 0 (+ (select .cse31 .cse33) 1))) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ c_~sum~0 (select .cse31 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse31 .cse34)))) (< v_~front~0_25 .cse3)))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse35 .cse32) 1)) (not (= 0 (+ (select .cse35 .cse33) 1))) (forall ((v_~front~0_25 Int)) (or (not (< (+ c_~sum~0 (select .cse35 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse35 .cse34)) 0)) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3)))))))) .cse6 .cse7) (or .cse10 .cse9) (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse12 .cse7) (or .cse6 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12 .cse7) (or (and (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) c_~element~0))) (< v_~front~0_25 .cse3))) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3) (not (< (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) c_~element~0) 0))))) .cse10) (= c_~sum~0 0) (or (and (forall ((v_~front~0_25 Int)) (or (not (< (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|) 0)) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3) (not (< 1 (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) .cse10) (or .cse22 .cse25 (let ((.cse36 (+ c_~sum~0 .cse24))) (and (not (< .cse36 0)) (not (< 1 .cse36)))))))))) is different from false [2022-12-11 19:43:56,800 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse19 (* c_~front~0 4))) (let ((.cse8 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (+ c_~queue~0.offset .cse19)) (.cse3 (+ c_~front~0 1)) (.cse18 (* c_~back~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse18)) (.cse35 (<= c_~sum~0 1)) (.cse37 (< c_~back~0 .cse3)) (.cse36 (<= 0 c_~sum~0)) (.cse21 (select .cse8 .cse2))) (let ((.cse4 (+ c_~queue~0.offset .cse18 4)) (.cse9 (and (forall ((v_~front~0_25 Int)) (or (not (< 1 (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) .cse21))) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (not (< (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) .cse21) 0)) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))))) (.cse6 (<= c_~n~0 c_~back~0)) (.cse10 (let ((.cse38 (< c_~n~0 (+ 2 c_~front~0)))) (and (or .cse38 (< c_~n~0 (+ c_~back~0 3))) (or .cse38 .cse35) .cse37 (or .cse38 .cse36)))) (.cse7 (< c_~back~0 0)) (.cse32 (not (= (+ (select .cse8 .cse1) 1) 0)))) (and (or (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ c_~sum~0 (select .cse0 .cse2) (select .cse0 (+ (* v_~front~0_25 4) c_~queue~0.offset))))) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse0 .cse4) 1) 0))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~queue~0.base))) (or (not (= (select .cse5 .cse1) 1)) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< (+ c_~sum~0 (select .cse5 .cse2) (select .cse5 (+ (* v_~front~0_25 4) c_~queue~0.offset))) 0)) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse5 .cse4) 1) 0)))))) .cse6 .cse7) (or (not (= (+ (select .cse8 .cse4) 1) 0)) .cse9) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 2) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6 .cse10 .cse7) (or (and (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~queue~0.base))) (or (not (= (+ (select .cse11 .cse4) 1) 0)) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (not (< (+ c_~sum~0 (select .cse11 (+ (* v_~front~0_25 4) c_~queue~0.offset)) (select .cse11 .cse2)) 0)) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (not (= (select .cse11 .cse1) 1))))) (forall ((v_ArrVal_316 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) c_~queue~0.base))) (or (not (= (+ (select .cse12 .cse4) 1) 0)) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ c_~sum~0 (select .cse12 (+ (* v_~front~0_25 4) c_~queue~0.offset)) (select .cse12 .cse2)))) (< v_~front~0_25 .cse3))) (not (= (select .cse12 .cse1) 1)))))) .cse6 .cse7) (not (< 1 c_~sum~0)) (or .cse6 (let ((.cse14 (+ .cse19 |c_ULTIMATE.start_main_#t~ret10#1.offset|)) (.cse15 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse18 4)) (.cse16 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse18))) (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (forall ((v_~front~0_25 Int)) (or (not (< (+ (select .cse13 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|)) c_~sum~0 (select .cse13 .cse14)) 0)) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse13 .cse15) 1) 0)) (not (= (select .cse13 .cse16) 1))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ (select .cse17 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_main_#t~ret10#1.offset|)) c_~sum~0 (select .cse17 .cse14)))) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse17 .cse15) 1) 0)) (not (= (select .cse17 .cse16) 1))))))) .cse7) (or (<= c_~n~0 c_~front~0) (let ((.cse20 (+ c_~sum~0 .cse21 c_~element~0))) (and (not (< .cse20 0)) (not (< 1 .cse20)))) (< c_~front~0 0)) (or .cse6 (let ((.cse24 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse25 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse23 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (forall ((v_~front~0_25 Int)) (or (not (< 1 (+ (select .cse22 .cse23) c_~sum~0 (select .cse22 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))))) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (not (= (+ (select .cse22 .cse24) 1) 0)) (not (= (select .cse22 .cse25) 1))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (+ (select .cse26 .cse24) 1) 0)) (not (= (select .cse26 .cse25) 1)) (forall ((v_~front~0_25 Int)) (or (not (< (+ (select .cse26 .cse23) c_~sum~0 (select .cse26 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) 0)) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3)))))))) .cse7) (not (< c_~sum~0 0)) (or .cse6 .cse10 .cse7 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (let ((.cse28 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (+ .cse18 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse30 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse27 .cse28) 1)) (not (= 0 (+ (select .cse27 .cse29) 1))) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ c_~sum~0 (select .cse27 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse27 .cse30)))) (< v_~front~0_25 .cse3)))))) (forall ((v_ArrVal_315 (Array Int Int)) (v_ArrVal_316 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_315) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse31 .cse28) 1)) (not (= 0 (+ (select .cse31 .cse29) 1))) (forall ((v_~front~0_25 Int)) (or (not (< (+ c_~sum~0 (select .cse31 (+ (* v_~front~0_25 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse31 .cse30)) 0)) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3)))))))) .cse6 .cse7) (or .cse32 .cse9) (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse6 .cse10 .cse7) (or .cse6 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10 .cse7) (or (let ((.cse33 (< 0 c_~front~0)) (.cse34 (< 1 c_~back~0))) (and (or .cse33 .cse34 .cse35) (or .cse33 .cse34 .cse36) (or .cse37 .cse34))) .cse7) (or (and (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (not (< 1 (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) c_~element~0))) (< v_~front~0_25 .cse3))) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3) (not (< (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) c_~element~0) 0))))) .cse32) (or (and (forall ((v_~front~0_25 Int)) (or (not (< (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|) 0)) (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3))) (forall ((v_~front~0_25 Int)) (or (<= c_~n~0 v_~front~0_25) (< v_~front~0_25 0) (< v_~front~0_25 .cse3) (not (< 1 (+ c_~sum~0 (select .cse8 (+ (* v_~front~0_25 4) c_~queue~0.offset)) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) .cse32)))))) is different from false [2022-12-11 19:44:32,821 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-11 19:44:34,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]