/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -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-16 00:28:51,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 00:28:51,716 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 00:28:51,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 00:28:51,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 00:28:51,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 00:28:51,751 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 00:28:51,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 00:28:51,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 00:28:51,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 00:28:51,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 00:28:51,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 00:28:51,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 00:28:51,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 00:28:51,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 00:28:51,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 00:28:51,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 00:28:51,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 00:28:51,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 00:28:51,770 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 00:28:51,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 00:28:51,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 00:28:51,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 00:28:51,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 00:28:51,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 00:28:51,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 00:28:51,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 00:28:51,776 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 00:28:51,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 00:28:51,777 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 00:28:51,777 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 00:28:51,778 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 00:28:51,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 00:28:51,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 00:28:51,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 00:28:51,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 00:28:51,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 00:28:51,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 00:28:51,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 00:28:51,780 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 00:28:51,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 00:28:51,781 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 00:28:51,794 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 00:28:51,794 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 00:28:51,794 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 00:28:51,794 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 00:28:51,795 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 00:28:51,795 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 00:28:51,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 00:28:51,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 00:28:51,795 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 00:28:51,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 00:28:51,795 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 00:28:51,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 00:28:51,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 00:28:51,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 00:28:51,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 00:28:51,797 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 00:28:51,798 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 00:28:51,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2022-11-16 00:28:51,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 00:28:51,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 00:28:51,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 00:28:51,949 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 00:28:51,949 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 00:28:51,950 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-16 00:28:52,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a540be8/3a569d4fe6ae422586f8bb7530b6f6ad/FLAG465cfa68e [2022-11-16 00:28:52,399 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 00:28:52,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-11-16 00:28:52,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a540be8/3a569d4fe6ae422586f8bb7530b6f6ad/FLAG465cfa68e [2022-11-16 00:28:52,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a540be8/3a569d4fe6ae422586f8bb7530b6f6ad [2022-11-16 00:28:52,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 00:28:52,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 00:28:52,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 00:28:52,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 00:28:52,423 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 00:28:52,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65a3e8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52, skipping insertion in model container [2022-11-16 00:28:52,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 00:28:52,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 00:28:52,769 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-16 00:28:52,772 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-16 00:28:52,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 00:28:52,783 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 00:28:52,821 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-16 00:28:52,824 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-16 00:28:52,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 00:28:52,869 INFO L208 MainTranslator]: Completed translation [2022-11-16 00:28:52,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52 WrapperNode [2022-11-16 00:28:52,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 00:28:52,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 00:28:52,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 00:28:52,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 00:28:52,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,886 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,905 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-11-16 00:28:52,905 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 00:28:52,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 00:28:52,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 00:28:52,906 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 00:28:52,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,928 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,928 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,936 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,948 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,949 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 00:28:52,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 00:28:52,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 00:28:52,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 00:28:52,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (1/1) ... [2022-11-16 00:28:52,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 00:28:52,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:52,986 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-16 00:28:52,994 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-16 00:28:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-16 00:28:53,017 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-16 00:28:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-16 00:28:53,017 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-16 00:28:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 00:28:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 00:28:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 00:28:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 00:28:53,017 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-16 00:28:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 00:28:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 00:28:53,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 00:28:53,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 00:28:53,019 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 00:28:53,137 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 00:28:53,138 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 00:28:53,450 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 00:28:53,465 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 00:28:53,466 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 00:28:53,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:53 BoogieIcfgContainer [2022-11-16 00:28:53,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 00:28:53,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 00:28:53,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 00:28:53,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 00:28:53,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:28:52" (1/3) ... [2022-11-16 00:28:53,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388ca9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:53, skipping insertion in model container [2022-11-16 00:28:53,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:52" (2/3) ... [2022-11-16 00:28:53,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388ca9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:53, skipping insertion in model container [2022-11-16 00:28:53,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:53" (3/3) ... [2022-11-16 00:28:53,476 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-16 00:28:53,481 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 00:28:53,487 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 00:28:53,488 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-16 00:28:53,488 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 00:28:53,583 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-16 00:28:53,624 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 00:28:53,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:53,627 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-16 00:28:53,644 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-16 00:28:53,669 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 00:28:53,678 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-11-16 00:28:53,682 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;@f38017c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:53,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 00:28:53,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:28:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:28:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash 744859798, now seen corresponding path program 1 times [2022-11-16 00:28:53,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:28:53,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166803241] [2022-11-16 00:28:53,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:53,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:28:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:53,945 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-16 00:28:53,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:28:53,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166803241] [2022-11-16 00:28:53,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166803241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 00:28:53,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 00:28:53,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 00:28:53,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447889039] [2022-11-16 00:28:53,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 00:28:53,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 00:28:53,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:28:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 00:28:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 00:28:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:53,976 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:28:53,977 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-16 00:28:53,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:53,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:53,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 00:28:53,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 00:28:54,005 INFO L444 BasicCegarLoop]: Path program histogram: [1] [2022-11-16 00:28:54,006 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/5) [2022-11-16 00:28:54,017 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:54,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 00:28:54,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:54,021 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-16 00:28:54,025 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-16 00:28:54,028 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 00:28:54,028 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-11-16 00:28:54,029 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;@f38017c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:54,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 00:28:54,044 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-11-16 00:28:54,046 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-16 00:28:54,046 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/5) [2022-11-16 00:28:54,050 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:54,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 00:28:54,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:54,088 INFO L229 MonitoredProcess]: Starting monitored process 4 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-16 00:28:54,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-11-16 00:28:54,094 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 00:28:54,094 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-11-16 00:28:54,095 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;@f38017c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:54,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 00:28:54,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-11-16 00:28:54,352 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-16 00:28:54,353 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/5) [2022-11-16 00:28:54,356 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:54,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 00:28:54,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:54,378 INFO L229 MonitoredProcess]: Starting monitored process 5 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-16 00:28:54,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2022-11-16 00:28:54,382 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 00:28:54,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-11-16 00:28:54,383 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;@f38017c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:54,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 00:28:54,383 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-11-16 00:28:54,383 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 00:28:54,384 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-11-16 00:28:54,384 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/5) [2022-11-16 00:28:54,387 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:54,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 00:28:54,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:54,390 INFO L229 MonitoredProcess]: Starting monitored process 6 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-16 00:28:54,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2022-11-16 00:28:54,396 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 00:28:54,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Err0ASSERT_VIOLATIONERROR_FUNCTION ======== [2022-11-16 00:28:54,397 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;@f38017c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 00:28:54,397 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 00:28:54,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:28:54,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:28:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash -143962929, now seen corresponding path program 1 times [2022-11-16 00:28:54,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:28:54,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78101744] [2022-11-16 00:28:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:54,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:28:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:54,652 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-16 00:28:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:28:54,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78101744] [2022-11-16 00:28:54,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78101744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 00:28:54,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 00:28:54,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 00:28:54,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314147723] [2022-11-16 00:28:54,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 00:28:54,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 00:28:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:28:54,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 00:28:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 00:28:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:54,654 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:28:54,654 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-16 00:28:54,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:54,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:54,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 00:28:54,704 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:28:54,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:28:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash 585022085, now seen corresponding path program 1 times [2022-11-16 00:28:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:28:54,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94023729] [2022-11-16 00:28:54,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:54,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:28:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:54,938 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-16 00:28:54,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:28:54,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94023729] [2022-11-16 00:28:54,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94023729] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 00:28:54,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 00:28:54,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 00:28:54,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612766704] [2022-11-16 00:28:54,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 00:28:54,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 00:28:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:28:54,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 00:28:54,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 00:28:54,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:54,940 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:28:54,941 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-16 00:28:54,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:54,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:55,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 00:28:55,015 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:28:55,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:28:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash -670941291, now seen corresponding path program 1 times [2022-11-16 00:28:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:28:55,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081534058] [2022-11-16 00:28:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:28:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:55,128 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-16 00:28:55,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:28:55,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081534058] [2022-11-16 00:28:55,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081534058] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 00:28:55,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 00:28:55,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 00:28:55,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229005066] [2022-11-16 00:28:55,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 00:28:55,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 00:28:55,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:28:55,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 00:28:55,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 00:28:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,130 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:28:55,130 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-16 00:28:55,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:55,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:55,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 00:28:55,177 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:28:55,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:28:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash 726380279, now seen corresponding path program 1 times [2022-11-16 00:28:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:28:55,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190891225] [2022-11-16 00:28:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:55,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:28:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:55,314 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-16 00:28:55,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:28:55,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190891225] [2022-11-16 00:28:55,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190891225] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 00:28:55,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183986809] [2022-11-16 00:28:55,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:55,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:28:55,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:55,317 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-16 00:28:55,344 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-16 00:28:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:55,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 00:28:55,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 00:28:55,584 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-16 00:28:55,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 00:28:55,648 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-16 00:28:55,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183986809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 00:28:55,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 00:28:55,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 00:28:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100489862] [2022-11-16 00:28:55,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 00:28:55,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 00:28:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:28:55,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 00:28:55,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-16 00:28:55,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,651 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:28:55,651 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-16 00:28:55,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:55,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:55,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:55,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:55,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:28:55,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-16 00:28:55,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:28:55,919 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:28:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:28:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash -35740873, now seen corresponding path program 2 times [2022-11-16 00:28:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:28:55,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937847337] [2022-11-16 00:28:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:28:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:56,071 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-16 00:28:56,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:28:56,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937847337] [2022-11-16 00:28:56,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937847337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 00:28:56,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 00:28:56,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 00:28:56,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769011646] [2022-11-16 00:28:56,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 00:28:56,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 00:28:56,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:28:56,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 00:28:56,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 00:28:56,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:56,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:28:56,073 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-16 00:28:56,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:56,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:28:56,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:28:56,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 00:28:56,110 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:28:56,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:28:56,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1811277115, now seen corresponding path program 1 times [2022-11-16 00:28:56,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:28:56,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008320635] [2022-11-16 00:28:56,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:56,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:28:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:56,360 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-16 00:28:56,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:28:56,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008320635] [2022-11-16 00:28:56,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008320635] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 00:28:56,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850692318] [2022-11-16 00:28:56,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:56,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:28:56,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:56,364 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-16 00:28:56,378 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-16 00:28:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:56,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 00:28:56,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 00:28:56,649 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-16 00:28:56,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 00:28:56,785 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-16 00:28:56,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850692318] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 00:28:56,785 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 00:28:56,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-16 00:28:56,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192131340] [2022-11-16 00:28:56,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 00:28:56,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 00:28:56,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:28:56,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 00:28:56,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-16 00:28:56,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:56,787 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:28:56,788 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-16 00:28:56,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:56,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:28:56,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:56,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:28:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:56,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:28:56,931 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-16 00:28:57,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:28:57,131 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:28:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:28:57,132 INFO L85 PathProgramCache]: Analyzing trace with hash 890448325, now seen corresponding path program 2 times [2022-11-16 00:28:57,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:28:57,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606369701] [2022-11-16 00:28:57,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:57,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:28:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:57,680 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-16 00:28:57,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:28:57,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606369701] [2022-11-16 00:28:57,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606369701] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 00:28:57,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405190702] [2022-11-16 00:28:57,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 00:28:57,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:28:57,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:57,682 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-16 00:28:57,684 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-16 00:28:57,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-16 00:28:57,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 00:28:57,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 00:28:57,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 00:28:57,858 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-16 00:28:57,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 00:28:57,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405190702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 00:28:57,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 00:28:57,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [17] total 19 [2022-11-16 00:28:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140688647] [2022-11-16 00:28:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 00:28:57,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 00:28:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:28:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 00:28:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2022-11-16 00:28:57,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:57,860 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:28:57,860 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-16 00:28:57,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:57,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:57,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:57,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:28:57,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:57,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:28:57,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:28:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:28:57,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:28:57,899 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-16 00:28:58,097 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,SelfDestructingSolverStorable7 [2022-11-16 00:28:58,097 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:28:58,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:28:58,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1506502106, now seen corresponding path program 1 times [2022-11-16 00:28:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:28:58,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297327062] [2022-11-16 00:28:58,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:58,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:28:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:58,586 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-16 00:28:58,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:28:58,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297327062] [2022-11-16 00:28:58,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297327062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 00:28:58,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075836558] [2022-11-16 00:28:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:28:58,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:28:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:28:58,588 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-16 00:28:58,590 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-16 00:28:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:28:58,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 00:28:58,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 00:28:58,973 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-16 00:28:58,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 00:28:59,405 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-16 00:28:59,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075836558] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 00:28:59,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 00:28:59,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-16 00:28:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456405750] [2022-11-16 00:28:59,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 00:28:59,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 00:28:59,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:28:59,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 00:28:59,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 00:28:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:59,407 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:28:59,408 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-16 00:28:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:28:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:28:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:28:59,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:28:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:28:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:28:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:28:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:28:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 00:28:59,907 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-16 00:29:00,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:29:00,104 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:29:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:29:00,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1007172646, now seen corresponding path program 2 times [2022-11-16 00:29:00,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:29:00,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127876670] [2022-11-16 00:29:00,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:29:00,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:29:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:29:01,364 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-16 00:29:01,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:29:01,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127876670] [2022-11-16 00:29:01,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127876670] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 00:29:01,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484351585] [2022-11-16 00:29:01,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 00:29:01,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:29:01,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:29:01,376 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-16 00:29:01,378 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-16 00:29:01,654 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 00:29:01,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 00:29:01,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 1285 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 00:29:01,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 00:29:02,162 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-16 00:29:02,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 00:29:02,941 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-16 00:29:02,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484351585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 00:29:02,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 00:29:02,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2022-11-16 00:29:02,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913694823] [2022-11-16 00:29:02,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 00:29:02,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-16 00:29:02,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:29:02,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-16 00:29:02,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-11-16 00:29:02,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:02,944 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:29:02,945 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-16 00:29:02,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:02,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:02,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:02,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:29:02,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:02,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:29:02,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:29:02,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 00:29:02,945 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:29:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:29:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:29:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 00:29:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 00:29:03,589 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-16 00:29:03,787 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,SelfDestructingSolverStorable9 [2022-11-16 00:29:03,787 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:29:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:29:03,788 INFO L85 PathProgramCache]: Analyzing trace with hash 145283426, now seen corresponding path program 3 times [2022-11-16 00:29:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:29:03,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574956343] [2022-11-16 00:29:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:29:03,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:29:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:29:06,821 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-16 00:29:06,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:29:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574956343] [2022-11-16 00:29:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574956343] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 00:29:06,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312660004] [2022-11-16 00:29:06,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 00:29:06,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:29:06,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:29:06,841 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-16 00:29:06,842 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-16 00:29:07,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 00:29:07,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 00:29:07,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 00:29:07,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 00:29:09,743 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-16 00:29:09,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:09,810 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-16 00:29:09,954 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:29:09,960 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:29:09,961 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-16 00:29:10,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:10,003 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-16 00:29:10,023 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-16 00:29:10,045 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-16 00:29:10,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 00:29:10,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:10,248 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-16 00:29:10,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:10,280 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-16 00:29:10,319 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-16 00:29:11,177 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-16 00:29:11,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312660004] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 00:29:11,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 00:29:11,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 37 [2022-11-16 00:29:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762696332] [2022-11-16 00:29:11,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 00:29:11,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-16 00:29:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:29:11,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-16 00:29:11,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1167, Unknown=4, NotChecked=0, Total=1332 [2022-11-16 00:29:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:11,184 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:29:11,185 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-16 00:29:11,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:11,185 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:11,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:11,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:29:11,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:11,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:29:11,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:29:11,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 00:29:11,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 00:29:11,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:29:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:29:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:29:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 00:29:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 00:29:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 00:29:11,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 00:29:12,048 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,SelfDestructingSolverStorable10 [2022-11-16 00:29:12,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:29:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:29:12,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2000058640, now seen corresponding path program 1 times [2022-11-16 00:29:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:29:12,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807664298] [2022-11-16 00:29:12,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:29:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:29:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:29:15,457 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-16 00:29:15,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:29:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807664298] [2022-11-16 00:29:15,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807664298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 00:29:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132119323] [2022-11-16 00:29:15,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:29:15,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:29:15,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:29:15,472 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 00:29:15,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 00:29:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:29:15,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-16 00:29:15,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 00:29:16,496 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-16 00:29:16,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:16,543 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-16 00:29:16,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:29:16,711 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:29:16,712 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-16 00:29:16,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:16,742 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-16 00:29:16,867 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-16 00:29:16,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:16,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 16 treesize of output 18 [2022-11-16 00:29:17,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:29:17,107 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:29:17,107 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-16 00:29:17,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:17,157 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-16 00:29:17,198 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-16 00:29:17,228 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-16 00:29:17,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 00:29:17,407 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-16 00:29:17,433 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-16 00:29:17,438 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-16 00:29:17,443 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-16 00:29:17,461 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-16 00:29:17,478 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-16 00:29:17,484 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-16 00:29:17,500 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-16 00:29:17,871 INFO L321 Elim1Store]: treesize reduction 335, result has 45.1 percent of original size [2022-11-16 00:29:17,871 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-16 00:29:17,944 INFO L321 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-16 00:29:17,944 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-16 00:29:17,974 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-11-16 00:29:17,975 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-16 00:29:18,003 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:18,004 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-16 00:29:18,022 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-16 00:29:18,070 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-16 00:29:18,107 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-16 00:29:18,134 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-16 00:29:18,144 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-16 00:29:18,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:18,173 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-16 00:29:18,212 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:18,212 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-16 00:29:18,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:18,262 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-16 00:29:18,513 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:18,513 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-16 00:29:18,796 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-16 00:29:18,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132119323] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 00:29:18,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 00:29:18,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 21] total 53 [2022-11-16 00:29:18,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947532384] [2022-11-16 00:29:18,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 00:29:18,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 00:29:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:29:18,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 00:29:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=1599, Unknown=8, NotChecked=744, Total=2756 [2022-11-16 00:29:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:18,801 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:29:18,801 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-16 00:29:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:29:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:29:18,801 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:29:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 00:29:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 00:29:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 00:29:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 00:29:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 00:29:20,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 00:29:20,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 00:29:20,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 00:29:20,447 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:29:20,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:29:20,448 INFO L85 PathProgramCache]: Analyzing trace with hash -107922583, now seen corresponding path program 2 times [2022-11-16 00:29:20,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:29:20,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66109883] [2022-11-16 00:29:20,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:29:20,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:29:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:29:28,119 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-16 00:29:28,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:29:28,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66109883] [2022-11-16 00:29:28,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66109883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 00:29:28,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627056240] [2022-11-16 00:29:28,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 00:29:28,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:29:28,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:29:28,122 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 00:29:28,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 00:29:28,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 00:29:28,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 00:29:28,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 1680 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-16 00:29:28,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 00:29:28,994 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-16 00:29:29,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:29,042 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-16 00:29:29,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:29:29,229 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-16 00:29:29,230 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-16 00:29:29,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:29,262 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-16 00:29:29,412 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-16 00:29:29,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:29,480 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-16 00:29:29,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:29:29,679 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-16 00:29:29,680 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-16 00:29:29,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:29,721 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-16 00:29:29,867 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-16 00:29:29,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:29,936 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-16 00:29:30,143 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:29:30,150 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-16 00:29:30,150 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-16 00:29:30,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:30,194 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-16 00:29:30,353 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-16 00:29:30,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:30,425 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-16 00:29:30,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:29:30,595 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:29:30,595 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-16 00:29:30,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:29:30,641 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-16 00:29:30,657 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-16 00:29:30,685 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-16 00:29:30,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 00:29:30,923 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-16 00:29:31,039 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-16 00:29:31,057 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-16 00:29:31,073 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-16 00:29:31,084 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-16 00:29:31,106 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-16 00:29:31,611 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-16 00:29:31,653 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-16 00:29:31,674 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-16 00:29:31,708 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-16 00:29:32,347 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-16 00:29:32,689 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-16 00:29:32,775 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-16 00:29:32,843 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-16 00:29:32,871 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-16 00:29:32,919 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-16 00:29:33,272 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-16 00:29:33,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:33,374 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-16 00:29:33,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:33,397 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-16 00:29:33,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 1936 treesize of output 1912 [2022-11-16 00:29:33,425 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-16 00:29:33,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1957 treesize of output 1893 [2022-11-16 00:29:33,455 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-16 00:29:33,495 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-16 00:29:33,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:29:33,595 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-16 00:29:38,039 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-16 00:29:38,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627056240] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 00:29:38,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 00:29:38,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 40] total 100 [2022-11-16 00:29:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768595054] [2022-11-16 00:29:38,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 00:29:38,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2022-11-16 00:29:38,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 00:29:38,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2022-11-16 00:29:38,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1068, Invalid=5734, Unknown=72, NotChecked=3026, Total=9900 [2022-11-16 00:29:38,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:38,052 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 00:29:38,053 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-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-16 00:29:38,053 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:30:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 00:30:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 00:30:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-16 00:30:19,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 00:30:19,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 00:30:19,644 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 00:30:19,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 00:30:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1911747635, now seen corresponding path program 3 times [2022-11-16 00:30:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 00:30:19,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533753815] [2022-11-16 00:30:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 00:30:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 00:30:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 00:30:41,017 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-16 00:30:41,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 00:30:41,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533753815] [2022-11-16 00:30:41,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533753815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 00:30:41,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141483787] [2022-11-16 00:30:41,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 00:30:41,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:30:41,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 00:30:41,019 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 00:30:41,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 00:42:22,814 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-11-16 00:42:22,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 00:42:22,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 1212 conjuncts, 317 conjunts are in the unsatisfiable core [2022-11-16 00:42:22,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 00:42:24,629 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-16 00:42:24,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:24,703 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-16 00:42:24,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:42:24,963 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-16 00:42:24,963 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-16 00:42:25,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:25,015 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-16 00:42:25,277 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-16 00:42:25,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:25,356 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-16 00:42:25,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:42:25,610 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:42:25,611 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-16 00:42:25,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:25,660 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-16 00:42:25,890 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-16 00:42:25,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:25,969 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-16 00:42:26,220 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:42:26,229 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:42:26,230 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-16 00:42:26,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:26,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 23 treesize of output 22 [2022-11-16 00:42:26,612 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-16 00:42:26,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:26,716 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-16 00:42:27,002 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:42:27,010 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:42:27,010 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-16 00:42:27,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:27,066 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-16 00:42:27,383 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-16 00:42:27,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:27,470 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-16 00:42:27,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:42:27,736 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:42:27,736 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-16 00:42:27,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:27,808 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-16 00:42:28,055 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-16 00:42:28,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:28,134 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-16 00:42:28,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:42:28,372 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:42:28,372 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-16 00:42:28,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:28,427 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-16 00:42:28,695 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-16 00:42:28,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:28,781 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-16 00:42:29,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:42:29,029 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:42:29,030 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-16 00:42:29,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:29,091 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-16 00:42:29,336 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-16 00:42:29,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:29,421 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-16 00:42:29,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 00:42:29,658 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-16 00:42:29,659 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-16 00:42:29,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 00:42:29,739 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-16 00:42:29,806 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-16 00:42:29,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 00:42:29,839 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-16 00:42:30,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2548 (Array Int Int)) (v_ArrVal_2550 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_2548) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_2550)) .cse1)) 20))) is different from false [2022-11-16 00:42:30,360 WARN L833 $PredicateComparison]: unable to prove that (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| (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))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-11-16 00:42:30,365 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-16 00:42:30,377 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-16 00:42:30,403 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-16 00:42:30,412 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-16 00:42:30,428 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-16 00:42:30,667 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-16 00:42:30,758 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-16 00:42:30,773 WARN L833 $PredicateComparison]: unable to prove that (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| (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)))))))) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-11-16 00:42:30,884 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-16 00:42:30,931 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-16 00:42:30,945 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-16 00:42:30,972 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-16 00:42:31,197 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 ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* 4 (select .cse10 .cse1))) v_ArrVal_2535)))) (let ((.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (select .cse9 .cse1))) (let ((.cse2 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse4 v_ArrVal_2537) .cse1 (+ .cse6 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse3 (let ((.cse7 (select .cse2 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .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) (= .cse5 20))))))))) is different from false [2022-11-16 00:42:31,278 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 ((.cse3 (+ 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|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse9 .cse3))) (let ((.cse4 (store (store .cse8 |c_~#queue~0.base| (store (store .cse9 .cse6 v_ArrVal_2537) .cse3 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse5 (let ((.cse7 (select .cse4 |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) v_ArrVal_2542)))) (let ((.cse0 (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 (+ .cse0 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)))))))))) is different from false [2022-11-16 00:42:31,688 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-16 00:42:31,733 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-16 00:42:31,801 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-16 00:42:31,826 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-16 00:42:31,870 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-16 00:42:32,258 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-16 00:42:32,467 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 (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_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|)) (.cse1 (select .cse13 .cse4))) (let ((.cse9 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse7 v_ArrVal_2531) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse10 (let ((.cse11 (select .cse9 |c_~#queue~0.base|))) (store .cse11 (+ (* (select .cse11 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse0 (select .cse10 .cse4))) (let ((.cse5 (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse7 v_ArrVal_2537) .cse4 (+ .cse0 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 ((.cse2 (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 (+ .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))))))))))))) is different from false [2022-11-16 00:42:32,686 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-16 00:42:32,750 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-16 00:42:32,786 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-16 00:42:32,876 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-16 00:42:32,991 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-16 00:42:33,030 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-16 00:42:33,110 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-16 00:42:34,104 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-16 00:42:34,346 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 ((.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))))))))))))))) is different from false [2022-11-16 00:42:34,406 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-16 00:42:34,443 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)) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse17 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse20 .cse21 (+ .cse0 1))) |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 ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (select .cse18 .cse5))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse8 v_ArrVal_2524) .cse5 (+ .cse1 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 .cse5) 4)) v_ArrVal_2529)))) (let ((.cse2 (select .cse15 .cse5))) (let ((.cse11 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse8 v_ArrVal_2531) .cse5 (+ .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 .cse5) 4)) v_ArrVal_2535)))) (let ((.cse3 (select .cse12 .cse5))) (let ((.cse6 (store (store .cse11 |c_~#queue~0.base| (store (store .cse12 .cse8 v_ArrVal_2537) .cse5 (+ .cse3 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse7 (let ((.cse10 (select .cse6 |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse9 (select .cse7 .cse5))) (or (= .cse1 20) (= .cse2 20) (= 20 .cse3) (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 (+ |c_~#queue~0.offset| (* (select .cse4 .cse5) 4)) v_ArrVal_2550)) .cse5) 20)) (= 20 .cse9)))))))))))))))))) is different from false [2022-11-16 00:42:34,559 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-16 00:42:34,732 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-16 00:42:34,780 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-16 00:42:34,876 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-16 00:42:37,160 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-16 00:42:37,726 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-16 00:42:37,941 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-16 00:42:38,006 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-16 00:42:38,130 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-16 00:42:39,174 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-16 00:42:39,639 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 (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_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|)) (.cse2 (select .cse25 .cse5))) (let ((.cse21 (store (store .cse24 |c_~#queue~0.base| (store (store .cse25 .cse8 v_ArrVal_2510) .cse5 (+ .cse2 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 ((.cse3 (select .cse19 .cse5))) (let ((.cse15 (store (store .cse18 |c_~#queue~0.base| (store (store .cse19 .cse8 v_ArrVal_2524) .cse5 (+ .cse3 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 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|) v_ArrVal_2535)))) (let ((.cse0 (select .cse13 .cse5))) (let ((.cse6 (store (store .cse12 |c_~#queue~0.base| (store (store .cse13 .cse8 v_ArrVal_2537) .cse5 (+ .cse0 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 ((.cse1 (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 (+ .cse1 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)) (= 20 .cse9) (= 20 .cse10))))))))))))))))))))) is different from false [2022-11-16 00:42:39,706 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-16 00:42:40,622 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-16 00:42:40,870 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-16 00:42:41,141 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-16 00:42:41,282 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-16 00:42:41,497 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-16 00:42:44,504 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_2520 (Array Int Int)) (v_ArrVal_2541 (Array Int Int)) (v_ArrVal_2550 Int) (v_ArrVal_2531 Int) (v_ArrVal_2510 Int) (v_ArrVal_2535 Int) (v_ArrVal_2515 Int) (v_ArrVal_2537 Int) (v_ArrVal_2516 Int) (v_ArrVal_2513 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2499 (Array Int Int)) (v_ArrVal_2542 Int) (v_ArrVal_2522 Int) (v_ArrVal_2544 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| Int) (v_ArrVal_2524 Int) (v_ArrVal_2501 Int) (v_ArrVal_2503 Int)) (let ((.cse29 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2499))) (let ((.cse10 (select .cse29 |c_~#queue~0.base|))) (let ((.cse30 (store .cse10 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| 4) |c_~#queue~0.offset|) v_ArrVal_2501)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse9 (select .cse30 .cse4))) (let ((.cse26 (store (store .cse29 |c_~#queue~0.base| (store (store .cse30 .cse7 v_ArrVal_2503) .cse4 (+ .cse9 1))) |c_~#stored_elements~0.base| v_ArrVal_2506))) (let ((.cse27 (let ((.cse28 (select .cse26 |c_~#queue~0.base|))) (store .cse28 (+ (* (select .cse28 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2507)))) (let ((.cse11 (select .cse27 .cse4))) (let ((.cse23 (store (store .cse26 |c_~#queue~0.base| (store (store .cse27 .cse7 v_ArrVal_2510) .cse4 (+ .cse11 1))) |c_~#stored_elements~0.base| v_ArrVal_2513))) (let ((.cse24 (let ((.cse25 (select .cse23 |c_~#queue~0.base|))) (store .cse25 (+ (* (select .cse25 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2515)))) (let ((.cse0 (select .cse24 .cse4))) (let ((.cse20 (store (store .cse23 |c_~#queue~0.base| (store (store .cse24 .cse7 v_ArrVal_2516) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2520))) (let ((.cse21 (let ((.cse22 (select .cse20 |c_~#queue~0.base|))) (store .cse22 (+ |c_~#queue~0.offset| (* (select .cse22 .cse4) 4)) v_ArrVal_2522)))) (let ((.cse1 (select .cse21 .cse4))) (let ((.cse17 (store (store .cse20 |c_~#queue~0.base| (store (store .cse21 .cse7 v_ArrVal_2524) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_2527))) (let ((.cse18 (let ((.cse19 (select .cse17 |c_~#queue~0.base|))) (store .cse19 (+ (* (select .cse19 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2529)))) (let ((.cse2 (select .cse18 .cse4))) (let ((.cse14 (store (store .cse17 |c_~#queue~0.base| (store (store .cse18 .cse7 v_ArrVal_2531) .cse4 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_2534))) (let ((.cse15 (let ((.cse16 (select .cse14 |c_~#queue~0.base|))) (store .cse16 (+ |c_~#queue~0.offset| (* 4 (select .cse16 .cse4))) v_ArrVal_2535)))) (let ((.cse12 (select .cse15 .cse4))) (let ((.cse5 (store (store .cse14 |c_~#queue~0.base| (store (store .cse15 .cse7 v_ArrVal_2537) .cse4 (+ .cse12 1))) |c_~#stored_elements~0.base| v_ArrVal_2541))) (let ((.cse6 (let ((.cse13 (select .cse5 |c_~#queue~0.base|))) (store .cse13 (+ (* (select .cse13 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_2542)))) (let ((.cse8 (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 (+ .cse8 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)) (= .cse8 20) (= 20 .cse9) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_303| (select .cse10 .cse4))) (= .cse11 20) (= .cse12 20))))))))))))))))))))))))) is different from false [2022-11-16 00:42:44,997 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:42:44,997 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-16 00:42:48,047 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 00:42:48,048 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-16 00:42:49,490 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-16 00:42:51,111 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-16 00:42:51,354 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-16 00:42:52,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233958 treesize of output 228966 [2022-11-16 00:42:54,542 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-16 00:42:57,125 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-16 00:43:00,092 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-16 00:43:03,821 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 Received shutdown request... [2022-11-16 00:43:08,053 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 00:43:08,059 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-16 00:43:08,059 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 00:43:08,059 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-16 00:43:08,059 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 00:43:08,059 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-16 00:43:08,059 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 00:43:08,059 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 00:43:08,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 00:43:08,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 00:43:08,275 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 ∧-2-2-2-1 context. [2022-11-16 00:43:08,276 INFO L444 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1] [2022-11-16 00:43:08,276 INFO L307 ceAbstractionStarter]: Result for error location t2Err0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (5/5) [2022-11-16 00:43:08,278 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 00:43:08,278 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 00:43:08,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:43:08 BasicIcfg [2022-11-16 00:43:08,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 00:43:08,293 INFO L158 Benchmark]: Toolchain (without parser) took 855872.41ms. Allocated memory was 220.2MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 163.3MB in the beginning and 824.2MB in the end (delta: -660.9MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-11-16 00:43:08,293 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 220.2MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 00:43:08,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.22ms. Allocated memory was 220.2MB in the beginning and 271.6MB in the end (delta: 51.4MB). Free memory was 163.0MB in the beginning and 225.3MB in the end (delta: -62.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-11-16 00:43:08,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.45ms. Allocated memory is still 271.6MB. Free memory was 225.3MB in the beginning and 222.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-16 00:43:08,294 INFO L158 Benchmark]: Boogie Preprocessor took 45.57ms. Allocated memory is still 271.6MB. Free memory was 222.7MB in the beginning and 220.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 00:43:08,294 INFO L158 Benchmark]: RCFGBuilder took 516.18ms. Allocated memory is still 271.6MB. Free memory was 220.6MB in the beginning and 199.1MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-16 00:43:08,294 INFO L158 Benchmark]: TraceAbstraction took 854820.65ms. Allocated memory was 271.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 198.6MB in the beginning and 824.2MB in the end (delta: -625.6MB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-11-16 00:43:08,296 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 220.2MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 448.22ms. Allocated memory was 220.2MB in the beginning and 271.6MB in the end (delta: 51.4MB). Free memory was 163.0MB in the beginning and 225.3MB in the end (delta: -62.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.45ms. Allocated memory is still 271.6MB. Free memory was 225.3MB in the beginning and 222.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.57ms. Allocated memory is still 271.6MB. Free memory was 222.7MB in the beginning and 220.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 516.18ms. Allocated memory is still 271.6MB. Free memory was 220.6MB in the beginning and 199.1MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 854820.65ms. Allocated memory was 271.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 198.6MB in the beginning and 824.2MB in the end (delta: -625.6MB). 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: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 2 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 62, Number of trivial persistent sets: 62, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 2 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 2 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 69, Number of trivial persistent sets: 69, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 2 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4931, independent: 4880, independent conditional: 47, independent unconditional: 4833, dependent: 51, dependent conditional: 17, 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: 4923, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4923, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4923, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 43, dependent conditional: 0, dependent unconditional: 43, 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: 122, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4923, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 0, Maximal queried relation: 0, Independence queries for same thread: 8 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 129, Number of trivial persistent sets: 113, 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: 4931, independent: 4880, independent conditional: 47, independent unconditional: 4833, dependent: 51, dependent conditional: 17, 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: 4923, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4923, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4923, independent: 4880, independent conditional: 0, independent unconditional: 4880, dependent: 43, dependent conditional: 0, dependent unconditional: 43, 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: 122, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4923, independent: 165, independent conditional: 0, independent unconditional: 165, dependent: 9, dependent conditional: 0, dependent unconditional: 9, 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: 0, Maximal queried relation: 0, Independence queries for same thread: 8 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 0, Number of trivial persistent sets: 0, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - 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: 99, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 62, dependent conditional: 4, dependent unconditional: 59, 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: 99, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 62, dependent conditional: 4, dependent unconditional: 59, 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 ∧-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 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 thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.2s, 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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t2Err0ASSERT_VIOLATIONERROR_FUNCTION with 2 thread instances CFG has 5 procedures, 347 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 853.9s, OverallIterations: 13, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 45.2s, 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: 298, 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.6s SatisfiabilityAnalysisTime, 35.2s 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