/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-15 22:19:36,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-15 22:19:36,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-15 22:19:36,809 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-15 22:19:36,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-15 22:19:36,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-15 22:19:36,811 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-15 22:19:36,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-15 22:19:36,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-15 22:19:36,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-15 22:19:36,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-15 22:19:36,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-15 22:19:36,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-15 22:19:36,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-15 22:19:36,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-15 22:19:36,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-15 22:19:36,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-15 22:19:36,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-15 22:19:36,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-15 22:19:36,823 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-15 22:19:36,824 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-15 22:19:36,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-15 22:19:36,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-15 22:19:36,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-15 22:19:36,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-15 22:19:36,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-15 22:19:36,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-15 22:19:36,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-15 22:19:36,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-15 22:19:36,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-15 22:19:36,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-15 22:19:36,838 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-15 22:19:36,839 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-15 22:19:36,839 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-15 22:19:36,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-15 22:19:36,840 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-15 22:19:36,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-15 22:19:36,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-15 22:19:36,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-15 22:19:36,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-15 22:19:36,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-15 22:19:36,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-15 22:19:36,866 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-15 22:19:36,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-15 22:19:36,868 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-15 22:19:36,868 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-15 22:19:36,869 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-15 22:19:36,869 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-15 22:19:36,869 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-15 22:19:36,869 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-15 22:19:36,869 INFO L138 SettingsManager]: * Use SBE=true [2022-11-15 22:19:36,869 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-15 22:19:36,870 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-15 22:19:36,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-15 22:19:36,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-15 22:19:36,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-15 22:19:36,870 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-15 22:19:36,870 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-15 22:19:36,870 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-15 22:19:36,871 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-15 22:19:36,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-15 22:19:36,871 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-15 22:19:36,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-15 22:19:36,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-15 22:19:36,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-15 22:19:36,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-15 22:19:36,871 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-15 22:19:36,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 22:19:36,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-15 22:19:36,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-15 22:19:36,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-15 22:19:36,872 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-15 22:19:36,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-15 22:19:36,872 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-15 22:19:36,872 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-15 22:19:36,872 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-15 22:19:36,873 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-15 22:19:36,873 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-15 22:19:36,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-11-15 22:19:37,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-15 22:19:37,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-15 22:19:37,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-15 22:19:37,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-15 22:19:37,064 INFO L275 PluginConnector]: CDTParser initialized [2022-11-15 22:19:37,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2022-11-15 22:19:37,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f44c38f5a/bee5463ef21c496a87d6bc726f8a8000/FLAG96de82ca8 [2022-11-15 22:19:37,614 INFO L306 CDTParser]: Found 1 translation units. [2022-11-15 22:19:37,615 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-11-15 22:19:37,635 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f44c38f5a/bee5463ef21c496a87d6bc726f8a8000/FLAG96de82ca8 [2022-11-15 22:19:38,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f44c38f5a/bee5463ef21c496a87d6bc726f8a8000 [2022-11-15 22:19:38,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-15 22:19:38,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-15 22:19:38,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-15 22:19:38,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-15 22:19:38,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-15 22:19:38,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6d627d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38, skipping insertion in model container [2022-11-15 22:19:38,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,153 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-15 22:19:38,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-15 22:19:38,519 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.i[43266,43279] [2022-11-15 22:19:38,523 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.i[43543,43556] [2022-11-15 22:19:38,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 22:19:38,532 INFO L203 MainTranslator]: Completed pre-run [2022-11-15 22:19:38,566 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.i[43266,43279] [2022-11-15 22:19:38,584 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.i[43543,43556] [2022-11-15 22:19:38,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 22:19:38,627 INFO L208 MainTranslator]: Completed translation [2022-11-15 22:19:38,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38 WrapperNode [2022-11-15 22:19:38,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-15 22:19:38,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-15 22:19:38,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-15 22:19:38,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-15 22:19:38,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,682 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-11-15 22:19:38,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-15 22:19:38,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-15 22:19:38,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-15 22:19:38,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-15 22:19:38,689 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,703 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-15 22:19:38,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-15 22:19:38,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-15 22:19:38,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-15 22:19:38,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (1/1) ... [2022-11-15 22:19:38,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 22:19:38,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:38,732 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-15 22:19:38,745 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-15 22:19:38,770 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-15 22:19:38,771 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-15 22:19:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-15 22:19:38,771 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-15 22:19:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-15 22:19:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-15 22:19:38,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-15 22:19:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-15 22:19:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-15 22:19:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-15 22:19:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-15 22:19:38,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-15 22:19:38,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-15 22:19:38,774 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-15 22:19:38,875 INFO L235 CfgBuilder]: Building ICFG [2022-11-15 22:19:38,876 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-15 22:19:39,103 INFO L276 CfgBuilder]: Performing block encoding [2022-11-15 22:19:39,109 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-15 22:19:39,109 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-15 22:19:39,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:19:39 BoogieIcfgContainer [2022-11-15 22:19:39,111 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-15 22:19:39,112 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-15 22:19:39,112 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-15 22:19:39,114 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-15 22:19:39,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:19:38" (1/3) ... [2022-11-15 22:19:39,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa0e150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:19:39, skipping insertion in model container [2022-11-15 22:19:39,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:19:38" (2/3) ... [2022-11-15 22:19:39,115 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa0e150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:19:39, skipping insertion in model container [2022-11-15 22:19:39,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:19:39" (3/3) ... [2022-11-15 22:19:39,116 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-15 22:19:39,121 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-15 22:19:39,127 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-15 22:19:39,127 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-15 22:19:39,128 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-15 22:19:39,247 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-15 22:19:39,292 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:19:39,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 22:19:39,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:39,309 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-15 22:19:39,333 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-15 22:19:39,341 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 22:19:39,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-15 22:19:39,357 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;@756fa3a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:19:39,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-15 22:19:39,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-15 22:19:39,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash 744859798, now seen corresponding path program 1 times [2022-11-15 22:19:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:39,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250650193] [2022-11-15 22:19:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:39,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:39,582 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-15 22:19:39,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:39,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250650193] [2022-11-15 22:19:39,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250650193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:39,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:39,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 22:19:39,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813418983] [2022-11-15 22:19:39,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:39,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 22:19:39,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:39,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 22:19:39,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 22:19:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:39,606 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:39,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 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-15 22:19:39,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:39,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:39,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-11-15 22:19:39,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-11-15 22:19:39,869 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-11-15 22:19:39,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-15 22:19:39,880 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-15 22:19:39,882 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE,SAFE (1/2) [2022-11-15 22:19:39,892 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:19:39,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 22:19:39,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:39,895 INFO L229 MonitoredProcess]: Starting monitored process 3 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-15 22:19:39,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-11-15 22:19:39,898 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 22:19:39,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2022-11-15 22:19:39,899 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;@756fa3a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 22:19:39,899 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-15 22:19:39,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:39,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:39,993 INFO L85 PathProgramCache]: Analyzing trace with hash -143962929, now seen corresponding path program 1 times [2022-11-15 22:19:39,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:39,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939599486] [2022-11-15 22:19:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:39,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:40,057 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-15 22:19:40,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:40,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939599486] [2022-11-15 22:19:40,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939599486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:40,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:40,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 22:19:40,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272412009] [2022-11-15 22:19:40,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:40,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 22:19:40,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 22:19:40,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 22:19:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,059 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:40,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-15 22:19:40,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-15 22:19:40,075 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:40,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:40,076 INFO L85 PathProgramCache]: Analyzing trace with hash 585022085, now seen corresponding path program 1 times [2022-11-15 22:19:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:40,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826041111] [2022-11-15 22:19:40,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:40,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:40,273 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-15 22:19:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:40,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826041111] [2022-11-15 22:19:40,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826041111] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:40,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:40,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 22:19:40,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378012536] [2022-11-15 22:19:40,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:40,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-15 22:19:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:40,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-15 22:19:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-15 22:19:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,275 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:40,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-15 22:19:40,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,275 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:40,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-15 22:19:40,351 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:40,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:40,352 INFO L85 PathProgramCache]: Analyzing trace with hash -670941291, now seen corresponding path program 1 times [2022-11-15 22:19:40,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:40,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015825556] [2022-11-15 22:19:40,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:40,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:40,498 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-15 22:19:40,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:40,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015825556] [2022-11-15 22:19:40,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015825556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:40,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:40,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 22:19:40,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886632474] [2022-11-15 22:19:40,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:40,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-15 22:19:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:40,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-15 22:19:40,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-15 22:19:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,500 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:40,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-15 22:19:40,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:40,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:40,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-15 22:19:40,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:40,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:40,540 INFO L85 PathProgramCache]: Analyzing trace with hash 726380279, now seen corresponding path program 1 times [2022-11-15 22:19:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:40,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278555195] [2022-11-15 22:19:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:40,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:40,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:40,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278555195] [2022-11-15 22:19:40,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278555195] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:19:40,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504986303] [2022-11-15 22:19:40,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:40,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:40,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:40,697 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-15 22:19:40,700 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-15 22:19:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:40,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-15 22:19:40,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:19:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:40,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 22:19:40,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:40,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504986303] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 22:19:40,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 22:19:40,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-15 22:19:40,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274415844] [2022-11-15 22:19:40,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 22:19:40,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-15 22:19:40,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:40,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-15 22:19:40,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-15 22:19:40,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,987 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:40,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 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-15 22:19:40,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:40,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:40,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:40,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:41,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:41,088 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-15 22:19:41,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:41,274 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:41,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:41,274 INFO L85 PathProgramCache]: Analyzing trace with hash -35740873, now seen corresponding path program 2 times [2022-11-15 22:19:41,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:41,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440562303] [2022-11-15 22:19:41,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:41,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:41,491 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-15 22:19:41,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:41,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440562303] [2022-11-15 22:19:41,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440562303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:41,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 22:19:41,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 22:19:41,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489784730] [2022-11-15 22:19:41,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:41,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-15 22:19:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-15 22:19:41,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-15 22:19:41,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:41,496 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:41,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-15 22:19:41,496 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:41,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:41,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:41,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:41,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:41,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-15 22:19:41,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:41,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:41,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1811277115, now seen corresponding path program 1 times [2022-11-15 22:19:41,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:41,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808885679] [2022-11-15 22:19:41,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:41,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:41,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:41,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808885679] [2022-11-15 22:19:41,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808885679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:19:41,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127230661] [2022-11-15 22:19:41,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:41,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:41,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:41,801 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-15 22:19:41,826 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-15 22:19:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:41,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-15 22:19:41,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:19:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:42,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 22:19:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:42,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127230661] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 22:19:42,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 22:19:42,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-15 22:19:42,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72767007] [2022-11-15 22:19:42,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 22:19:42,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-15 22:19:42,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:42,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-15 22:19:42,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-15 22:19:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:42,232 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:42,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 19.72222222222222) internal successors, (355), 18 states have internal predecessors, (355), 0 states have call successors, (0), 0 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-15 22:19:42,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:42,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:42,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:42,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:42,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:42,232 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:42,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:19:42,384 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-15 22:19:42,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:42,592 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash 890448325, now seen corresponding path program 2 times [2022-11-15 22:19:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:42,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483384867] [2022-11-15 22:19:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:43,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:43,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483384867] [2022-11-15 22:19:43,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483384867] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:19:43,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486015852] [2022-11-15 22:19:43,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 22:19:43,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:43,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:43,081 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-15 22:19:43,130 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-15 22:19:43,258 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-15 22:19:43,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 22:19:43,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-15 22:19:43,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:19:43,287 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 658 trivial. 0 not checked. [2022-11-15 22:19:43,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-15 22:19:43,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486015852] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 22:19:43,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-15 22:19:43,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2022-11-15 22:19:43,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732316564] [2022-11-15 22:19:43,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 22:19:43,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-15 22:19:43,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:43,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-15 22:19:43,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-11-15 22:19:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:43,289 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:43,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 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-15 22:19:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:19:43,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:43,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:19:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:19:43,346 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-15 22:19:43,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:43,547 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:43,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1506502106, now seen corresponding path program 1 times [2022-11-15 22:19:43,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:43,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639944422] [2022-11-15 22:19:43,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:43,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:44,126 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:44,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:44,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639944422] [2022-11-15 22:19:44,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639944422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:19:44,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022063947] [2022-11-15 22:19:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:44,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:44,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:44,129 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-15 22:19:44,131 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-15 22:19:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:44,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-15 22:19:44,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:19:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:44,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 22:19:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:44,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022063947] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 22:19:44,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 22:19:44,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-15 22:19:44,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061435492] [2022-11-15 22:19:44,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 22:19:44,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-15 22:19:44,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:44,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-15 22:19:44,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-15 22:19:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:44,984 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:44,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 17.705882352941178) internal successors, (602), 34 states have internal predecessors, (602), 0 states have call successors, (0), 0 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-15 22:19:44,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:44,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:44,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:44,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:44,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:44,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:19:44,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:19:44,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:19:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:19:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-15 22:19:45,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-15 22:19:45,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:45,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:45,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:45,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1007172646, now seen corresponding path program 2 times [2022-11-15 22:19:45,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:45,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721833911] [2022-11-15 22:19:45,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:45,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:46,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:46,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721833911] [2022-11-15 22:19:46,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721833911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:19:46,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729301836] [2022-11-15 22:19:46,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 22:19:46,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:46,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:46,979 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-15 22:19:46,989 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-15 22:19:47,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 22:19:47,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 22:19:47,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-15 22:19:47,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:19:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:47,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 22:19:48,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 22:19:48,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729301836] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 22:19:48,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 22:19:48,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2022-11-15 22:19:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973635130] [2022-11-15 22:19:48,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 22:19:48,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-15 22:19:48,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:48,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-15 22:19:48,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-11-15 22:19:48,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:48,554 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:48,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 17.6046511627907) internal successors, (757), 43 states have internal predecessors, (757), 0 states have call successors, (0), 0 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-15 22:19:48,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:48,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:48,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:48,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:48,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:48,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:19:48,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:19:48,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-15 22:19:48,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:49,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:19:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:19:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-15 22:19:49,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-15 22:19:49,305 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-15 22:19:49,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:49,494 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash 145283426, now seen corresponding path program 3 times [2022-11-15 22:19:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:49,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565717216] [2022-11-15 22:19:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:49,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:19:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 1889 proven. 66 refuted. 0 times theorem prover too weak. 3955 trivial. 0 not checked. [2022-11-15 22:19:52,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:19:52,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565717216] [2022-11-15 22:19:52,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565717216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:19:52,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933020075] [2022-11-15 22:19:52,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-15 22:19:52,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:19:52,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:19:52,986 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-15 22:19:53,014 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-15 22:19:53,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-15 22:19:53,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 22:19:53,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-15 22:19:53,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:19:55,721 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-15 22:19:55,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:55,780 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-15 22:19:55,925 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:19:55,934 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:19:55,934 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-15 22:19:55,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:19:55,980 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-15 22:19:55,999 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-15 22:19:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 625 proven. 434 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2022-11-15 22:19:56,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 22:19:56,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:19:56,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-15 22:19:56,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:19:56,288 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 36 treesize of output 35 [2022-11-15 22:19:56,309 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 7 treesize of output 3 [2022-11-15 22:19:57,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5910 backedges. 625 proven. 434 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2022-11-15 22:19:57,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933020075] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 22:19:57,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 22:19:57,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 37 [2022-11-15 22:19:57,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460678325] [2022-11-15 22:19:57,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 22:19:57,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-15 22:19:57,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:19:57,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-15 22:19:57,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1167, Unknown=4, NotChecked=0, Total=1332 [2022-11-15 22:19:57,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:57,140 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:19:57,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 14.135135135135135) internal successors, (523), 37 states have internal predecessors, (523), 0 states have call successors, (0), 0 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-15 22:19:57,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:57,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:57,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:57,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:57,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:57,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:19:57,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:19:57,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-15 22:19:57,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-15 22:19:57,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:19:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:19:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:19:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:19:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:19:57,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-15 22:19:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-15 22:19:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-15 22:19:57,806 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-15 22:19:58,011 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,SelfDestructingSolverStorable10 [2022-11-15 22:19:58,011 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:19:58,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:19:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2000058640, now seen corresponding path program 1 times [2022-11-15 22:19:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:19:58,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32000323] [2022-11-15 22:19:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:19:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:19:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:20:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3613 proven. 155 refuted. 0 times theorem prover too weak. 2122 trivial. 0 not checked. [2022-11-15 22:20:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:20:01,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32000323] [2022-11-15 22:20:01,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32000323] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:20:01,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619436196] [2022-11-15 22:20:01,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:20:01,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:20:01,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:20:01,796 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-15 22:20:01,798 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-15 22:20:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:20:02,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-15 22:20:02,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:20:02,678 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-15 22:20:02,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:02,730 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-15 22:20:02,888 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:20:02,896 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:20:02,896 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 31 treesize of output 27 [2022-11-15 22:20:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:02,935 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-15 22:20:03,065 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-15 22:20:03,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:03,140 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-15 22:20:03,333 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:20:03,339 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:20:03,340 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 31 treesize of output 27 [2022-11-15 22:20:03,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:03,383 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-15 22:20:03,416 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-15 22:20:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2400 proven. 30 refuted. 0 times theorem prover too weak. 3460 trivial. 0 not checked. [2022-11-15 22:20:03,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 22:20:03,629 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1711 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1709) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1711)) .cse1))))) is different from false [2022-11-15 22:20:03,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1711 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1709) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1711)) .cse1)) 20))) is different from false [2022-11-15 22:20:03,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1711 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1709) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1711)) .cse1)) 20))) is different from false [2022-11-15 22:20:03,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1711 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1709) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1711)) .cse1)) 20))) is different from false [2022-11-15 22:20:03,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1706 Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1711 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1706) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1709) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1711)) .cse1)) 20))) is different from false [2022-11-15 22:20:03,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1706 Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1711 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (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_1704)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1706) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1709) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1711)) .cse1)) 20))) is different from false [2022-11-15 22:20:03,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1706 Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1711 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1704)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1706) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1709) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1711)) .cse1))))) is different from false [2022-11-15 22:20:03,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1704 Int) (v_ArrVal_1706 Int) (v_ArrVal_1709 (Array Int Int)) (v_ArrVal_1711 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1704)))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1706) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_1709) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_1711)) .cse1)) 20))) is different from false [2022-11-15 22:20:04,218 INFO L321 Elim1Store]: treesize reduction 335, result has 45.1 percent of original size [2022-11-15 22:20:04,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 457 treesize of output 520 [2022-11-15 22:20:04,318 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-15 22:20:04,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 375 treesize of output 509 [2022-11-15 22:20:04,348 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-15 22:20:04,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 553 treesize of output 653 [2022-11-15 22:20:04,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:20:04,376 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 360 treesize of output 348 [2022-11-15 22:20:04,411 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 225 treesize of output 189 [2022-11-15 22:20:04,472 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-15 22:20:04,506 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-15 22:20:04,532 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-15 22:20:04,540 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-15 22:20:04,566 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:20:04,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 135 [2022-11-15 22:20:04,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:20:04,601 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 87 treesize of output 83 [2022-11-15 22:20:04,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:20:04,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 174 [2022-11-15 22:20:04,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:20:04,831 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 88 treesize of output 76 [2022-11-15 22:20:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 2275 proven. 75 refuted. 0 times theorem prover too weak. 3460 trivial. 80 not checked. [2022-11-15 22:20:05,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619436196] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 22:20:05,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 22:20:05,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 21] total 53 [2022-11-15 22:20:05,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596107818] [2022-11-15 22:20:05,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 22:20:05,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-15 22:20:05,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:20:05,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-15 22:20:05,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=1599, Unknown=8, NotChecked=744, Total=2756 [2022-11-15 22:20:05,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:20:05,082 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:20:05,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 12.377358490566039) internal successors, (656), 53 states have internal predecessors, (656), 0 states have call successors, (0), 0 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-15 22:20:05,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:20:05,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:20:05,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:20:05,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:20:05,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:20:05,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:20:05,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:20:05,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-15 22:20:05,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-15 22:20:05,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-15 22:20:05,083 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:20:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:20:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:20:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:20:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:20:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:20:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:20:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:20:06,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-15 22:20:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-15 22:20:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-15 22:20:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-15 22:20:06,493 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-15 22:20:06,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:20:06,693 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:20:06,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:20:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash -107922583, now seen corresponding path program 2 times [2022-11-15 22:20:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:20:06,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841703468] [2022-11-15 22:20:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:20:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:20:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:20:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 4283 proven. 292 refuted. 0 times theorem prover too weak. 1605 trivial. 0 not checked. [2022-11-15 22:20:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:20:15,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841703468] [2022-11-15 22:20:15,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841703468] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:20:15,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188239504] [2022-11-15 22:20:15,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 22:20:15,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:20:15,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:20:15,474 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-15 22:20:15,476 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-15 22:20:15,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 22:20:15,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 22:20:15,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-15 22:20:15,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:20:16,386 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-15 22:20:16,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:16,435 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-15 22:20:16,613 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:20:16,619 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 22:20:16,620 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-15 22:20:16,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:16,652 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-15 22:20:16,794 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-15 22:20:16,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:16,858 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-15 22:20:17,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:20:17,056 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 22:20:17,056 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-15 22:20:17,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:17,097 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-15 22:20:17,243 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-15 22:20:17,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:17,301 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-15 22:20:17,472 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:20:17,480 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 22:20:17,480 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-15 22:20:17,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:17,513 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-15 22:20:17,655 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-15 22:20:17,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:17,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 16 treesize of output 18 [2022-11-15 22:20:17,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:20:17,852 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:20:17,852 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-15 22:20:17,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:20:17,904 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-15 22:20:17,918 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-15 22:20:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 2365 proven. 212 refuted. 0 times theorem prover too weak. 3603 trivial. 0 not checked. [2022-11-15 22:20:17,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 22:20:18,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2117 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse1)) 20))) is different from false [2022-11-15 22:20:18,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2117 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2117)) .cse1)) 20))) is different from false [2022-11-15 22:20:18,289 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2117 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2113) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse1)) 20))) is different from false [2022-11-15 22:20:18,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2117 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (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_2110)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2113) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse1))))) is different from false [2022-11-15 22:20:18,312 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse0 .cse1))) (forall ((v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2117 Int)) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2110))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2113) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse3)) 20)))))) is different from false [2022-11-15 22:20:18,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2113) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse3)) 20))))) is different from false [2022-11-15 22:20:18,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2106) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2113) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse1))))))) is different from false [2022-11-15 22:20:18,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int)) (let ((.cse2 (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_2104)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2106) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse4 (select .cse2 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2113) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse4 .cse1))))))) is different from false [2022-11-15 22:20:18,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| 4)) v_ArrVal_2104))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2106) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse0 .cse1))) (not (= 20 (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2113) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse1))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| (select .cse7 .cse6)))))) is different from false [2022-11-15 22:20:18,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| Int) (v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (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 .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| 4)) v_ArrVal_2104))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2106) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse2 .cse3))) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2113) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse4 (+ (* 4 (select .cse4 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse3) 20))))))) is different from false [2022-11-15 22:20:19,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| Int) (v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2102))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| 4)) v_ArrVal_2104))) (store (store .cse8 .cse6 v_ArrVal_2106) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| (select .cse2 .cse1))) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse5 .cse6 v_ArrVal_2113) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2117)) .cse1) 20)))))))) is different from false [2022-11-15 22:20:19,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| Int) (v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2102))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| 4)) v_ArrVal_2104))) (store (store .cse8 .cse4 v_ArrVal_2106) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse3 .cse4 v_ArrVal_2113) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2117)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| (select .cse6 .cse1))))))))) is different from false [2022-11-15 22:20:19,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2098 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| Int) (v_ArrVal_2110 Int) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2113 Int) (v_ArrVal_2102 (Array Int Int)) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2098) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2102))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| 4)) v_ArrVal_2104))) (store (store .cse8 .cse6 v_ArrVal_2106) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| (select .cse2 .cse1))) (not (= (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse5 .cse6 v_ArrVal_2113) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_2117)) .cse1) 20)))))))) is different from false [2022-11-15 22:20:20,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int) (v_ArrVal_2098 Int) (v_ArrVal_2097 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 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_2097)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2098) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2102))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| 4)) v_ArrVal_2104))) (store (store .cse8 .cse4 v_ArrVal_2106) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse3 .cse4 v_ArrVal_2113) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| (select .cse6 .cse1))))))))) is different from false [2022-11-15 22:20:20,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_266| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_266| (select .cse0 .cse1))) (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int) (v_ArrVal_2098 Int) (v_ArrVal_2097 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| Int) (v_ArrVal_2110 Int) (v_ArrVal_2113 Int) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_266| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2097))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2098) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2102))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| 4)) v_ArrVal_2104))) (store (store .cse10 .cse7 v_ArrVal_2106) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| (select .cse2 .cse3))) (not (= (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse8 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse6 .cse7 v_ArrVal_2113) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_2117)) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse8 .cse3)))))))))))) is different from false [2022-11-15 22:20:20,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int) (v_ArrVal_2098 Int) (v_ArrVal_2097 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| Int) (v_ArrVal_2110 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_266| Int) (v_ArrVal_2113 Int) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int)) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse7 (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 .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_266| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2097))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2098) .cse8 (+ (select .cse11 .cse8) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2102))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| 4)) v_ArrVal_2104))) (store (store .cse10 .cse5 v_ArrVal_2106) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse4 .cse5 v_ArrVal_2113) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2117)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_266| (select .cse7 .cse8)))))))))) is different from false [2022-11-15 22:20:20,457 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2109 (Array Int Int)) (v_ArrVal_2116 (Array Int Int)) (v_ArrVal_2102 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| Int) (v_ArrVal_2095 (Array Int Int)) (v_ArrVal_2098 Int) (v_ArrVal_2097 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| Int) (v_ArrVal_2110 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_266| Int) (v_ArrVal_2113 Int) (v_ArrVal_2104 Int) (v_ArrVal_2106 Int) (v_ArrVal_2117 Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2095))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse7 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_266| 4) |c_~#queue~0.offset|) v_ArrVal_2097))) (store (store .cse11 .cse4 v_ArrVal_2098) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2102))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| 4)) v_ArrVal_2104))) (store (store .cse9 .cse4 v_ArrVal_2106) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2109))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| 4)) v_ArrVal_2110))) (store (store .cse3 .cse4 v_ArrVal_2113) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2116) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2117)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_260| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_263| (select .cse6 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_266| (select .cse7 .cse1))))))))))) is different from false [2022-11-15 22:20:20,552 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:20:20,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 2165 treesize of output 1505 [2022-11-15 22:20:20,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:20:20,575 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 1857 treesize of output 1831 [2022-11-15 22:20:20,588 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 1936 treesize of output 1912 [2022-11-15 22:20:20,602 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 1691 treesize of output 1595 [2022-11-15 22:20:20,615 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 1957 treesize of output 1893 [2022-11-15 22:20:20,632 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 2078 treesize of output 2038 [2022-11-15 22:20:20,674 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-15 22:20:20,737 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:20:20,738 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 528 treesize of output 508 [2022-11-15 22:20:25,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 2323 proven. 82 refuted. 6 times theorem prover too weak. 3603 trivial. 166 not checked. [2022-11-15 22:20:25,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188239504] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 22:20:25,182 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 22:20:25,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 40] total 100 [2022-11-15 22:20:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952464412] [2022-11-15 22:20:25,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 22:20:25,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-11-15 22:20:25,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 22:20:25,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-11-15 22:20:25,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1068, Invalid=5734, Unknown=72, NotChecked=3026, Total=9900 [2022-11-15 22:20:25,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:20:25,187 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 22:20:25,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 8.19) internal successors, (819), 100 states have internal predecessors, (819), 0 states have call successors, (0), 0 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-15 22:20:25,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:20:25,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:20:25,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:20:25,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:20:25,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:20:25,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:20:25,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:20:25,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-15 22:20:25,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-15 22:20:25,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-15 22:20:25,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-15 22:20:25,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-15 22:21:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-15 22:21:09,859 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-15 22:21:10,053 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,SelfDestructingSolverStorable12 [2022-11-15 22:21:10,053 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-15 22:21:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 22:21:10,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1911747635, now seen corresponding path program 3 times [2022-11-15 22:21:10,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 22:21:10,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137568426] [2022-11-15 22:21:10,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 22:21:10,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 22:21:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 22:21:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6352 backedges. 4279 proven. 952 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2022-11-15 22:21:31,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 22:21:31,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137568426] [2022-11-15 22:21:31,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137568426] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 22:21:31,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674404651] [2022-11-15 22:21:31,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-15 22:21:31,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 22:21:31,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 22:21:31,368 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 22:21:31,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-15 22:32:54,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-11-15 22:32:54,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 22:32:54,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 317 conjunts are in the unsatisfiable core [2022-11-15 22:32:54,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 22:32:56,816 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-15 22:32:56,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:32:56,900 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-15 22:32:57,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:32:57,244 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-15 22:32:57,244 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-15 22:32:57,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:32:57,332 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-15 22:32:57,659 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-15 22:32:57,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:32:57,783 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-15 22:32:58,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:32:58,164 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:32:58,164 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 31 treesize of output 27 [2022-11-15 22:32:58,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:32:58,243 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-15 22:32:58,565 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-15 22:32:58,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:32:58,686 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-15 22:32:59,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:32:59,055 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:32:59,056 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 31 treesize of output 27 [2022-11-15 22:32:59,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:32:59,102 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-15 22:32:59,297 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-15 22:32:59,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:32:59,360 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-15 22:32:59,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:32:59,572 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:32:59,573 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 31 treesize of output 27 [2022-11-15 22:32:59,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:32:59,610 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-15 22:32:59,780 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-15 22:32:59,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:32:59,832 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-15 22:33:00,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:33:00,008 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:33:00,008 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 31 treesize of output 27 [2022-11-15 22:33:00,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:33:00,047 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-15 22:33:00,216 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-15 22:33:00,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:33:00,270 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-15 22:33:00,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:33:00,449 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:33:00,457 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 31 treesize of output 27 [2022-11-15 22:33:00,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:33:00,494 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-15 22:33:00,675 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-15 22:33:00,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:33:00,733 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-15 22:33:00,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:33:00,930 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:33:00,931 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 31 treesize of output 27 [2022-11-15 22:33:00,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:33:00,982 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-15 22:33:01,187 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-15 22:33:01,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:33:01,249 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-15 22:33:01,453 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 22:33:01,459 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-15 22:33:01,460 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 31 treesize of output 27 [2022-11-15 22:33:01,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 22:33:01,503 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-15 22:33:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6352 backedges. 4293 proven. 938 refuted. 0 times theorem prover too weak. 1121 trivial. 0 not checked. [2022-11-15 22:33:01,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 22:33:01,633 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 10 treesize of output 4 [2022-11-15 22:33:02,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (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 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1))))) is different from false [2022-11-15 22:33:02,305 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int)) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1))))) (= .cse4 20)))) is different from false [2022-11-15 22:33:02,322 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2544 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2544) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse2)) 20)))))) is different from false [2022-11-15 22:33:02,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int)) (let ((.cse3 (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_2542)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2544) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_2550)) .cse2)) 20)))))) is different from false [2022-11-15 22:33:02,360 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2542)))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2544) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1)) 20)) (= 20 .cse4)))))) is different from false [2022-11-15 22:33:02,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int)) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2542)))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (not (= 20 (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2544) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse2))))))))) is different from false [2022-11-15 22:33:02,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2544) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse2)))))))) is different from false [2022-11-15 22:33:02,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse6 .cse7 (+ (select .cse6 .cse7) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2544) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse2)))))))) is different from false [2022-11-15 22:33:02,944 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (select .cse6 .cse7))) (or (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2544) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse2)))))))) (= .cse8 20)))) is different from false [2022-11-15 22:33:02,989 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (or (= .cse0 20) (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2537 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2537) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2544) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse3) 20)))))))))) is different from false [2022-11-15 22:33:03,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 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_2535)) (.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2537) .cse8 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_2542)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 20 .cse0) (= .cse1 20) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2544) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse3)))))))))) is different from false [2022-11-15 22:33:03,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2535)))) (let ((.cse1 (select .cse7 .cse8))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2537) .cse8 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse3) 4)) v_ArrVal_2542)))) (let ((.cse0 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2544) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse3))))))))))) is different from false [2022-11-15 22:33:03,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse8 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse9 (+ (* (select .cse9 .cse8) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2535)))) (let ((.cse5 (select .cse7 .cse8))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2537) .cse8 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2544) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2550)) .cse1))) (= .cse4 20) (= .cse5 20))))))))) is different from false [2022-11-15 22:33:03,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse2) 4)) v_ArrVal_2535)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2537) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2544) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2550)) .cse2) 20)) (= .cse6 20))))))))) is different from false [2022-11-15 22:33:03,979 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2537) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_2542)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2544) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse2) 20)) (= .cse6 20))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-11-15 22:33:04,009 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse11 .cse12))) (or (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse11 .cse12 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse2))) (let ((.cse3 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse5 v_ArrVal_2537) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse4 (let ((.cse7 (select .cse3 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) v_ArrVal_2542)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2544) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse2) 20)) (= .cse6 20))))))))) (= .cse13 20)))) is different from false [2022-11-15 22:33:04,079 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse12 .cse13))) (or (= .cse0 20) (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2531) .cse13 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_2537) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse3) 4)) v_ArrVal_2542)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2544) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse3) 20)) (= .cse7 20)))))))))))) is different from false [2022-11-15 22:33:04,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse12 (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_2529)) (.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse12 .cse13))) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2531) .cse13 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* 4 (select .cse11 .cse2))) v_ArrVal_2535)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_2537) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse4 (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) v_ArrVal_2542)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2544) .cse2 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2550)) .cse2) 20)) (= .cse6 20) (= .cse7 20))))))))))) is different from false [2022-11-15 22:33:04,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse12 (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse14 (+ (* (select .cse14 .cse13) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2529)))) (let ((.cse7 (select .cse12 .cse13))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2531) .cse13 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_2537) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ (* 4 (select .cse8 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 20 .cse0) (= 20 .cse1) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2544) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse3))) (= .cse7 20)))))))))))) is different from false [2022-11-15 22:33:04,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse13 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse12 (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse14 (+ (* (select .cse14 .cse13) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2529)))) (let ((.cse7 (select .cse12 .cse13))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse12 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2531) .cse13 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse3) 4)) v_ArrVal_2535)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse10 .cse3))) (let ((.cse4 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse6 v_ArrVal_2537) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse8 (select .cse4 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 20 .cse0) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2544) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse3) 20)) (= .cse7 20)))))))))))) is different from false [2022-11-15 22:33:04,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse13 .cse4))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_2531) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse4) 4)) v_ArrVal_2535)))) (let ((.cse2 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2537) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse6 (let ((.cse8 (select .cse5 |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse4) 4)) v_ArrVal_2542)))) (let ((.cse1 (select .cse6 .cse4))) (or (= .cse0 20) (= .cse1 20) (= .cse2 20) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2544) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse3 (+ (* 4 (select .cse3 .cse4)) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse4) 20))))))))))))) is different from false [2022-11-15 22:33:05,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse15 .cse16 (+ (select .cse15 .cse16) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse13 .cse2))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse5 v_ArrVal_2531) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_2535)))) (let ((.cse7 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_2537) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse4 (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2544) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2550)) .cse2) 20)) (= .cse6 20) (= .cse7 20)))))))))))) is different from false [2022-11-15 22:33:05,351 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse15 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse16 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse15 .cse16 (+ (select .cse15 .cse16) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse13 .cse2))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse5 v_ArrVal_2531) .cse2 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_2535)))) (let ((.cse7 (select .cse10 .cse2))) (let ((.cse3 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse5 v_ArrVal_2537) .cse2 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse4 (let ((.cse8 (select .cse3 |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse0 (select .cse4 .cse2))) (or (= .cse0 20) (not (= (select (let ((.cse1 (select (store (store .cse3 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_2544) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) v_ArrVal_2550)) .cse2) 20)) (= .cse6 20) (= .cse7 20))))))))))))) is different from false [2022-11-15 22:33:05,384 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse16 .cse17))) (or (= .cse0 20) (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse16 .cse17 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2531) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_2535)))) (let ((.cse8 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2537) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse1 (select .cse5 .cse3))) (or (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2544) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2550)) .cse3) 20)) (= .cse7 20) (= .cse8 20))))))))))))))) is different from false [2022-11-15 22:33:05,477 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse16 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse16 .cse17))) (or (= .cse0 20) (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2524) .cse17 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse14 .cse4))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_2531) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse2 (select .cse11 .cse4))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse7 v_ArrVal_2537) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse6 (let ((.cse9 (select .cse5 |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse4)) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse1 (select .cse6 .cse4))) (or (= .cse1 20) (= 20 .cse2) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2544) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_2550)) .cse4) 20)) (= .cse8 20))))))))))))))) is different from false [2022-11-15 22:33:05,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse16 (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_2522)) (.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse16 .cse17))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2524) .cse17 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_2529)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2531) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse7 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2537) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse3) 4)) v_ArrVal_2542)))) (let ((.cse0 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2544) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse3))) (= 20 .cse7) (= .cse8 20)))))))))))))) is different from false [2022-11-15 22:33:05,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse16 (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse18 (+ (* (select .cse18 .cse17) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2522)))) (let ((.cse7 (select .cse16 .cse17))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2524) .cse17 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse14 .cse1))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_2531) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* 4 (select .cse12 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse6 (select .cse11 .cse1))) (let ((.cse2 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_2537) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1) 20)) (= .cse6 20) (= .cse5 20) (= 20 .cse7) (= .cse8 20))))))))))))))) is different from false [2022-11-15 22:33:05,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse17 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse16 (let ((.cse18 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse18 (+ (* (select .cse18 .cse17) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2522)))) (let ((.cse8 (select .cse16 .cse17))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse13 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse16 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2524) .cse17 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse1))) v_ArrVal_2529)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse7 (select .cse14 .cse1))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_2531) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse6 (select .cse11 .cse1))) (let ((.cse2 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse4 v_ArrVal_2537) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse9 (select .cse2 |c_~#queue~0.base|))) (store .cse9 (+ |c_~#queue~0.offset| (* (select .cse9 .cse1) 4)) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1) 20)) (= 20 .cse6) (= .cse5 20) (= 20 .cse7) (= .cse8 20))))))))))))))) is different from false [2022-11-15 22:33:06,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse16 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse17 .cse3))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse6 v_ArrVal_2524) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse3) 4)) v_ArrVal_2529)))) (let ((.cse1 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2531) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse3) 4)) v_ArrVal_2535)))) (let ((.cse0 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2537) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse7 (select .cse5 .cse3))) (or (= .cse0 20) (= .cse1 20) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2544) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse3) 20)) (= .cse7 20) (= .cse8 20))))))))))))))) is different from false [2022-11-15 22:33:06,574 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse17 .cse3))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse6 v_ArrVal_2524) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* 4 (select .cse15 .cse3))) v_ArrVal_2529)))) (let ((.cse1 (select .cse14 .cse3))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse6 v_ArrVal_2531) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse0 (select .cse11 .cse3))) (let ((.cse4 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse6 v_ArrVal_2537) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse9 (select .cse4 |c_~#queue~0.base|))) (store .cse9 (+ (* 4 (select .cse9 .cse3)) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse7 (select .cse5 .cse3))) (or (= 20 .cse0) (= 20 .cse1) (not (= (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2544) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse3) 20)) (= .cse8 20) (= .cse7 20))))))))))))))) is different from false [2022-11-15 22:33:07,224 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int)) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse19 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse20 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse19 .cse20 (+ (select .cse19 .cse20) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse17 .cse4))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse7 v_ArrVal_2524) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ |c_~#queue~0.offset| (* (select .cse15 .cse4) 4)) v_ArrVal_2529)))) (let ((.cse1 (select .cse14 .cse4))) (let ((.cse10 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse7 v_ArrVal_2531) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse11 (let ((.cse12 (select .cse10 |c_~#queue~0.base|))) (store .cse12 (+ |c_~#queue~0.offset| (* (select .cse12 .cse4) 4)) v_ArrVal_2535)))) (let ((.cse2 (select .cse11 .cse4))) (let ((.cse5 (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse7 v_ArrVal_2537) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse6 (let ((.cse9 (select .cse5 |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse8 (select .cse6 .cse4))) (or (= .cse0 20) (= .cse1 20) (= 20 .cse2) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2544) .cse4 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_2550)) .cse4) 20)) (= 20 .cse8))))))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-11-15 22:33:07,595 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse20 .cse21))) (or (= .cse0 20) (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2516) .cse21 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse4) 4)) v_ArrVal_2522)))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse18 .cse4))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse7 v_ArrVal_2524) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse8 (select .cse15 .cse4))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse7 v_ArrVal_2531) .cse4 (+ 1 .cse8))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse9 (select .cse12 .cse4))) (let ((.cse5 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse7 v_ArrVal_2537) .cse4 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse6 (let ((.cse10 (select .cse5 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse4) 4)) v_ArrVal_2542)))) (let ((.cse2 (select .cse6 .cse4))) (or (= .cse1 20) (= .cse2 20) (not (= (select (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse6 .cse7 v_ArrVal_2544) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_2550)) .cse4) 20)) (= 20 .cse8) (= .cse9 20)))))))))))))))))) is different from false [2022-11-15 22:33:07,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse20 (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_2515)) (.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse20 .cse21))) (let ((.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2516) .cse21 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse4 (select .cse18 .cse6))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse9 v_ArrVal_2524) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse1 (select .cse15 .cse6))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse9 v_ArrVal_2531) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse2 (select .cse12 .cse6))) (let ((.cse7 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_2537) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse8 (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse0 (select .cse8 .cse6))) (or (= 20 .cse0) (= .cse1 20) (= .cse2 20) (= 20 .cse3) (= .cse4 20) (not (= (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2544) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)) v_ArrVal_2550)) .cse6) 20)))))))))))))))))) is different from false [2022-11-15 22:33:07,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse20 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse22 (+ (* (select .cse22 .cse21) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2515)))) (let ((.cse8 (select .cse20 .cse21))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse20 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2516) .cse21 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse1) 4)) v_ArrVal_2522)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse18 .cse1))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse4 v_ArrVal_2524) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* (select .cse16 .cse1) 4)) v_ArrVal_2529)))) (let ((.cse6 (select .cse15 .cse1))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_2531) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse7 (select .cse12 .cse1))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2537) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse10 (select .cse2 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1))) (= .cse6 20) (= .cse7 20) (= .cse8 20) (= .cse5 20) (= 20 .cse9)))))))))))))))))) is different from false [2022-11-15 22:33:07,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse21 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse20 (let ((.cse22 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse22 (+ (* (select .cse22 .cse21) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2515)))) (let ((.cse9 (select .cse20 .cse21))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse20 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2516) .cse21 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* 4 (select .cse19 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse18 .cse1))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse4 v_ArrVal_2524) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse6 (select .cse15 .cse1))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse4 v_ArrVal_2531) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse7 (select .cse12 .cse1))) (let ((.cse2 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse4 v_ArrVal_2537) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse10 (select .cse2 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1) 20)) (= .cse6 20) (= .cse7 20) (= .cse8 20) (= .cse9 20) (= .cse5 20)))))))))))))))))) is different from false [2022-11-15 22:33:08,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse20 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2515)))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse21 .cse6))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse9 v_ArrVal_2516) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ |c_~#queue~0.offset| (* (select .cse19 .cse6) 4)) v_ArrVal_2522)))) (let ((.cse2 (select .cse18 .cse6))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse9 v_ArrVal_2524) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse3 (select .cse15 .cse6))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse9 v_ArrVal_2531) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse1 (select .cse12 .cse6))) (let ((.cse7 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_2537) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse8 (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse6) 4)) v_ArrVal_2542)))) (let ((.cse4 (select .cse8 .cse6))) (or (= 20 .cse0) (= .cse1 20) (= 20 .cse2) (= .cse3 20) (= .cse4 20) (not (= (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2544) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)) v_ArrVal_2550)) .cse6) 20))))))))))))))))))) is different from false [2022-11-15 22:33:08,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse20 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse3) 4)) v_ArrVal_2515)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse21 .cse3))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse6 v_ArrVal_2516) .cse3 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse9 (select .cse18 .cse3))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse6 v_ArrVal_2524) .cse3 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse8 (select .cse15 .cse3))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse6 v_ArrVal_2531) .cse3 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* 4 (select .cse13 .cse3))) v_ArrVal_2535)))) (let ((.cse7 (select .cse12 .cse3))) (let ((.cse4 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse6 v_ArrVal_2537) .cse3 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse10 (select .cse4 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse3) 4)) v_ArrVal_2542)))) (let ((.cse1 (select .cse5 .cse3))) (or (= 20 .cse0) (= 20 .cse1) (not (= 20 (select (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_2544) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_2550)) .cse3))) (= .cse7 20) (= .cse8 20) (= .cse9 20)))))))))))))))))) is different from false [2022-11-15 22:33:09,672 WARN L833 $PredicateComparison]: unable to prove that (or (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20) (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse20 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse24 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse23 .cse24 (+ (select .cse23 .cse24) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2515)))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse21 .cse6))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse9 v_ArrVal_2516) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* 4 (select .cse19 .cse6)) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse3 (select .cse18 .cse6))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse9 v_ArrVal_2524) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse2 (select .cse15 .cse6))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse9 v_ArrVal_2531) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ |c_~#queue~0.offset| (* (select .cse13 .cse6) 4)) v_ArrVal_2535)))) (let ((.cse4 (select .cse12 .cse6))) (let ((.cse7 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse9 v_ArrVal_2537) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse8 (let ((.cse10 (select .cse7 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse1 (select .cse8 .cse6))) (or (= .cse0 20) (= .cse1 20) (= 20 .cse2) (= 20 .cse3) (= .cse4 20) (not (= 20 (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2544) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse6) 4)) v_ArrVal_2550)) .cse6))))))))))))))))))))) is different from false [2022-11-15 22:33:09,721 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse25 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse24 .cse25))) (or (= .cse0 20) (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse24 .cse25 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2515)))) (let ((.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse22 .cse7))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse10 v_ArrVal_2516) .cse7 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* 4 (select .cse20 .cse7)) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse4 (select .cse19 .cse7))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse10 v_ArrVal_2524) .cse7 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse3 (select .cse16 .cse7))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse10 v_ArrVal_2531) .cse7 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse7) 4)) v_ArrVal_2535)))) (let ((.cse5 (select .cse13 .cse7))) (let ((.cse8 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse10 v_ArrVal_2537) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse9 (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse2 (select .cse9 .cse7))) (or (= .cse1 20) (= .cse2 20) (= 20 .cse3) (= 20 .cse4) (= .cse5 20) (not (= 20 (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2544) .cse7 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse7) 4)) v_ArrVal_2550)) .cse7))))))))))))))))))))))) is different from false [2022-11-15 22:33:09,902 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse23 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse24 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse25 (select .cse23 .cse24))) (or (forall ((v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse20 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse23 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2510) .cse24 (+ .cse25 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ (* (select .cse22 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2515)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse21 .cse5))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse8 v_ArrVal_2516) .cse5 (+ 1 .cse1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse9 (select .cse18 .cse5))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse8 v_ArrVal_2524) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ (* (select .cse16 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse0 (select .cse15 .cse5))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_2531) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse12 (let ((.cse13 (select .cse11 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse2 (select .cse12 .cse5))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2537) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse7 (let ((.cse10 (select .cse6 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse5) 4)) v_ArrVal_2542)))) (let ((.cse3 (select .cse7 .cse5))) (or (= .cse0 20) (= 20 .cse1) (= .cse2 20) (= 20 .cse3) (not (= 20 (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2544) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse5))) (= .cse9 20)))))))))))))))))) (= .cse25 20)))) is different from false [2022-11-15 22:33:10,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse24 (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_2507)) (.cse25 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (select .cse24 .cse25))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse24 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2510) .cse25 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse5) 4)) v_ArrVal_2515)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse22 .cse5))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse8 v_ArrVal_2516) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse10 (select .cse19 .cse5))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse8 v_ArrVal_2524) .cse5 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse0 (select .cse16 .cse5))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse8 v_ArrVal_2531) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse2 (select .cse13 .cse5))) (let ((.cse6 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_2537) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse7 (let ((.cse11 (select .cse6 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse9 (select .cse7 .cse5))) (or (= .cse0 20) (= .cse1 20) (= 20 .cse2) (= .cse3 20) (not (= (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2544) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse5) 20)) (= .cse10 20) (= 20 .cse9)))))))))))))))))))) is different from false [2022-11-15 22:33:10,171 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse25 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse24 (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse26 (+ (* (select .cse26 .cse25) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2507)))) (let ((.cse10 (select .cse24 .cse25))) (let ((.cse6 (+ 84 |c_~#queue~0.offset|)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse24 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2510) .cse25 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* 4 (select .cse23 .cse6)) |c_~#queue~0.offset|) v_ArrVal_2515)))) (let ((.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse0 (select .cse22 .cse6))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse9 v_ArrVal_2516) .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse2 (select .cse19 .cse6))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse9 v_ArrVal_2524) .cse6 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse3 (select .cse16 .cse6))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse9 v_ArrVal_2531) .cse6 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse6) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse4 (select .cse13 .cse6))) (let ((.cse7 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse9 v_ArrVal_2537) .cse6 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse8 (let ((.cse11 (select .cse7 |c_~#queue~0.base|))) (store .cse11 (+ (* 4 (select .cse11 .cse6)) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse1 (select .cse8 .cse6))) (or (= 20 .cse0) (= .cse1 20) (= .cse2 20) (= 20 .cse3) (= .cse4 20) (not (= 20 (select (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse8 .cse9 v_ArrVal_2544) .cse6 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* 4 (select .cse5 .cse6))) v_ArrVal_2550)) .cse6))) (= .cse10 20))))))))))))))))))))) is different from false [2022-11-15 22:33:10,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse25 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse24 (let ((.cse26 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse26 (+ (* (select .cse26 .cse25) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2507)))) (let ((.cse9 (select .cse24 .cse25))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse21 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse24 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2510) .cse25 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2515)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse10 (select .cse22 .cse1))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_2516) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse7 (select .cse19 .cse1))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse4 v_ArrVal_2524) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse8 (select .cse16 .cse1))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse4 v_ArrVal_2531) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse6 (select .cse13 .cse1))) (let ((.cse2 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2537) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse11 (select .cse2 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= 20 (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2550)) .cse1))) (= .cse6 20) (= .cse7 20) (= .cse5 20) (= 20 .cse8) (= 20 .cse9) (= .cse10 20))))))))))))))))))))) is different from false [2022-11-15 22:33:11,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse24 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse5) 4)) v_ArrVal_2507)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse10 (select .cse25 .cse5))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse8 v_ArrVal_2510) .cse5 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2515)))) (let ((.cse9 (select .cse22 .cse5))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse8 v_ArrVal_2516) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse0 (select .cse19 .cse5))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse8 v_ArrVal_2524) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse2 (select .cse16 .cse5))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse8 v_ArrVal_2531) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse1 (select .cse13 .cse5))) (let ((.cse6 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_2537) .cse5 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse7 (let ((.cse11 (select .cse6 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse3 (select .cse7 .cse5))) (or (= .cse0 20) (= 20 .cse1) (= .cse2 20) (= .cse3 20) (not (= (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2544) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)) v_ArrVal_2550)) .cse5) 20)) (= .cse9 20) (= .cse10 20))))))))))))))))))))) is different from false [2022-11-15 22:33:12,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2507)))) (let ((.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse25 .cse7))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse10 v_ArrVal_2510) .cse7 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse7) 4)) v_ArrVal_2515)))) (let ((.cse4 (select .cse22 .cse7))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse10 v_ArrVal_2516) .cse7 (+ 1 .cse4))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse1 (select .cse19 .cse7))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse10 v_ArrVal_2524) .cse7 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* (select .cse17 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse2 (select .cse16 .cse7))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse10 v_ArrVal_2531) .cse7 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse7) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse0 (select .cse13 .cse7))) (let ((.cse8 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse10 v_ArrVal_2537) .cse7 (+ 1 .cse0))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse9 (let ((.cse11 (select .cse8 |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse7) 4)) v_ArrVal_2542)))) (let ((.cse3 (select .cse9 .cse7))) (or (= 20 .cse0) (= .cse1 20) (= .cse2 20) (= .cse3 20) (= 20 .cse4) (= .cse5 20) (not (= (select (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse10 v_ArrVal_2544) .cse7 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse7)) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse7) 20)))))))))))))))))))))) is different from false [2022-11-15 22:33:12,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse27 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse28 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse27 .cse28 (+ (select .cse27 .cse28) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse1) 4)) v_ArrVal_2507)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse25 .cse1))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse4 v_ArrVal_2510) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse1) 4)) v_ArrVal_2515)))) (let ((.cse6 (select .cse22 .cse1))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_2516) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse10 (select .cse19 .cse1))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse4 v_ArrVal_2524) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse8 (select .cse16 .cse1))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse4 v_ArrVal_2531) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse7 (select .cse13 .cse1))) (let ((.cse2 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2537) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse11 (select .cse2 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2550)) .cse1) 20)) (= .cse6 20) (= .cse7 20) (= 20 .cse8) (= .cse5 20) (= .cse9 20) (= .cse10 20))))))))))))))))))))) is different from false [2022-11-15 22:33:12,521 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse27 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse28 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse27 .cse28 (+ (select .cse27 .cse28) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse1) 4)) v_ArrVal_2507)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse25 .cse1))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse4 v_ArrVal_2510) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse1) 4)) v_ArrVal_2515)))) (let ((.cse6 (select .cse22 .cse1))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_2516) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse10 (select .cse19 .cse1))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse4 v_ArrVal_2524) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse8 (select .cse16 .cse1))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse4 v_ArrVal_2531) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse7 (select .cse13 .cse1))) (let ((.cse2 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2537) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse11 (select .cse2 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2550)) .cse1) 20)) (= .cse6 20) (= .cse7 20) (= 20 .cse8) (= .cse5 20) (= .cse9 20) (= .cse10 20))))))))))))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-11-15 22:33:12,589 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse28 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse29 (select .cse27 .cse28))) (or (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse27 .cse28 (+ .cse29 1))) |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse1) 4)) v_ArrVal_2507)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse25 .cse1))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse4 v_ArrVal_2510) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse1) 4)) v_ArrVal_2515)))) (let ((.cse6 (select .cse22 .cse1))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_2516) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse10 (select .cse19 .cse1))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse4 v_ArrVal_2524) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse8 (select .cse16 .cse1))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse4 v_ArrVal_2531) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse7 (select .cse13 .cse1))) (let ((.cse2 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse4 v_ArrVal_2537) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse11 (select .cse2 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2550)) .cse1) 20)) (= .cse6 20) (= .cse7 20) (= 20 .cse8) (= .cse5 20) (= .cse9 20) (= .cse10 20))))))))))))))))))))) (= .cse29 20)))) is different from false [2022-11-15 22:33:12,819 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse28 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse29 (select .cse27 .cse28))) (or (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2503 Int) (v_ArrVal_2516 Int)) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse24 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse27 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2503) .cse28 (+ .cse29 1))) |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ (* (select .cse26 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2507)))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (select .cse25 .cse5))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse8 v_ArrVal_2510) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ (* (select .cse23 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2515)))) (let ((.cse0 (select .cse22 .cse5))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse8 v_ArrVal_2516) .cse5 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* 4 (select .cse20 .cse5)) |c_~#queue~0.offset|) v_ArrVal_2522)))) (let ((.cse2 (select .cse19 .cse5))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse8 v_ArrVal_2524) .cse5 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse5) 4)) v_ArrVal_2529)))) (let ((.cse10 (select .cse16 .cse5))) (let ((.cse12 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse8 v_ArrVal_2531) .cse5 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse13 (let ((.cse14 (select .cse12 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse5) 4)) v_ArrVal_2535)))) (let ((.cse1 (select .cse13 .cse5))) (let ((.cse6 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_2537) .cse5 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse7 (let ((.cse11 (select .cse6 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse9 (select .cse7 .cse5))) (or (= 20 .cse0) (= .cse1 20) (= .cse2 20) (= 20 .cse3) (not (= 20 (select (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_2544) .cse5 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse4 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)) v_ArrVal_2550)) .cse5))) (= .cse9 20) (= 20 .cse10))))))))))))))))))))) (= .cse29 20)))) is different from false [2022-11-15 22:33:13,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2501 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2503 Int) (v_ArrVal_2516 Int)) (let ((.cse28 (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_2501)) (.cse29 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse28 .cse29))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse25 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse28 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2503) .cse29 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse26 (let ((.cse27 (select .cse25 |c_~#queue~0.base|))) (store .cse27 (+ |c_~#queue~0.offset| (* (select .cse27 .cse1) 4)) v_ArrVal_2507)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse26 .cse1))) (let ((.cse22 (store (store .cse25 |c_~#queue~0.base| (store (store .cse26 .cse4 v_ArrVal_2510) .cse1 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse23 (let ((.cse24 (select .cse22 |c_~#queue~0.base|))) (store .cse24 (+ |c_~#queue~0.offset| (* (select .cse24 .cse1) 4)) v_ArrVal_2515)))) (let ((.cse7 (select .cse23 .cse1))) (let ((.cse19 (store (store .cse22 |c_~#queue~0.base| (store (store .cse23 .cse4 v_ArrVal_2516) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse20 (let ((.cse21 (select .cse19 |c_~#queue~0.base|))) (store .cse21 (+ |c_~#queue~0.offset| (* (select .cse21 .cse1) 4)) v_ArrVal_2522)))) (let ((.cse11 (select .cse20 .cse1))) (let ((.cse16 (store (store .cse19 |c_~#queue~0.base| (store (store .cse20 .cse4 v_ArrVal_2524) .cse1 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse17 (let ((.cse18 (select .cse16 |c_~#queue~0.base|))) (store .cse18 (+ |c_~#queue~0.offset| (* (select .cse18 .cse1) 4)) v_ArrVal_2529)))) (let ((.cse8 (select .cse17 .cse1))) (let ((.cse13 (store (store .cse16 |c_~#queue~0.base| (store (store .cse17 .cse4 v_ArrVal_2531) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse14 (let ((.cse15 (select .cse13 |c_~#queue~0.base|))) (store .cse15 (+ (* (select .cse15 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse10 (select .cse14 .cse1))) (let ((.cse2 (store (store .cse13 |c_~#queue~0.base| (store (store .cse14 .cse4 v_ArrVal_2537) .cse1 (+ .cse10 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse12 (select .cse2 |c_~#queue~0.base|))) (store .cse12 (+ (* (select .cse12 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1) 20)) (= .cse6 20) (= 20 .cse7) (= 20 .cse8) (= .cse9 20) (= .cse5 20) (= .cse10 20) (= .cse11 20))))))))))))))))))))))) is different from false [2022-11-15 22:33:13,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| (select .cse0 .cse1))) (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2501 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2503 Int) (v_ArrVal_2516 Int)) (let ((.cse30 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2501))) (let ((.cse13 (select .cse30 .cse1))) (let ((.cse9 (+ 84 |c_~#queue~0.offset|)) (.cse27 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse30 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2503) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_2507)))) (let ((.cse12 (+ 88 |c_~#queue~0.offset|)) (.cse5 (select .cse28 .cse9))) (let ((.cse24 (store (store .cse27 |c_~#queue~0.base| (store (store .cse28 .cse12 v_ArrVal_2510) .cse9 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse9) 4)) v_ArrVal_2515)))) (let ((.cse4 (select .cse25 .cse9))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse12 v_ArrVal_2516) .cse9 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse9) 4)) v_ArrVal_2522)))) (let ((.cse2 (select .cse22 .cse9))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse12 v_ArrVal_2524) .cse9 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* 4 (select .cse20 .cse9)) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse7 (select .cse19 .cse9))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse12 v_ArrVal_2531) .cse9 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ (* 4 (select .cse17 .cse9)) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse3 (select .cse16 .cse9))) (let ((.cse10 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse12 v_ArrVal_2537) .cse9 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse11 (let ((.cse14 (select .cse10 |c_~#queue~0.base|))) (store .cse14 (+ (* (select .cse14 .cse9) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse6 (select .cse11 .cse9))) (or (= .cse2 20) (= 20 .cse3) (= .cse4 20) (= .cse5 20) (= .cse6 20) (= 20 .cse7) (not (= 20 (select (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse11 .cse12 v_ArrVal_2544) .cse9 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse9) 4)) v_ArrVal_2550)) .cse9))) (= .cse13 20)))))))))))))))))))))))))) is different from false [2022-11-15 22:33:13,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2506 (Array Int Int)) (v_ArrVal_2507 Int) (v_ArrVal_2527 (Array Int Int)) (v_ArrVal_2529 Int) (v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (v_ArrVal_2510 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| Int) (v_ArrVal_2524 Int) (v_ArrVal_2535 Int) (v_ArrVal_2501 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2503 Int) (v_ArrVal_2516 Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse30 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2501)) (.cse11 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse9 (select .cse30 .cse11))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse27 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse30 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2503) .cse11 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse28 (let ((.cse29 (select .cse27 |c_~#queue~0.base|))) (store .cse29 (+ (* (select .cse29 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2507)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse8 (select .cse28 .cse1))) (let ((.cse24 (store (store .cse27 |c_~#queue~0.base| (store (store .cse28 .cse4 v_ArrVal_2510) .cse1 (+ .cse8 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse25 (let ((.cse26 (select .cse24 |c_~#queue~0.base|))) (store .cse26 (+ |c_~#queue~0.offset| (* (select .cse26 .cse1) 4)) v_ArrVal_2515)))) (let ((.cse12 (select .cse25 .cse1))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse4 v_ArrVal_2516) .cse1 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse22 (let ((.cse23 (select .cse21 |c_~#queue~0.base|))) (store .cse23 (+ |c_~#queue~0.offset| (* (select .cse23 .cse1) 4)) v_ArrVal_2522)))) (let ((.cse13 (select .cse22 .cse1))) (let ((.cse18 (store (store .cse21 |c_~#queue~0.base| (store (store .cse22 .cse4 v_ArrVal_2524) .cse1 (+ .cse13 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse19 (let ((.cse20 (select .cse18 |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse6 (select .cse19 .cse1))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse4 v_ArrVal_2531) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse16 (let ((.cse17 (select .cse15 |c_~#queue~0.base|))) (store .cse17 (+ |c_~#queue~0.offset| (* (select .cse17 .cse1) 4)) v_ArrVal_2535)))) (let ((.cse7 (select .cse16 .cse1))) (let ((.cse2 (store (store .cse15 |c_~#queue~0.base| (store (store .cse16 .cse4 v_ArrVal_2537) .cse1 (+ .cse7 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse14 (select .cse2 |c_~#queue~0.base|))) (store .cse14 (+ |c_~#queue~0.offset| (* (select .cse14 .cse1) 4)) v_ArrVal_2542)))) (let ((.cse5 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_2544) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1) 20)) (= .cse6 20) (= .cse7 20) (= .cse8 20) (= 20 .cse5) (= .cse9 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| (select .cse10 .cse11))) (= 20 .cse12) (= .cse13 20)))))))))))))))))))))))) is different from false [2022-11-15 22:33:16,323 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:33:16,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 3593730 treesize of output 2421860 [2022-11-15 22:33:19,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:33:19,575 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 297308 treesize of output 290752 [2022-11-15 22:33:21,093 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 192269 treesize of output 191193 [2022-11-15 22:33:22,705 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 158914 treesize of output 157378 [2022-11-15 22:33:22,974 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 213712 treesize of output 210640 [2022-11-15 22:33:24,223 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 233958 treesize of output 228966 [2022-11-15 22:33:26,086 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 242648 treesize of output 234968 [2022-11-15 22:33:28,653 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 227026 treesize of output 223794 [2022-11-15 22:33:31,509 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 222583 treesize of output 212055 [2022-11-15 22:33:35,274 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 177926 treesize of output 172526 [2022-11-15 22:33:39,869 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-15 22:33:41,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 22:33:41,329 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 62908 treesize of output 58044 Received shutdown request... [2022-11-15 22:33:55,336 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-15 22:33:55,352 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 22:33:55,352 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-15 22:33:55,352 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-15 22:33:55,352 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 22:33:55,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-15 22:33:55,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-15 22:33:55,551 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 824 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-4-3-2-2-1 context. [2022-11-15 22:33:55,553 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1] [2022-11-15 22:33:55,553 INFO L307 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (2/2) [2022-11-15 22:33:55,554 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-15 22:33:55,554 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-15 22:33:55,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:33:55 BasicIcfg [2022-11-15 22:33:55,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-15 22:33:55,556 INFO L158 Benchmark]: Toolchain (without parser) took 857417.20ms. Allocated memory was 228.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 198.9MB in the beginning and 948.7MB in the end (delta: -749.8MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-11-15 22:33:55,557 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-15 22:33:55,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.49ms. Allocated memory is still 228.6MB. Free memory was 198.9MB in the beginning and 177.8MB in the end (delta: 21.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-11-15 22:33:55,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.73ms. Allocated memory is still 228.6MB. Free memory was 177.8MB in the beginning and 174.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-15 22:33:55,557 INFO L158 Benchmark]: Boogie Preprocessor took 23.77ms. Allocated memory is still 228.6MB. Free memory was 174.6MB in the beginning and 172.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-15 22:33:55,557 INFO L158 Benchmark]: RCFGBuilder took 403.24ms. Allocated memory is still 228.6MB. Free memory was 172.5MB in the beginning and 151.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-15 22:33:55,558 INFO L158 Benchmark]: TraceAbstraction took 856444.20ms. Allocated memory was 228.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 150.5MB in the beginning and 948.7MB in the end (delta: -798.2MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-11-15 22:33:55,558 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 186.6MB. Free memory is still 139.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 487.49ms. Allocated memory is still 228.6MB. Free memory was 198.9MB in the beginning and 177.8MB in the end (delta: 21.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.73ms. Allocated memory is still 228.6MB. Free memory was 177.8MB in the beginning and 174.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.77ms. Allocated memory is still 228.6MB. Free memory was 174.6MB in the beginning and 172.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 403.24ms. Allocated memory is still 228.6MB. Free memory was 172.5MB in the beginning and 151.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 856444.20ms. Allocated memory was 228.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 150.5MB in the beginning and 948.7MB in the end (delta: -798.2MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4934, independent: 4880, independent conditional: 47, independent unconditional: 4833, dependent: 54, dependent conditional: 20, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4923, independent: 4880, independent conditional: 47, independent unconditional: 4833, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4923, independent: 4880, independent conditional: 47, independent unconditional: 4833, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4932, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 52, dependent conditional: 9, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4932, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4932, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4749, independent: 4715, independent conditional: 0, independent unconditional: 4715, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4749, independent: 4713, independent conditional: 0, independent unconditional: 4713, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4932, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4749, unknown conditional: 0, unknown unconditional: 4749] , Statistics on independence cache: Total cache size (in pairs): 4749, Positive cache size: 4715, Positive conditional cache size: 0, Positive unconditional cache size: 4715, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1, Independence queries for same thread: 11 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 128, Number of trivial persistent sets: 112, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4867, independent: 4833, independent conditional: 0, independent unconditional: 4833, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4934, independent: 4880, independent conditional: 47, independent unconditional: 4833, dependent: 54, dependent conditional: 20, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4923, independent: 4880, independent conditional: 47, independent unconditional: 4833, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4923, independent: 4880, independent conditional: 47, independent unconditional: 4833, dependent: 43, dependent conditional: 9, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4932, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 52, dependent conditional: 9, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4932, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4932, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4749, independent: 4715, independent conditional: 0, independent unconditional: 4715, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4749, independent: 4713, independent conditional: 0, independent unconditional: 4713, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 36, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 117, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4932, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 4749, unknown conditional: 0, unknown unconditional: 4749] , Statistics on independence cache: Total cache size (in pairs): 4749, Positive cache size: 4715, Positive conditional cache size: 0, Positive unconditional cache size: 4715, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 9, Maximal queried relation: 1, Independence queries for same thread: 11 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15697, independent: 15040, independent conditional: 6162, independent unconditional: 8878, dependent: 657, dependent conditional: 623, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15085, independent: 15040, independent conditional: 6162, independent unconditional: 8878, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15085, independent: 15040, independent conditional: 6162, independent unconditional: 8878, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15102, independent: 15040, independent conditional: 0, independent unconditional: 15040, dependent: 62, dependent conditional: 17, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15102, independent: 15040, independent conditional: 0, independent unconditional: 15040, dependent: 62, dependent conditional: 11, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15102, independent: 15040, independent conditional: 0, independent unconditional: 15040, dependent: 62, dependent conditional: 11, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8432, independent: 8396, independent conditional: 0, independent unconditional: 8396, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8432, independent: 8390, independent conditional: 0, independent unconditional: 8390, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 67, dependent conditional: 12, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15102, independent: 6644, independent conditional: 0, independent unconditional: 6644, dependent: 26, dependent conditional: 9, dependent unconditional: 17, unknown: 8432, unknown conditional: 2, unknown unconditional: 8430] , Statistics on independence cache: Total cache size (in pairs): 8432, Positive cache size: 8396, Positive conditional cache size: 0, Positive unconditional cache size: 8396, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 4, Independence queries for same thread: 612 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 332, Number of trivial persistent sets: 178, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8912, independent: 8878, independent conditional: 0, independent unconditional: 8878, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 15697, independent: 15040, independent conditional: 6162, independent unconditional: 8878, dependent: 657, dependent conditional: 623, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15085, independent: 15040, independent conditional: 6162, independent unconditional: 8878, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15085, independent: 15040, independent conditional: 6162, independent unconditional: 8878, dependent: 45, dependent conditional: 11, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15102, independent: 15040, independent conditional: 0, independent unconditional: 15040, dependent: 62, dependent conditional: 17, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15102, independent: 15040, independent conditional: 0, independent unconditional: 15040, dependent: 62, dependent conditional: 11, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15102, independent: 15040, independent conditional: 0, independent unconditional: 15040, dependent: 62, dependent conditional: 11, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8432, independent: 8396, independent conditional: 0, independent unconditional: 8396, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8432, independent: 8390, independent conditional: 0, independent unconditional: 8390, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 106, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 67, dependent conditional: 12, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 15102, independent: 6644, independent conditional: 0, independent unconditional: 6644, dependent: 26, dependent conditional: 9, dependent unconditional: 17, unknown: 8432, unknown conditional: 2, unknown unconditional: 8430] , Statistics on independence cache: Total cache size (in pairs): 8432, Positive cache size: 8396, Positive conditional cache size: 0, Positive unconditional cache size: 8396, Negative cache size: 36, Negative conditional cache size: 2, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 4, Independence queries for same thread: 612 - PositiveResult [Line: 1049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 824 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-4-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, 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: 2, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 58 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 855.7s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 48.5s, 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: 296, 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.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 36.7s InterpolantComputationTime, 8739 NumberOfCodeBlocks, 7964 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 12424 ConstructedInterpolants, 189 QuantifiedInterpolants, 104248 SizeOfPredicates, 126 NumberOfNonLiveVariables, 7079 ConjunctsInSsa, 305 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 52662/67427 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