/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-9868fc6-m [2022-11-14 19:04:21,706 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-14 19:04:21,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-14 19:04:21,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-14 19:04:21,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-14 19:04:21,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-14 19:04:21,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-14 19:04:21,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-14 19:04:21,748 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-14 19:04:21,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-14 19:04:21,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-14 19:04:21,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-14 19:04:21,754 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-14 19:04:21,755 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-14 19:04:21,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-14 19:04:21,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-14 19:04:21,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-14 19:04:21,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-14 19:04:21,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-14 19:04:21,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-14 19:04:21,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-14 19:04:21,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-14 19:04:21,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-14 19:04:21,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-14 19:04:21,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-14 19:04:21,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-14 19:04:21,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-14 19:04:21,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-14 19:04:21,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-14 19:04:21,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-14 19:04:21,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-14 19:04:21,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-14 19:04:21,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-14 19:04:21,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-14 19:04:21,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-14 19:04:21,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-14 19:04:21,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-14 19:04:21,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-14 19:04:21,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-14 19:04:21,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-14 19:04:21,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-14 19:04:21,779 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-14 19:04:21,801 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-14 19:04:21,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-14 19:04:21,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-14 19:04:21,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-14 19:04:21,802 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-14 19:04:21,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-14 19:04:21,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-14 19:04:21,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-14 19:04:21,802 INFO L138 SettingsManager]: * Use SBE=true [2022-11-14 19:04:21,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-14 19:04:21,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-14 19:04:21,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-14 19:04:21,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-14 19:04:21,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-14 19:04:21,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-14 19:04:21,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-14 19:04:21,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-14 19:04:21,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-14 19:04:21,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-14 19:04:21,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-14 19:04:21,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-14 19:04:21,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-14 19:04:21,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-14 19:04:21,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-14 19:04:21,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-14 19:04:21,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:04:21,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-14 19:04:21,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-14 19:04:21,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-14 19:04:21,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-14 19:04:21,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-14 19:04:21,806 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-14 19:04:21,806 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-14 19:04:21,806 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-14 19:04:21,806 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-14 19:04:21,806 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-14 19:04:21,806 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-11-14 19:04:21,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-14 19:04:21,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-14 19:04:21,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-14 19:04:21,972 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-14 19:04:21,972 INFO L275 PluginConnector]: CDTParser initialized [2022-11-14 19:04:21,973 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-11-14 19:04:22,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632b4b137/d0a6f7a376c84089838939983be0c107/FLAGfaf293ea6 [2022-11-14 19:04:22,462 INFO L306 CDTParser]: Found 1 translation units. [2022-11-14 19:04:22,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2022-11-14 19:04:22,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632b4b137/d0a6f7a376c84089838939983be0c107/FLAGfaf293ea6 [2022-11-14 19:04:22,498 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/632b4b137/d0a6f7a376c84089838939983be0c107 [2022-11-14 19:04:22,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-14 19:04:22,502 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-14 19:04:22,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-14 19:04:22,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-14 19:04:22,506 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-14 19:04:22,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:04:22" (1/1) ... [2022-11-14 19:04:22,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7246b8fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:22, skipping insertion in model container [2022-11-14 19:04:22,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:04:22" (1/1) ... [2022-11-14 19:04:22,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-14 19:04:22,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-14 19:04:22,948 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-11-14 19:04:22,953 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-11-14 19:04:22,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:04:22,966 INFO L203 MainTranslator]: Completed pre-run [2022-11-14 19:04:23,013 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43272,43285] [2022-11-14 19:04:23,016 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i[43545,43558] [2022-11-14 19:04:23,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:04:23,068 INFO L208 MainTranslator]: Completed translation [2022-11-14 19:04:23,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23 WrapperNode [2022-11-14 19:04:23,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-14 19:04:23,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-14 19:04:23,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-14 19:04:23,069 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-14 19:04:23,074 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,127 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-11-14 19:04:23,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-14 19:04:23,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-14 19:04:23,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-14 19:04:23,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-14 19:04:23,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,168 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-14 19:04:23,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-14 19:04:23,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-14 19:04:23,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-14 19:04:23,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (1/1) ... [2022-11-14 19:04:23,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:04:23,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:23,197 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-11-14 19:04:23,226 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-11-14 19:04:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-14 19:04:23,245 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-14 19:04:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-14 19:04:23,245 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-14 19:04:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-14 19:04:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-14 19:04:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-14 19:04:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-14 19:04:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-14 19:04:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-14 19:04:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-14 19:04:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-14 19:04:23,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-14 19:04:23,246 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-14 19:04:23,396 INFO L235 CfgBuilder]: Building ICFG [2022-11-14 19:04:23,397 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-14 19:04:23,703 INFO L276 CfgBuilder]: Performing block encoding [2022-11-14 19:04:23,709 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-14 19:04:23,710 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-14 19:04:23,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:04:23 BoogieIcfgContainer [2022-11-14 19:04:23,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-14 19:04:23,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-14 19:04:23,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-14 19:04:23,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-14 19:04:23,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:04:22" (1/3) ... [2022-11-14 19:04:23,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8eb309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:04:23, skipping insertion in model container [2022-11-14 19:04:23,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:23" (2/3) ... [2022-11-14 19:04:23,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e8eb309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:04:23, skipping insertion in model container [2022-11-14 19:04:23,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:04:23" (3/3) ... [2022-11-14 19:04:23,717 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2022-11-14 19:04:23,724 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-14 19:04:23,730 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-14 19:04:23,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-14 19:04:23,730 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-14 19:04:23,819 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-14 19:04:23,858 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:04:23,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-14 19:04:23,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:23,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-14 19:04:23,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-14 19:04:23,903 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-14 19:04:23,927 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-14 19:04:23,935 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@73d117b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:04:23,935 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-14 19:04:24,107 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:24,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1093845670, now seen corresponding path program 1 times [2022-11-14 19:04:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:24,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388599350] [2022-11-14 19:04:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:24,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:24,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388599350] [2022-11-14 19:04:24,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388599350] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:24,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:24,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-14 19:04:24,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558510307] [2022-11-14 19:04:24,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:24,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-14 19:04:24,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:24,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-14 19:04:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-14 19:04:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:24,343 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:24,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 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-11-14 19:04:24,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:24,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:24,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-14 19:04:24,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:24,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:24,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1891215175, now seen corresponding path program 1 times [2022-11-14 19:04:24,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:24,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570168055] [2022-11-14 19:04:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:33,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:33,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:33,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570168055] [2022-11-14 19:04:33,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570168055] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:33,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:33,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-14 19:04:33,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441597205] [2022-11-14 19:04:33,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:33,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-14 19:04:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:33,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-14 19:04:33,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-14 19:04:33,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:33,062 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:33,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:33,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:33,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:34,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:34,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:34,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-14 19:04:34,929 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:34,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1705076601, now seen corresponding path program 1 times [2022-11-14 19:04:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:34,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46963618] [2022-11-14 19:04:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:34,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:35,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:35,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46963618] [2022-11-14 19:04:35,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46963618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:35,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:35,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:04:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318436204] [2022-11-14 19:04:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:35,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:04:35,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:35,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:04:35,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:04:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:35,040 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:35,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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-11-14 19:04:35,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:35,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:35,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:35,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:35,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:35,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:35,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-14 19:04:35,099 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash -858914285, now seen corresponding path program 1 times [2022-11-14 19:04:35,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:35,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529551856] [2022-11-14 19:04:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:35,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:36,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:36,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529551856] [2022-11-14 19:04:36,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529551856] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:36,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:36,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-14 19:04:36,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083481882] [2022-11-14 19:04:36,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:36,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-14 19:04:36,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:36,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-14 19:04:36,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-14 19:04:36,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:36,136 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:36,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 0 states have call successors, (0), 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-11-14 19:04:36,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:36,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:36,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:36,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:36,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:36,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-14 19:04:36,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-14 19:04:36,543 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1672081442, now seen corresponding path program 1 times [2022-11-14 19:04:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:36,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920298173] [2022-11-14 19:04:36,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:38,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:38,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:38,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920298173] [2022-11-14 19:04:38,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920298173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:38,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:38,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-14 19:04:38,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425972506] [2022-11-14 19:04:38,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:38,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-14 19:04:38,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:38,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-14 19:04:38,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-14 19:04:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,372 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:38,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 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-11-14 19:04:38,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:38,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:38,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:38,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-14 19:04:38,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:39,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:39,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-14 19:04:39,496 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:39,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:39,496 INFO L85 PathProgramCache]: Analyzing trace with hash 678632843, now seen corresponding path program 1 times [2022-11-14 19:04:39,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:39,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043991821] [2022-11-14 19:04:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:39,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:41,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043991821] [2022-11-14 19:04:41,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043991821] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:04:41,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764100640] [2022-11-14 19:04:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:41,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:04:41,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:41,227 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-11-14 19:04:41,267 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-11-14 19:04:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:41,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-14 19:04:41,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:04:41,556 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:04:41,558 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 11 treesize of output 11 [2022-11-14 19:04:41,754 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 13 treesize of output 9 [2022-11-14 19:04:41,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:04:42,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:04:42,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:42,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:42,519 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:04:42,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:04:42,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:42,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:42,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:04:43,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:04:43,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:43,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:04:43,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:43,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:43,427 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-14 19:04:43,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-11-14 19:04:43,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-14 19:04:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:43,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:04:43,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_182 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-14 19:04:44,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_182)))) is different from false [2022-11-14 19:04:44,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-14 19:04:44,086 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-14 19:04:44,101 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (= 400 .cse0) (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2022-11-14 19:04:44,143 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse3))) (or (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_180) .cse3 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ .cse0 1) v_ArrVal_182) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (not (<= v_ArrVal_180 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))) (= 400 .cse0)))) is different from false [2022-11-14 19:04:44,495 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int)) (let ((.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_178)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_180) .cse4 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (= 400 .cse0) (< (+ .cse0 1) v_ArrVal_182) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_180))))) is different from false [2022-11-14 19:04:44,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int)) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_178)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse5 v_ArrVal_180) .cse1 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|)) (.cse2 (select .cse4 .cse1))) (or (< (+ .cse2 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse4 .cse5) 1) v_ArrVal_180) (= 400 .cse2)))))))) is different from false [2022-11-14 19:04:44,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_180 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_178)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse5 (select .cse0 .cse3)) (.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_180) .cse3 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_180) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse4 (+ |c_~#queue~0.offset| 1604)))) (= .cse5 400) (< (+ .cse5 1) v_ArrVal_182) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-14 19:04:46,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_175 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_182 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_180 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_175)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_177))) (let ((.cse1 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_178)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse3 .cse2)) (.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_180) .cse2 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (= 400 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse1 .cse2))) (not (<= v_ArrVal_175 0)) (< (+ .cse0 1) v_ArrVal_182) (< (+ (select .cse3 .cse4) 1) v_ArrVal_180) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse5 .cse2))))))))) is different from false [2022-11-14 19:04:46,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:04:46,952 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 2 case distinctions, treesize of input 283 treesize of output 183 [2022-11-14 19:04:46,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:04:46,967 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 349 treesize of output 343 [2022-11-14 19:04:46,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 151 [2022-11-14 19:04:47,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 167 [2022-11-14 19:04:47,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-14 19:04:47,456 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:04:47,456 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 209 treesize of output 197 [2022-11-14 19:04:49,923 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:04:49,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:04:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-14 19:04:49,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764100640] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:04:49,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:04:49,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 80 [2022-11-14 19:04:49,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350339510] [2022-11-14 19:04:49,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:04:49,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-14 19:04:49,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:49,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-14 19:04:49,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=584, Invalid=4370, Unknown=56, NotChecked=1470, Total=6480 [2022-11-14 19:04:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:49,962 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:49,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 4.2875) internal successors, (343), 81 states have internal predecessors, (343), 0 states have call successors, (0), 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-11-14 19:04:49,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:49,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:49,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:49,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:49,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:49,963 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:20,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:05:20,772 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-11-14 19:05:20,967 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,SelfDestructingSolverStorable5 [2022-11-14 19:05:20,967 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:20,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:20,967 INFO L85 PathProgramCache]: Analyzing trace with hash -437217722, now seen corresponding path program 1 times [2022-11-14 19:05:20,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:20,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596188030] [2022-11-14 19:05:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:20,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:21,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:21,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596188030] [2022-11-14 19:05:21,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596188030] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:21,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754038220] [2022-11-14 19:05:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:21,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:21,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:21,840 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-11-14 19:05:21,842 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-11-14 19:05:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:21,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-14 19:05:21,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:22,357 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 13 treesize of output 9 [2022-11-14 19:05:22,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-14 19:05:22,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:22,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-14 19:05:22,790 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-14 19:05:22,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 32 [2022-11-14 19:05:22,852 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 17 treesize of output 9 [2022-11-14 19:05:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:22,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:05:23,346 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:23,346 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 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-14 19:05:23,352 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:23,353 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 56 treesize of output 60 [2022-11-14 19:05:23,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-14 19:05:23,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-11-14 19:05:23,371 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:23,371 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 48 treesize of output 48 [2022-11-14 19:05:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:23,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754038220] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:05:23,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:05:23,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2022-11-14 19:05:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803801875] [2022-11-14 19:05:23,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:05:23,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-14 19:05:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:23,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-14 19:05:23,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=2275, Unknown=11, NotChecked=0, Total=2550 [2022-11-14 19:05:23,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:23,554 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:23,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 6.9) internal successors, (345), 51 states have internal predecessors, (345), 0 states have call successors, (0), 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-11-14 19:05:23,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:23,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:23,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:23,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:23,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:23,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:05:23,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:35,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:05:35,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-14 19:05:35,552 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-11-14 19:05:35,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:35,746 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1797555879, now seen corresponding path program 1 times [2022-11-14 19:05:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:35,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823884838] [2022-11-14 19:05:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-14 19:05:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:35,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823884838] [2022-11-14 19:05:35,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823884838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:05:35,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:05:35,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:05:35,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326424905] [2022-11-14 19:05:35,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:05:35,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:05:35,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:35,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:05:35,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:05:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:35,836 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:35,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:05:35,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:35,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:35,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:35,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:35,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:35,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:05:35,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-14 19:05:35,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:05:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-14 19:05:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:35,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-14 19:05:35,857 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash 110343253, now seen corresponding path program 1 times [2022-11-14 19:05:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:35,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010630498] [2022-11-14 19:05:35,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:35,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:35,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010630498] [2022-11-14 19:05:35,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010630498] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:35,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263249177] [2022-11-14 19:05:35,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:35,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:35,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:35,932 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-11-14 19:05:35,934 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-11-14 19:05:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:36,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-14 19:05:36,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:36,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-14 19:05:36,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263249177] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:05:36,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-14 19:05:36,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-14 19:05:36,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40397244] [2022-11-14 19:05:36,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:05:36,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-14 19:05:36,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:36,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-14 19:05:36,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-14 19:05:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:36,107 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:36,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 36.0) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:05:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:05:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-14 19:05:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:36,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-14 19:05:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:36,245 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-11-14 19:05:36,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:36,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:36,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash 119995393, now seen corresponding path program 1 times [2022-11-14 19:05:36,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:36,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018328126] [2022-11-14 19:05:36,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:36,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:39,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:39,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018328126] [2022-11-14 19:05:39,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018328126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:39,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028738990] [2022-11-14 19:05:39,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:39,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:39,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:39,096 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-11-14 19:05:39,098 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-11-14 19:05:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:39,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-14 19:05:39,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:39,342 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:05:39,343 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 11 treesize of output 11 [2022-11-14 19:05:39,500 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 13 treesize of output 9 [2022-11-14 19:05:39,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:05:39,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:05:40,085 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:40,092 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:05:40,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:05:40,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:40,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:05:40,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:05:40,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:40,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:05:40,578 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:40,585 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:05:40,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-14 19:05:40,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:40,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-14 19:05:40,643 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 15 treesize of output 7 [2022-11-14 19:05:40,667 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:40,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:05:40,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:05:40,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:05:41,012 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1)))))) is different from false [2022-11-14 19:05:41,020 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:05:41,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1)))))) is different from false [2022-11-14 19:05:41,103 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (v_ArrVal_430 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_430)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1)))))) is different from false [2022-11-14 19:05:41,118 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (v_ArrVal_430 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_430))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1)))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse4 .cse3)))))) is different from false [2022-11-14 19:05:41,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_430 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_430))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse3))))))) is different from false [2022-11-14 19:05:41,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_430 Int) (v_ArrVal_428 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_426 Int) (v_ArrVal_437 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_426)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_428))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_430))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_432) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse1)))))))) is different from false [2022-11-14 19:05:41,690 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:41,690 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 2 case distinctions, treesize of input 244 treesize of output 159 [2022-11-14 19:05:41,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:41,698 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 275 treesize of output 273 [2022-11-14 19:05:41,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 237 [2022-11-14 19:05:41,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 281 [2022-11-14 19:05:41,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-14 19:05:41,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:41,832 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 101 treesize of output 93 [2022-11-14 19:05:42,135 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:05:42,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:05:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-14 19:05:42,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028738990] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:05:42,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:05:42,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 23, 25] total 80 [2022-11-14 19:05:42,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096374603] [2022-11-14 19:05:42,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:05:42,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-14 19:05:42,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:42,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-14 19:05:42,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=4525, Unknown=19, NotChecked=1314, Total=6320 [2022-11-14 19:05:42,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:42,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:42,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 5.2625) internal successors, (421), 80 states have internal predecessors, (421), 0 states have call successors, (0), 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-11-14 19:05:42,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:42,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:42,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:42,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:42,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:42,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-14 19:05:42,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:42,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:42,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:42,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-14 19:05:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:57,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:05:57,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-14 19:05:57,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-14 19:05:57,768 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:57,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1303619980, now seen corresponding path program 1 times [2022-11-14 19:05:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:57,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103051268] [2022-11-14 19:05:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:59,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:59,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103051268] [2022-11-14 19:05:59,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103051268] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:59,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677159242] [2022-11-14 19:05:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:59,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:59,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:59,024 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-11-14 19:05:59,036 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-11-14 19:05:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:59,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-14 19:05:59,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:59,254 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:05:59,255 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 11 treesize of output 11 [2022-11-14 19:05:59,377 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 13 treesize of output 9 [2022-11-14 19:05:59,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:05:59,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:05:59,852 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:59,858 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:05:59,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:05:59,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:59,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:06:00,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:06:00,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:00,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:06:00,322 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:00,328 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:06:00,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2022-11-14 19:06:00,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:00,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-14 19:06:00,388 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 15 treesize of output 7 [2022-11-14 19:06:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:06:00,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:06:00,645 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647)) is different from false [2022-11-14 19:06:00,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647)) is different from false [2022-11-14 19:06:00,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647)) is different from false [2022-11-14 19:06:00,669 WARN L833 $PredicateComparison]: unable to prove that (or (= 400 |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1|) (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647))) is different from false [2022-11-14 19:06:00,741 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse3 .cse4))) (or (= 400 .cse0) (forall ((v_ArrVal_508 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_512)) .cse2)) 2147483647))))) is different from false [2022-11-14 19:06:00,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_505)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse1)) 2147483647) (= 400 .cse4))))) is different from false [2022-11-14 19:06:00,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_505))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_512)) .cse1)) 2147483647) (= 400 .cse4))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse5 .cse3)))))) is different from false [2022-11-14 19:06:00,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_505)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse0 (select .cse5 .cse2))) (or (= 400 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse1 .cse2))) (< (let ((.cse4 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_508) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_512)) .cse4)) 2147483647)))))) is different from false [2022-11-14 19:06:01,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_503 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_503)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_504))) (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_505)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 400) (< (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_508) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_512)) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse5 .cse2))))))))) is different from false [2022-11-14 19:06:01,347 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:01,347 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 2 case distinctions, treesize of input 273 treesize of output 173 [2022-11-14 19:06:01,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:01,355 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 261 treesize of output 257 [2022-11-14 19:06:01,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 182 [2022-11-14 19:06:01,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 135 [2022-11-14 19:06:01,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-14 19:06:01,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:01,490 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 149 treesize of output 125 [2022-11-14 19:06:01,761 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:06:01,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:06:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-11-14 19:06:01,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677159242] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:06:01,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:06:01,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 27] total 71 [2022-11-14 19:06:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752637145] [2022-11-14 19:06:01,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:06:01,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-14 19:06:01,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:06:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-14 19:06:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=3419, Unknown=24, NotChecked=1170, Total=5112 [2022-11-14 19:06:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:01,791 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:06:01,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 5.253521126760563) internal successors, (373), 72 states have internal predecessors, (373), 0 states have call successors, (0), 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-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:06:01,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:06:01,792 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:06:04,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:06:04,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-14 19:06:04,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:06:04,355 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:06:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:06:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1757513073, now seen corresponding path program 1 times [2022-11-14 19:06:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:06:04,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023296751] [2022-11-14 19:06:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:06:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:06:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:06:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:06:05,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:06:05,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023296751] [2022-11-14 19:06:05,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023296751] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:06:05,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914078811] [2022-11-14 19:06:05,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:06:05,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:06:05,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:06:05,110 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-11-14 19:06:05,135 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-11-14 19:06:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:06:05,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-14 19:06:05,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:06:05,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 43 treesize of output 21 [2022-11-14 19:06:05,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:05,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-14 19:06:06,083 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:06,090 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:06:06,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 33 [2022-11-14 19:06:06,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:06,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-14 19:06:06,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-14 19:06:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:06:06,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:06:06,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 1604))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_578) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_579)) .cse1))))) is different from false [2022-11-14 19:06:06,710 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:06,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 52 [2022-11-14 19:06:06,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:06,717 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 75 treesize of output 75 [2022-11-14 19:06:06,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-11-14 19:06:06,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-14 19:06:06,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:06,744 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 64 treesize of output 52 [2022-11-14 19:06:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:06:06,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914078811] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:06:06,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:06:06,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 50 [2022-11-14 19:06:06,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814137257] [2022-11-14 19:06:06,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:06:06,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-14 19:06:06,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:06:06,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-14 19:06:06,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2198, Unknown=7, NotChecked=96, Total=2550 [2022-11-14 19:06:06,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:06,965 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:06:06,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 7.5) internal successors, (375), 51 states have internal predecessors, (375), 0 states have call successors, (0), 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-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:06:06,966 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:06:19,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-14 19:06:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-14 19:06:19,555 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-11-14 19:06:19,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:06:19,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:06:19,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:06:19,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1525993803, now seen corresponding path program 2 times [2022-11-14 19:06:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:06:19,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544185123] [2022-11-14 19:06:19,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:06:19,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:06:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:06:24,544 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:06:24,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:06:24,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544185123] [2022-11-14 19:06:24,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544185123] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:06:24,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255528208] [2022-11-14 19:06:24,557 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:06:24,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:06:24,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:06:24,561 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-11-14 19:06:24,561 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-11-14 19:06:24,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:06:24,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:06:24,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-14 19:06:24,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:06:24,823 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:06:24,823 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 11 treesize of output 11 [2022-11-14 19:06:24,982 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 13 treesize of output 9 [2022-11-14 19:06:25,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:06:25,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:06:25,662 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:25,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:25,675 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:06:25,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:06:25,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:25,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:25,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:26,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:26,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:26,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:06:26,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:26,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:26,532 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:06:26,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:06:26,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:26,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:26,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:27,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:27,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:27,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:06:27,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:27,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:27,435 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:06:27,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:06:27,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:27,656 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:27,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:27,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:28,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:28,017 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:06:28,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:28,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:28,233 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-14 19:06:28,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-11-14 19:06:28,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-14 19:06:28,271 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:06:28,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:06:28,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_694 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-14 19:06:28,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_694)))) is different from false [2022-11-14 19:06:28,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-14 19:06:28,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 (+ |c_~#queue~0.offset| 1604)))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_692) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2022-11-14 19:06:29,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_690)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 v_ArrVal_692) .cse2 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse2) 1) v_ArrVal_694) (< (+ (select .cse1 .cse3) 1) v_ArrVal_692))))) is different from false [2022-11-14 19:06:29,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_690)) (.cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_692) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_694))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse3)))))) is different from false [2022-11-14 19:06:29,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_690)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse4 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 (+ |c_~#queue~0.offset| 1604)))) (< (+ (select .cse0 .cse4) 1) v_ArrVal_692) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 1608 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-14 19:06:39,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse1))) (not (<= v_ArrVal_688 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse1))))))))) is different from false [2022-11-14 19:06:39,282 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse1))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse4) 2147483647) (< (+ (select .cse0 .cse4) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse1))))))))) is different from false [2022-11-14 19:06:43,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_692) (< (+ (select .cse6 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (not (<= v_ArrVal_686 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-14 19:06:43,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse7 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_692) (< (+ (select .cse0 .cse7) 1) v_ArrVal_686) (< (+ (select .cse6 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3)))))))))) is different from false [2022-11-14 19:06:43,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_683)) (.cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse5 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_688) (< (+ (select .cse4 .cse1) 1) v_ArrVal_694) (< (+ 1 (select .cse2 .cse5)) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse1))) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse7) 2147483647) (< (+ (select .cse4 .cse7) 1) v_ArrVal_692)))))))) is different from false [2022-11-14 19:06:43,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse5 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_683)) (.cse6 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 v_ArrVal_686) .cse7 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse3 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_686) (< (+ (select .cse0 .cse3) 1) v_ArrVal_692) (< (+ (select .cse5 .cse7) 1) v_ArrVal_688)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse9 .cse7)))))) is different from false [2022-11-14 19:06:43,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_683)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse7 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3))) (< (+ (select .cse0 .cse7) 1) v_ArrVal_686) (< (+ (select .cse5 .cse8) 1) v_ArrVal_692) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse8) 2147483647))))))))) is different from false [2022-11-14 19:06:54,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse4 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse5 .cse1))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_686) (< (+ (select .cse6 .cse1) 1) v_ArrVal_688) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse4) 2147483647) (< (+ (select .cse3 .cse1) 1) v_ArrVal_694)))))))))) is different from false [2022-11-14 19:06:55,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_692) (< (+ (select .cse2 .cse3) 1) v_ArrVal_688) (< (+ (select .cse0 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse5 .cse3))) (not (<= v_ArrVal_680 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_686) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3)))))))))))) is different from false [2022-11-14 19:06:55,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_692) (< (+ (select .cse2 .cse3) 1) v_ArrVal_688) (< (+ (select .cse0 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse5 .cse3))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_680) (< (+ (select .cse2 .cse1) 1) v_ArrVal_686) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3)))))))))))) is different from false [2022-11-14 19:06:55,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_686) .cse5 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_692) .cse5 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_680) (< (+ (select .cse2 .cse3) 1) v_ArrVal_692) (< (+ (select .cse4 .cse5) 1) v_ArrVal_688) (< (+ (select .cse2 .cse5) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse6 .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse7 .cse5))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_686) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse5))))))))))))) is different from false [2022-11-14 19:06:55,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_679) .cse3 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_680) (< (+ (select .cse4 .cse1) 1) v_ArrVal_688) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_692) (< (+ (select .cse4 .cse5) 1) v_ArrVal_686) (not (<= v_ArrVal_679 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse8 .cse1))))))))))))) is different from false [2022-11-14 19:06:56,320 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse7 v_ArrVal_679) .cse3 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse9 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse8 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse0 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_680) (< (+ (select .cse4 .cse1) 1) v_ArrVal_688) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_692) (< (+ (select .cse2 .cse7) 1) v_ArrVal_679) (< (+ (select .cse4 .cse5) 1) v_ArrVal_686) (< (+ (select .cse6 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse9 .cse1))))))))))))) is different from false [2022-11-14 19:06:56,443 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse7 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_677)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse9 v_ArrVal_679) .cse8 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_686) .cse2 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse3 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse1 v_ArrVal_692) .cse2 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (< (+ (select .cse0 .cse2) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse2))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_692) (< (+ (select .cse4 .cse2) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse5 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse2))) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse7 .cse8) 1) v_ArrVal_680) (< (+ (select .cse7 .cse9) 1) v_ArrVal_679))))))))))) is different from false [2022-11-14 19:06:56,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse3 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_677)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse4 v_ArrVal_679) .cse7 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse8 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_686) .cse6 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse2 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse6 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_692) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse3 .cse4) 1) v_ArrVal_679) (< (+ (select .cse5 .cse6) 1) v_ArrVal_688) (< (+ (select .cse0 .cse6) 1) v_ArrVal_694) (< (+ (select .cse5 .cse1) 1) v_ArrVal_686) (< (+ (select .cse3 .cse7) 1) v_ArrVal_680) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse8 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse9 .cse6))))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse12 .cse7)))))) is different from false [2022-11-14 19:06:56,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_677)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 .cse8 v_ArrVal_679) .cse10 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse2 (select .cse12 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse6 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse3))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse6 .cse3))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_694) (< (+ (select .cse7 .cse8) 1) v_ArrVal_679) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse9 .cse10))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_688) (< (+ (select .cse7 .cse10) 1) v_ArrVal_680)))))))))))) is different from false [2022-11-14 19:06:56,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_677)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_679) .cse3 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse2 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse5 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse6 .cse3))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_680) (< (+ (select .cse0 .cse3) 1) v_ArrVal_688) (< (+ (select .cse5 .cse1) 1) v_ArrVal_692) (< (+ (select .cse7 .cse1) 1) v_ArrVal_679) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse3)))))))))))))) is different from false [2022-11-14 19:06:59,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int)) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_674 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_674)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_675))) (let ((.cse3 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_677)) (.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_679) .cse4 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_686) .cse4 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_692) .cse4 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_674 0)) (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (< (+ 1 (select .cse2 .cse1)) v_ArrVal_679) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse4))) (< (+ (select .cse6 .cse4) 1) v_ArrVal_694) (< (+ (select .cse0 .cse4) 1) v_ArrVal_688) (< (+ (select .cse6 .cse1) 1) v_ArrVal_692) (< (+ (select .cse2 .cse4) 1) v_ArrVal_680) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse7 .cse4))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse4))))))))))))))) is different from false [2022-11-14 19:07:00,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:07:00,019 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 2 case distinctions, treesize of input 1481 treesize of output 946 [2022-11-14 19:07:00,053 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:07:00,054 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 2026 treesize of output 2014 [2022-11-14 19:07:00,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 874 [2022-11-14 19:07:00,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1428 treesize of output 1380 [2022-11-14 19:07:00,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1542 treesize of output 1518 [2022-11-14 19:07:00,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 709 treesize of output 697 [2022-11-14 19:07:00,231 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:07:00,232 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 17 treesize of output 9 [2022-11-14 19:07:01,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:07:01,528 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 500 treesize of output 516 [2022-11-14 19:07:06,085 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:07:06,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:07:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 38 refuted. 9 times theorem prover too weak. 0 trivial. 124 not checked. [2022-11-14 19:07:06,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255528208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:07:06,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:07:06,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44, 49] total 135 [2022-11-14 19:07:06,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252932915] [2022-11-14 19:07:06,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:07:06,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-11-14 19:07:06,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:07:06,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-11-14 19:07:06,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1597, Invalid=10581, Unknown=132, NotChecked=6050, Total=18360 [2022-11-14 19:07:06,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:06,131 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:07:06,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 135 states have (on average 4.362962962962963) internal successors, (589), 136 states have internal predecessors, (589), 0 states have call successors, (0), 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-11-14 19:07:06,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:06,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:06,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:06,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:07:06,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:06,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-14 19:07:06,131 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:07:06,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:06,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:07:06,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:07:06,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-14 19:07:06,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-14 19:07:06,132 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:08:01,267 WARN L233 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 154 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-14 19:09:27,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-14 19:09:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:09:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-14 19:09:27,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-14 19:09:27,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-14 19:09:27,698 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:09:27,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:09:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1624944705, now seen corresponding path program 2 times [2022-11-14 19:09:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:09:27,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902014338] [2022-11-14 19:09:27,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:09:27,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:09:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:09:34,489 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 18 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:09:34,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:09:34,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902014338] [2022-11-14 19:09:34,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902014338] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:09:34,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728956360] [2022-11-14 19:09:34,490 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:09:34,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:09:34,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:09:34,491 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-11-14 19:09:34,492 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-11-14 19:09:34,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:09:34,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:09:34,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-14 19:09:34,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:09:34,807 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:09:34,808 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 11 treesize of output 11 [2022-11-14 19:09:35,001 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 13 treesize of output 9 [2022-11-14 19:09:35,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:09:35,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:09:35,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:09:35,750 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:09:35,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:09:35,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:09:35,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:09:35,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:09:36,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:09:36,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:09:36,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:09:36,273 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:09:36,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:09:36,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:09:36,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:09:36,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:09:36,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:09:36,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:09:36,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:09:36,864 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:09:36,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:09:36,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:09:36,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:09:37,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:09:37,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:09:37,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:09:37,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:09:37,522 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:09:37,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:09:37,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:09:37,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:09:37,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-14 19:09:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:09:37,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:09:37,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 400))))) is different from false [2022-11-14 19:09:38,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))) is different from false [2022-11-14 19:09:38,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))) is different from false [2022-11-14 19:09:38,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_822)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:09:38,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_822))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse3))))))))) is different from false [2022-11-14 19:09:38,228 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_822))) (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse3))))))) is different from false [2022-11-14 19:09:39,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_818) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1)))))))) is different from false [2022-11-14 19:09:39,290 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_816)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse5 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_818) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 400)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))))) is different from false [2022-11-14 19:09:39,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_816))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_818) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse3))))))))))) is different from false [2022-11-14 19:09:39,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_816))) (store (store .cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_818) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse2 .cse3))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse1))))))))) is different from false [2022-11-14 19:09:40,103 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1)))))))))) is different from false [2022-11-14 19:09:40,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse3 .cse1)))))))))) is different from false [2022-11-14 19:09:40,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse3 .cse1)))))))))) is different from false [2022-11-14 19:09:40,634 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_808)) (.cse10 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store (store .cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ 1 (select .cse5 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1))) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))))))) is different from false [2022-11-14 19:09:40,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_808))) (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse10 .cse8 v_ArrVal_818) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse7 .cse8 v_ArrVal_825) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse3))))))))))))) is different from false [2022-11-14 19:09:40,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_808))) (store (store .cse11 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_810) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse8 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse10 .cse8 v_ArrVal_818) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse7 .cse8 v_ArrVal_825) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))))))))))) is different from false [2022-11-14 19:09:42,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_805 Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_805)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_807))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_808))) (store (store .cse11 .cse7 v_ArrVal_810) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse9 .cse7 v_ArrVal_818) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 .cse7 v_ArrVal_825) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))) (not (= 400 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse4 .cse1)))))))))))) is different from false [2022-11-14 19:09:42,422 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:09:42,423 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 2 case distinctions, treesize of input 2504 treesize of output 1519 [2022-11-14 19:09:42,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:09:42,450 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 2079 treesize of output 2053 [2022-11-14 19:09:42,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1789 treesize of output 1725 [2022-11-14 19:09:42,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2155 treesize of output 2135 [2022-11-14 19:09:42,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2072 treesize of output 2024 [2022-11-14 19:09:42,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2059 treesize of output 2027 [2022-11-14 19:09:42,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-14 19:09:43,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:09:43,425 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 359 treesize of output 343 [2022-11-14 19:09:44,436 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:09:44,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:09:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 63 refuted. 6 times theorem prover too weak. 0 trivial. 120 not checked. [2022-11-14 19:09:44,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728956360] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:09:44,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:09:44,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 35, 43] total 122 [2022-11-14 19:09:44,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762330830] [2022-11-14 19:09:44,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:09:44,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-11-14 19:09:44,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:09:44,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-11-14 19:09:44,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1149, Invalid=9744, Unknown=95, NotChecked=3774, Total=14762 [2022-11-14 19:09:44,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:09:44,489 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:09:44,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 5.467213114754099) internal successors, (667), 122 states have internal predecessors, (667), 0 states have call successors, (0), 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-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-14 19:09:44,490 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:10:30,327 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (and (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))) (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse5 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse1))) (not (= 400 (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))))))) is different from false [2022-11-14 19:10:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:10:30,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-14 19:10:30,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-14 19:10:30,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-14 19:10:30,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-14 19:10:30,531 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:10:30,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:10:30,531 INFO L85 PathProgramCache]: Analyzing trace with hash 202398260, now seen corresponding path program 2 times [2022-11-14 19:10:30,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:10:30,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284119936] [2022-11-14 19:10:30,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:10:30,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:10:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:10:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:10:34,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:10:34,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284119936] [2022-11-14 19:10:34,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284119936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:10:34,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213331536] [2022-11-14 19:10:34,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:10:34,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:10:34,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:10:34,020 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:10:34,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-14 19:10:34,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:10:34,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:10:34,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-14 19:10:34,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:10:34,294 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:10:34,294 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 11 treesize of output 11 [2022-11-14 19:10:34,439 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 13 treesize of output 9 [2022-11-14 19:10:34,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:10:34,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:10:35,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:10:35,074 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:10:35,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:10:35,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:35,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:10:35,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-14 19:10:35,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:35,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:10:35,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:10:35,733 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:10:35,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:10:35,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:35,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:10:36,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-14 19:10:36,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:36,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:10:36,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:10:36,625 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:10:36,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:10:36,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:36,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:10:36,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-14 19:10:37,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:37,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:10:37,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:10:37,274 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:10:37,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-14 19:10:37,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:37,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-14 19:10:37,448 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 15 treesize of output 7 [2022-11-14 19:10:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:10:37,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:10:37,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647)))) is different from false [2022-11-14 19:10:37,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= v_ArrVal_948 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-14 19:10:37,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_948)))) is different from false [2022-11-14 19:10:39,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_945)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_946) .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_948))))) is different from false [2022-11-14 19:10:39,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_946) .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse3)))))) is different from false [2022-11-14 19:10:39,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_945)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse2 .cse3))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_948)))))) is different from false [2022-11-14 19:10:46,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse3 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_948))))))) is different from false [2022-11-14 19:10:46,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_939) .cse3 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1)))))))))) is different from false [2022-11-14 19:10:49,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_937))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_939) .cse3 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_948)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse7 .cse3)))))) is different from false [2022-11-14 19:10:49,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_937)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_939) .cse3 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_948) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647))))))))) is different from false [2022-11-14 19:11:02,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse6 (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse2 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_948) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse5 .cse1)))))))))))) is different from false [2022-11-14 19:11:02,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse7 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_941) (< (+ (select .cse2 .cse3) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_948) (< (select (store .cse7 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse7 .cse1))))))))))))) is different from false [2022-11-14 19:11:02,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_933) .cse4 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_948) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_941))))))))))) is different from false [2022-11-14 19:11:02,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse4 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_931)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_933) .cse5 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_948) (< (+ (select .cse3 .cse1) 1) v_ArrVal_941) (< (+ (select .cse4 .cse5) 1) v_ArrVal_935) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse7 .cse1))))))))))))) is different from false [2022-11-14 19:11:03,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_931)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_933) .cse3 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse10 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse10 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse10 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_948) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse7 .cse1) 1) v_ArrVal_941) (< (+ (select .cse8 .cse3) 1) v_ArrVal_935)))))))))))) is different from false [2022-11-14 19:11:14,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_928 Int) (v_ArrVal_939 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_929 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_928)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_929))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_931)) (.cse9 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_933) .cse1 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse3 (select .cse10 |c_~#queue~0.base|))) (let ((.cse4 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse3 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_941) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse5 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_935))))))))))))) is different from false [2022-11-14 19:11:14,823 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:11:14,824 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 2 case distinctions, treesize of input 1201 treesize of output 771 [2022-11-14 19:11:14,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:11:14,854 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 1543 treesize of output 1539 [2022-11-14 19:11:14,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 874 [2022-11-14 19:11:14,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1081 treesize of output 1049 [2022-11-14 19:11:14,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 514 treesize of output 506 [2022-11-14 19:11:14,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 998 treesize of output 982 [2022-11-14 19:11:14,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-14 19:11:15,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:11:15,325 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 560 treesize of output 556 [2022-11-14 19:11:16,687 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:11:16,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:11:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 74 refuted. 17 times theorem prover too weak. 0 trivial. 110 not checked. [2022-11-14 19:11:16,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213331536] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:11:16,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:11:16,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 43] total 110 [2022-11-14 19:11:16,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935188774] [2022-11-14 19:11:16,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:11:16,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-11-14 19:11:16,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:11:16,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-11-14 19:11:16,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=7592, Unknown=160, NotChecked=3216, Total=12210 [2022-11-14 19:11:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:11:16,745 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:11:16,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 5.627272727272727) internal successors, (619), 111 states have internal predecessors, (619), 0 states have call successors, (0), 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-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-14 19:11:16,746 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:12:47,285 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 .cse5 v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 400 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1)))))))) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse6 .cse1))) (not (= (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 400))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse8 (select .cse12 |c_~#queue~0.base|))) (let ((.cse10 (store (store .cse12 |c_~#queue~0.base| (let ((.cse13 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse13 .cse5 v_ArrVal_818) .cse1 (+ (select .cse13 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (select (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse11 .cse5 v_ArrVal_825) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse7 .cse1))) (not (= 400 (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse9 .cse1)))))))))))) is different from false [2022-11-14 19:16:22,104 WARN L233 SmtUtils]: Spent 6.38s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:16:22,113 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse11 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse0 (select .cse6 .cse5))) (and (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_822))) (store (store .cse3 .cse4 v_ArrVal_825) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| .cse0)) (not (= 400 (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse1 .cse2)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse12 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_816))) (store (store .cse12 .cse4 v_ArrVal_818) .cse5 (+ (select .cse12 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse10 .cse11 v_ArrVal_825) .cse2 (+ (select .cse10 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse7 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| .cse0)) (not (= 400 (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse8 .cse2)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse14 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse16 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse18 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse18 .cse11 v_ArrVal_818) .cse2 (+ (select .cse18 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (let ((.cse13 (select (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse17 .cse11 v_ArrVal_825) .cse2 (+ (select .cse17 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse14 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse15 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse13 .cse2))))))))) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int)) (or (not (= 400 (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_829) .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| .cse0))))))) is different from false [2022-11-14 19:16:22,128 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse7 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse15 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse9 (select .cse16 .cse11))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937))) (let ((.cse6 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse7 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_948) (< (+ (select .cse2 .cse1) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse5 .cse1))) (< (select (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse10 (store .cse16 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_937))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse10 .cse15 v_ArrVal_939) .cse11 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse12 (select .cse14 |c_~#queue~0.base|))) (let ((.cse13 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse8 (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse8 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| .cse9)) (< (+ (select .cse10 .cse11) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse12 .cse1))) (< (+ (select .cse13 .cse1) 1) v_ArrVal_948) (< (select (store .cse8 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse18 (store .cse16 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_945))) (let ((.cse17 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse18 .cse15 v_ArrVal_946) .cse11 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| .cse9)) (< (select (store .cse17 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse17 .cse1))) (< (+ (select .cse18 .cse11) 1) v_ArrVal_948))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_952 Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| .cse9)) (< (select (store .cse16 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse11) 2147483647)))))) is different from false [2022-11-14 19:16:51,335 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse4 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select .cse6 .cse5))) (and (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_822))) (store (store .cse3 .cse4 v_ArrVal_825) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| .cse0)) (not (= 400 (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse1 .cse2)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_816))) (store (store .cse11 .cse4 v_ArrVal_818) .cse5 (+ (select .cse11 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (select (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse10 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse2 (+ (select .cse10 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse7 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| .cse0)) (not (= 400 (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse8 .cse2)))))))) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int)) (or (not (= 400 (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_829) .cse5))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| .cse0))))))) is different from false [2022-11-14 19:16:51,351 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 1604))) (let ((.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse8 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select .cse9 .cse4))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse3 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_937))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse8 v_ArrVal_939) .cse4 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| .cse2)) (< (+ (select .cse3 .cse4) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_948) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse11 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_945))) (let ((.cse10 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse11 .cse8 v_ArrVal_946) .cse4 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| .cse2)) (< (select (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse10 .cse1))) (< (+ (select .cse11 .cse4) 1) v_ArrVal_948))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_952 Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| .cse2)) (< (select (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse4) 2147483647)))))) is different from false [2022-11-14 19:17:25,508 WARN L233 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 185 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:17:25,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select .cse9 .cse8))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| .cse0)) (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_816))) (store (store .cse6 .cse7 v_ArrVal_818) .cse8 (+ (select .cse6 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse1 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_825) .cse2 (+ (select .cse5 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse1 .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse3 .cse2)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| .cse0)) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse10 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_822))) (store (store .cse11 .cse7 v_ArrVal_825) .cse8 (+ (select .cse11 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 400 (select (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse2))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse10 .cse2)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| .cse0)) (forall ((v_ArrVal_829 Int)) (not (= 400 (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_829) .cse8))))))))) is different from false [2022-11-14 19:17:25,538 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse4 (+ |c_~#queue~0.offset| 1604)) (.cse9 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (select .cse0 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (or (forall ((v_ArrVal_952 Int)) (< (select (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| .cse2)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_937))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 (+ 1608 |c_~#queue~0.offset|) v_ArrVal_946) .cse4 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse4) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse3 .cse4))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse6 .cse4))) (< (+ (select .cse7 .cse4) 1) v_ArrVal_948)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| .cse2)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int)) (or (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse11 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_945))) (let ((.cse10 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse11 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse4) 2147483647) (< (+ (select .cse11 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse10 .cse4))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| .cse2))))))) is different from false Received shutdown request... [2022-11-14 19:18:45,257 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 19:18:45,258 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 19:18:45,258 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 19:18:45,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-14 19:18:45,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-14 19:18:45,861 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 205 known predicates. [2022-11-14 19:18:45,863 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-14 19:18:45,863 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-14 19:18:45,865 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-14 19:18:45,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-14 19:18:45,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-14 19:18:45,866 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-14 19:18:45,868 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-14 19:18:45,869 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/3) [2022-11-14 19:18:45,870 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-14 19:18:45,870 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-14 19:18:45,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:18:45 BasicIcfg [2022-11-14 19:18:45,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-14 19:18:45,876 INFO L158 Benchmark]: Toolchain (without parser) took 863374.09ms. Allocated memory was 245.4MB in the beginning and 1.1GB in the end (delta: 895.5MB). Free memory was 217.5MB in the beginning and 880.9MB in the end (delta: -663.4MB). Peak memory consumption was 232.3MB. Max. memory is 8.0GB. [2022-11-14 19:18:45,876 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 161.5MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-14 19:18:45,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.18ms. Allocated memory is still 245.4MB. Free memory was 217.5MB in the beginning and 195.7MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-11-14 19:18:45,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.69ms. Allocated memory is still 245.4MB. Free memory was 195.7MB in the beginning and 192.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-14 19:18:45,876 INFO L158 Benchmark]: Boogie Preprocessor took 43.44ms. Allocated memory is still 245.4MB. Free memory was 192.5MB in the beginning and 190.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-14 19:18:45,877 INFO L158 Benchmark]: RCFGBuilder took 539.76ms. Allocated memory is still 245.4MB. Free memory was 190.4MB in the beginning and 167.9MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-11-14 19:18:45,877 INFO L158 Benchmark]: TraceAbstraction took 862162.80ms. Allocated memory was 245.4MB in the beginning and 1.1GB in the end (delta: 895.5MB). Free memory was 167.4MB in the beginning and 880.9MB in the end (delta: -713.6MB). Peak memory consumption was 183.5MB. Max. memory is 8.0GB. [2022-11-14 19:18:45,877 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 161.5MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 565.18ms. Allocated memory is still 245.4MB. Free memory was 217.5MB in the beginning and 195.7MB in the end (delta: 21.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.69ms. Allocated memory is still 245.4MB. Free memory was 195.7MB in the beginning and 192.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.44ms. Allocated memory is still 245.4MB. Free memory was 192.5MB in the beginning and 190.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 539.76ms. Allocated memory is still 245.4MB. Free memory was 190.4MB in the beginning and 167.9MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 862162.80ms. Allocated memory was 245.4MB in the beginning and 1.1GB in the end (delta: 895.5MB). Free memory was 167.4MB in the beginning and 880.9MB in the end (delta: -713.6MB). Peak memory consumption was 183.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7836, independent: 7590, independent conditional: 1576, independent unconditional: 6014, dependent: 246, dependent conditional: 226, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 1576, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 1576, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 0, independent unconditional: 7590, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 0, independent unconditional: 7590, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 0, independent unconditional: 7590, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5936, independent: 5916, independent conditional: 0, independent unconditional: 5916, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5936, independent: 5914, independent conditional: 0, independent unconditional: 5914, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7610, independent: 1674, independent conditional: 0, independent unconditional: 1674, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5936, unknown conditional: 0, unknown unconditional: 5936] , Statistics on independence cache: Total cache size (in pairs): 5936, Positive cache size: 5916, Positive conditional cache size: 0, Positive unconditional cache size: 5916, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 226 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 116, Number of trivial persistent sets: 77, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6034, independent: 6014, independent conditional: 0, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7836, independent: 7590, independent conditional: 1576, independent unconditional: 6014, dependent: 246, dependent conditional: 226, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 1576, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 1576, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 0, independent unconditional: 7590, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 0, independent unconditional: 7590, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7610, independent: 7590, independent conditional: 0, independent unconditional: 7590, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5936, independent: 5916, independent conditional: 0, independent unconditional: 5916, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5936, independent: 5914, independent conditional: 0, independent unconditional: 5914, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7610, independent: 1674, independent conditional: 0, independent unconditional: 1674, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5936, unknown conditional: 0, unknown unconditional: 5936] , Statistics on independence cache: Total cache size (in pairs): 5936, Positive cache size: 5916, Positive conditional cache size: 0, Positive unconditional cache size: 5916, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 226 - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 205 known predicates. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 205 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 205 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 205 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 205 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 205 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 862.0s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 713.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 465, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 145.2s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4984 ConstructedInterpolants, 877 QuantifiedInterpolants, 315590 SizeOfPredicates, 263 NumberOfNonLiveVariables, 3386 ConjunctsInSsa, 641 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 381/2535 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown