/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-9868fc6-m [2022-11-14 19:04:11,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-14 19:04:11,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-14 19:04:11,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-14 19:04:11,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-14 19:04:11,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-14 19:04:11,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-14 19:04:11,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-14 19:04:11,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-14 19:04:11,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-14 19:04:11,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-14 19:04:11,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-14 19:04:11,615 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-14 19:04:11,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-14 19:04:11,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-14 19:04:11,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-14 19:04:11,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-14 19:04:11,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-14 19:04:11,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-14 19:04:11,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-14 19:04:11,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-14 19:04:11,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-14 19:04:11,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-14 19:04:11,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-14 19:04:11,637 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-14 19:04:11,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-14 19:04:11,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-14 19:04:11,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-14 19:04:11,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-14 19:04:11,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-14 19:04:11,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-14 19:04:11,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-14 19:04:11,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-14 19:04:11,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-14 19:04:11,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-14 19:04:11,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-14 19:04:11,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-14 19:04:11,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-14 19:04:11,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-14 19:04:11,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-14 19:04:11,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-14 19:04:11,648 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-14 19:04:11,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-14 19:04:11,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-14 19:04:11,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-14 19:04:11,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-14 19:04:11,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-14 19:04:11,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-14 19:04:11,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-14 19:04:11,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-14 19:04:11,687 INFO L138 SettingsManager]: * Use SBE=true [2022-11-14 19:04:11,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-14 19:04:11,687 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-14 19:04:11,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-14 19:04:11,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-14 19:04:11,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-14 19:04:11,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-14 19:04:11,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-14 19:04:11,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-14 19:04:11,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-14 19:04:11,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-14 19:04:11,688 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-14 19:04:11,688 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-14 19:04:11,688 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-14 19:04:11,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-14 19:04:11,689 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-14 19:04:11,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-14 19:04:11,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:04:11,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-14 19:04:11,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-14 19:04:11,690 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-14 19:04:11,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-14 19:04:11,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-14 19:04:11,691 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-14 19:04:11,691 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-14 19:04:11,691 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-14 19:04:11,691 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-14 19:04:11,692 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-14 19:04:11,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-11-14 19:04:11,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-14 19:04:11,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-14 19:04:11,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-14 19:04:11,973 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-14 19:04:11,974 INFO L275 PluginConnector]: CDTParser initialized [2022-11-14 19:04:11,976 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-14 19:04:12,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29aa0422/479a783464b648dbbef4a22b3ea6d7a2/FLAGb3f7ce1ca [2022-11-14 19:04:12,558 INFO L306 CDTParser]: Found 1 translation units. [2022-11-14 19:04:12,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2022-11-14 19:04:12,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29aa0422/479a783464b648dbbef4a22b3ea6d7a2/FLAGb3f7ce1ca [2022-11-14 19:04:13,015 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d29aa0422/479a783464b648dbbef4a22b3ea6d7a2 [2022-11-14 19:04:13,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-14 19:04:13,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-14 19:04:13,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-14 19:04:13,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-14 19:04:13,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-14 19:04:13,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff22790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13, skipping insertion in model container [2022-11-14 19:04:13,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-14 19:04:13,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-14 19:04:13,449 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-14 19:04:13,460 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-14 19:04:13,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:04:13,471 INFO L203 MainTranslator]: Completed pre-run [2022-11-14 19:04:13,513 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-14 19:04:13,515 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-14 19:04:13,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:04:13,568 INFO L208 MainTranslator]: Completed translation [2022-11-14 19:04:13,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13 WrapperNode [2022-11-14 19:04:13,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-14 19:04:13,570 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-14 19:04:13,570 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-14 19:04:13,570 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-14 19:04:13,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,634 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-11-14 19:04:13,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-14 19:04:13,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-14 19:04:13,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-14 19:04:13,635 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-14 19:04:13,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,659 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,661 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-14 19:04:13,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-14 19:04:13,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-14 19:04:13,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-14 19:04:13,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (1/1) ... [2022-11-14 19:04:13,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:04:13,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:13,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-14 19:04:13,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-14 19:04:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-14 19:04:13,754 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-14 19:04:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-14 19:04:13,754 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-14 19:04:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-14 19:04:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-14 19:04:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-14 19:04:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-14 19:04:13,754 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-14 19:04:13,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-14 19:04:13,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-14 19:04:13,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-14 19:04:13,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-14 19:04:13,756 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-14 19:04:13,878 INFO L235 CfgBuilder]: Building ICFG [2022-11-14 19:04:13,880 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-14 19:04:14,323 INFO L276 CfgBuilder]: Performing block encoding [2022-11-14 19:04:14,332 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-14 19:04:14,332 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-14 19:04:14,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:04:14 BoogieIcfgContainer [2022-11-14 19:04:14,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-14 19:04:14,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-14 19:04:14,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-14 19:04:14,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-14 19:04:14,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:04:13" (1/3) ... [2022-11-14 19:04:14,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45380a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:04:14, skipping insertion in model container [2022-11-14 19:04:14,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:04:13" (2/3) ... [2022-11-14 19:04:14,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45380a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:04:14, skipping insertion in model container [2022-11-14 19:04:14,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:04:14" (3/3) ... [2022-11-14 19:04:14,349 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-14 19:04:14,356 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-14 19:04:14,365 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-14 19:04:14,366 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-14 19:04:14,366 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-14 19:04:14,449 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-14 19:04:14,493 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:04:14,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-14 19:04:14,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:14,500 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-14 19:04:14,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-14 19:04:14,555 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-14 19:04:14,581 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2022-11-14 19:04:14,592 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;@326033c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:04:14,592 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-14 19:04:14,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:14,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1093845670, now seen corresponding path program 1 times [2022-11-14 19:04:14,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:14,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485022755] [2022-11-14 19:04:14,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:15,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:15,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485022755] [2022-11-14 19:04:15,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485022755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:15,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:15,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-14 19:04:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857918275] [2022-11-14 19:04:15,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:15,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-14 19:04:15,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:15,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-14 19:04:15,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-14 19:04:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:15,161 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:15,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.0) internal successors, (88), 2 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:15,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:15,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:15,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-14 19:04:15,195 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:15,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:15,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1891215175, now seen corresponding path program 1 times [2022-11-14 19:04:15,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:15,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887712186] [2022-11-14 19:04:15,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:15,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:25,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:25,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887712186] [2022-11-14 19:04:25,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887712186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:25,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:25,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-14 19:04:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482906916] [2022-11-14 19:04:25,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:25,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-14 19:04:25,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-14 19:04:25,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-14 19:04:25,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:25,699 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:25,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.526315789473684) internal successors, (86), 20 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:25,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:25,700 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:29,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-14 19:04:29,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:29,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:29,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1705076601, now seen corresponding path program 1 times [2022-11-14 19:04:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:29,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138558173] [2022-11-14 19:04:29,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:29,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:29,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:29,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138558173] [2022-11-14 19:04:29,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138558173] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:29,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:29,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:04:29,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021950613] [2022-11-14 19:04:29,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:29,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:04:29,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:29,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:04:29,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:04:29,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:29,216 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:29,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 34.0) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:29,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:29,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:29,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:29,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-14 19:04:29,307 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash -858914285, now seen corresponding path program 1 times [2022-11-14 19:04:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:29,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928373853] [2022-11-14 19:04:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:30,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:30,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928373853] [2022-11-14 19:04:30,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928373853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:30,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:30,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-14 19:04:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67604373] [2022-11-14 19:04:30,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:30,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-14 19:04:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:30,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-14 19:04:30,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-14 19:04:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:30,549 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:30,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:30,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:30,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:30,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:30,549 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:31,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-14 19:04:31,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-14 19:04:31,046 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:31,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:31,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1672081442, now seen corresponding path program 1 times [2022-11-14 19:04:31,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:31,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093961743] [2022-11-14 19:04:31,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:31,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:33,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:33,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093961743] [2022-11-14 19:04:33,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093961743] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:04:33,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:04:33,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-11-14 19:04:33,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347422403] [2022-11-14 19:04:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:04:33,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-14 19:04:33,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:33,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-14 19:04:33,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-11-14 19:04:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:33,752 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:33,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.052631578947368) internal successors, (96), 20 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:33,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:33,752 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:33,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:33,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2022-11-14 19:04:33,753 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:35,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:35,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-14 19:04:35,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:35,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:35,197 INFO L85 PathProgramCache]: Analyzing trace with hash 678632843, now seen corresponding path program 1 times [2022-11-14 19:04:35,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:35,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7838270] [2022-11-14 19:04:35,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:35,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:37,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:37,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7838270] [2022-11-14 19:04:37,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7838270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:04:37,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313553336] [2022-11-14 19:04:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:37,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:04:37,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:37,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:04:37,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-14 19:04:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:37,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-14 19:04:37,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:04:38,010 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:04:38,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:04:38,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-14 19:04:38,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:04:38,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:04:39,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:39,131 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:04:39,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:04:39,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:39,365 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:39,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:04:39,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:04:39,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:39,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:04:40,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:40,174 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:04:40,189 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-14 19:04:40,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-11-14 19:04:40,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-14 19:04:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:40,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:04:40,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|))))))) is different from false [2022-11-14 19:04:40,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_182 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2022-11-14 19:04:41,216 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 ((.cse1 (select .cse2 .cse3))) (or (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int)) (let ((.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_180) .cse3 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_180 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ .cse1 1) v_ArrVal_182)))) (= .cse1 20)))) is different from false [2022-11-14 19:04:41,297 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 ((.cse0 (select .cse2 .cse3))) (or (= .cse0 20) (forall ((v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_180) .cse3 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_180) (< (+ .cse0 1) v_ArrVal_182))))))) is different from false [2022-11-14 19:04:41,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int)) (let ((.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_178)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_180) .cse4 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (= 20 .cse0) (< (+ .cse0 1) v_ArrVal_182) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 (+ 84 |c_~#queue~0.offset|)))) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ 1 (select .cse2 .cse3)) v_ArrVal_180))))) is different from false [2022-11-14 19:04:42,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_180 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_178)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse5 (select .cse3 .cse1)) (.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_180) .cse1 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse2 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_180) (= .cse5 20) (< (+ .cse5 1) v_ArrVal_182) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2022-11-14 19:04:42,115 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_182 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_180 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_178)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_180) .cse4 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|)) (.cse0 (select .cse5 .cse4))) (or (= .cse0 20) (< (select (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) .cse2) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse3 .cse4))) (< (+ (select .cse5 .cse2) 1) v_ArrVal_180) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse1 .cse4))) (< (+ .cse0 1) v_ArrVal_182)))))) is different from false [2022-11-14 19:04:42,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_182 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_180 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_177))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_178)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 .cse3 v_ArrVal_180) .cse1 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|)) (.cse2 (select .cse5 .cse1))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_182) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse4 .cse1))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_180) (= .cse2 20))))))) is different from false [2022-11-14 19:04:43,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 Int) (v_ArrVal_175 Int) (v_ArrVal_184 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| Int) (v_ArrVal_186 Int) (v_ArrVal_177 (Array Int Int)) (v_ArrVal_182 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| Int) (v_ArrVal_180 Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_175)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_177))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15|) |c_~#queue~0.offset|) v_ArrVal_178)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_180) .cse1 v_ArrVal_182)) |c_~#stored_elements~0.base| v_ArrVal_184) |c_~#queue~0.base|)) (.cse2 (select .cse3 .cse1))) (or (not (<= v_ArrVal_175 0)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12| (select .cse0 .cse1))) (< (+ .cse2 1) v_ArrVal_182) (< (+ (select .cse3 .cse4) 1) v_ArrVal_180) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_12|)) v_ArrVal_186) .cse4) 2147483647) (= 20 .cse2) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_15| (select .cse5 .cse1))))))))) is different from false [2022-11-14 19:04:43,189 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:04:43,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 283 treesize of output 183 [2022-11-14 19:04:43,213 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:04:43,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 343 [2022-11-14 19:04:43,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 178 [2022-11-14 19:04:43,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 157 [2022-11-14 19:04:43,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-14 19:04:43,482 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:04:43,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 213 treesize of output 225 [2022-11-14 19:04:45,297 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:04:45,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:04:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-14 19:04:45,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313553336] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:04:45,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:04:45,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 29] total 80 [2022-11-14 19:04:45,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392434481] [2022-11-14 19:04:45,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:04:45,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-14 19:04:45,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:45,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-14 19:04:45,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=4488, Unknown=42, NotChecked=1332, Total=6480 [2022-11-14 19:04:45,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:45,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 80 states have (on average 4.2875) internal successors, (343), 81 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:45,349 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:55,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:04:55,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-14 19:04:56,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-14 19:04:56,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:04:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:04:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -437217722, now seen corresponding path program 1 times [2022-11-14 19:04:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:04:56,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702277789] [2022-11-14 19:04:56,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:04:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:57,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:04:57,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702277789] [2022-11-14 19:04:57,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702277789] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:04:57,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038941947] [2022-11-14 19:04:57,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:04:57,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:04:57,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:04:57,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:04:57,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-14 19:04:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:04:57,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-14 19:04:57,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:04:57,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-14 19:04:57,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-14 19:04:57,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:04:57,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-14 19:04:58,222 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-14 19:04:58,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 32 [2022-11-14 19:04:58,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-14 19:04:58,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:58,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:04:59,054 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:04:59,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2022-11-14 19:04:59,063 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:04:59,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 60 [2022-11-14 19:04:59,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-11-14 19:04:59,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2022-11-14 19:04:59,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:04:59,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2022-11-14 19:04:59,423 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:04:59,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038941947] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:04:59,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:04:59,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 50 [2022-11-14 19:04:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397460528] [2022-11-14 19:04:59,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:04:59,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-14 19:04:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:04:59,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-14 19:04:59,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2268, Unknown=19, NotChecked=0, Total=2550 [2022-11-14 19:04:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:59,426 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:04:59,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 6.9) internal successors, (345), 51 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:04:59,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:04:59,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:59,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:04:59,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:04:59,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:04:59,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:04:59,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:07,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-14 19:05:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-14 19:05:07,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-14 19:05:07,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:07,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:07,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1797555879, now seen corresponding path program 1 times [2022-11-14 19:05:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:07,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864022403] [2022-11-14 19:05:07,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:07,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-14 19:05:08,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:08,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864022403] [2022-11-14 19:05:08,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864022403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:05:08,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:05:08,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:05:08,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056757402] [2022-11-14 19:05:08,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:05:08,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:05:08,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:05:08,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:05:08,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:08,028 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:08,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:05:08,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:08,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:08,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:08,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:08,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:08,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-14 19:05:08,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-14 19:05:08,029 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:08,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-14 19:05:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-14 19:05:08,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:08,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-14 19:05:08,056 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash 110343253, now seen corresponding path program 1 times [2022-11-14 19:05:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:08,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246100607] [2022-11-14 19:05:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:08,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:08,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:08,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246100607] [2022-11-14 19:05:08,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246100607] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:08,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054567405] [2022-11-14 19:05:08,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:08,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:08,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:08,165 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:05:08,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-14 19:05:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:08,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-14 19:05:08,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:08,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-14 19:05:08,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054567405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:05:08,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-14 19:05:08,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-11-14 19:05:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918565328] [2022-11-14 19:05:08,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:05:08,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-14 19:05:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:08,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-14 19:05:08,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-14 19:05:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:08,388 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:08,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 36.0) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:05:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-14 19:05:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-11-14 19:05:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:08,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:05:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:08,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-14 19:05:08,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:08,749 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:08,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash 119995393, now seen corresponding path program 1 times [2022-11-14 19:05:08,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:08,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013941511] [2022-11-14 19:05:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:12,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:12,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013941511] [2022-11-14 19:05:12,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013941511] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:12,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811250795] [2022-11-14 19:05:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:12,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:12,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:12,383 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:05:12,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-14 19:05:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:12,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-14 19:05:12,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:12,713 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:05:12,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:05:12,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-14 19:05:12,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:05:13,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:05:13,682 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:13,690 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:05:13,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:05:13,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:13,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:05:14,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:05:14,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:14,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 16 treesize of output 18 [2022-11-14 19:05:14,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:14,390 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:05:14,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-14 19:05:14,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:14,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-14 19:05:14,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-14 19:05:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:14,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:05:14,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 20))))) is different from false [2022-11-14 19:05:15,023 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 20))))) is different from false [2022-11-14 19:05:15,052 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 20))))) is different from false [2022-11-14 19:05:15,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:05:15,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:05:15,192 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (v_ArrVal_430 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_430)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:05:15,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| 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_32| (select .cse0 .cse1))) (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (v_ArrVal_430 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_430))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_432) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 .cse3))))))))) is different from false [2022-11-14 19:05:15,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_430 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_430))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_432) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse3))))))) is different from false [2022-11-14 19:05:15,561 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_430 Int) (v_ArrVal_428 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_437 Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_428))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_430))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_432) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse2 .cse1)))))))) is different from false [2022-11-14 19:05:15,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| Int) (v_ArrVal_430 Int) (v_ArrVal_428 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| Int) (v_ArrVal_426 Int) (v_ArrVal_437 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_426)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_428))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32|) |c_~#queue~0.offset|) v_ArrVal_430))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_432) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_435) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29|) |c_~#queue~0.offset|) v_ArrVal_437) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_32| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_29| (select .cse0 .cse1)))))))) is different from false [2022-11-14 19:05:15,882 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:15,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 244 treesize of output 159 [2022-11-14 19:05:15,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:15,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 275 treesize of output 273 [2022-11-14 19:05:15,904 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 287 treesize of output 275 [2022-11-14 19:05:15,912 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 275 treesize of output 259 [2022-11-14 19:05:15,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-14 19:05:16,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:16,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 93 [2022-11-14 19:05:16,497 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:05:16,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:05:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 43 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2022-11-14 19:05:16,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811250795] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:05:16,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:05:16,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 23, 25] total 80 [2022-11-14 19:05:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020394356] [2022-11-14 19:05:16,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:05:16,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-11-14 19:05:16,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:16,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-11-14 19:05:16,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=4401, Unknown=10, NotChecked=1450, Total=6320 [2022-11-14 19:05:16,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:16,543 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:16,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 5.2625) internal successors, (421), 80 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:16,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:36,715 WARN L233 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:05:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:36,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:05:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-14 19:05:36,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-14 19:05:36,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-14 19:05:36,921 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:36,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:36,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1303619980, now seen corresponding path program 1 times [2022-11-14 19:05:36,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:36,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675650117] [2022-11-14 19:05:36,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:36,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:38,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675650117] [2022-11-14 19:05:38,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675650117] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932201374] [2022-11-14 19:05:38,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:38,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:38,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:38,590 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:05:38,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-14 19:05:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:38,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-14 19:05:38,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:38,821 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:05:38,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:05:38,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-14 19:05:39,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:05:39,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:05:39,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:39,589 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:05:39,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:05:39,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:39,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-14 19:05:39,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:05:40,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:40,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:05:40,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:40,208 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:05:40,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 27 [2022-11-14 19:05:40,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:40,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-14 19:05:40,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-14 19:05:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:40,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:05:40,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (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_511) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_512)) .cse1)) 2147483647)) is different from false [2022-11-14 19:05:40,803 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (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_511) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_512)) .cse1)) 2147483647)) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem39#1| 20)) is different from false [2022-11-14 19:05:40,891 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_508 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (< (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_508) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse2)) 2147483647))))) is different from false [2022-11-14 19:05:40,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.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_505)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (< (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_508) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse2)) 2147483647))))) is different from false [2022-11-14 19:05:40,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| 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_39| (select .cse0 .cse1))) (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_505))) (let ((.cse2 (select .cse5 .cse1))) (or (= .cse2 20) (< (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse4)) 2147483647)))))))) is different from false [2022-11-14 19:05:41,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_508 Int) (v_ArrVal_505 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_505)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 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_508) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* 4 (select .cse1 .cse2))) v_ArrVal_512)) .cse2)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse5 .cse4)))))))) is different from false [2022-11-14 19:05:41,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_508 Int) (v_ArrVal_505 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_504))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_505)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse1 .cse2))) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_508) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse2) 2147483647))))))) is different from false [2022-11-14 19:05:41,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_504 (Array Int Int)) (v_ArrVal_508 Int) (v_ArrVal_505 Int) (v_ArrVal_503 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_512 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_503)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_504))) (let ((.cse1 (select .cse4 |c_~#queue~0.base|))) (let ((.cse5 (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39|) |c_~#queue~0.offset|) v_ArrVal_505)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= .cse0 20) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_39| (select .cse1 .cse2))) (< (select (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_508) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_512)) .cse2) 2147483647))))))) is different from false [2022-11-14 19:05:41,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:41,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 173 [2022-11-14 19:05:41,676 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:41,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 261 treesize of output 257 [2022-11-14 19:05:41,686 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 174 treesize of output 154 [2022-11-14 19:05:41,694 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 201 [2022-11-14 19:05:41,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-14 19:05:42,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:42,367 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 649 treesize of output 537 [2022-11-14 19:05:42,716 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:05:42,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:05:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-11-14 19:05:42,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932201374] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:05:42,751 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:05:42,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 27] total 71 [2022-11-14 19:05:42,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711601992] [2022-11-14 19:05:42,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:05:42,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-14 19:05:42,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:42,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-14 19:05:42,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=3525, Unknown=39, NotChecked=1048, Total=5112 [2022-11-14 19:05:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:42,754 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:42,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 5.253521126760563) internal successors, (373), 72 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-14 19:05:42,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:45,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-14 19:05:45,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-14 19:05:45,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-14 19:05:45,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:45,241 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:05:45,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:05:45,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1757513073, now seen corresponding path program 1 times [2022-11-14 19:05:45,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:05:45,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720384763] [2022-11-14 19:05:45,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:45,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:05:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:47,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:05:47,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720384763] [2022-11-14 19:05:47,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720384763] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:05:47,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961549625] [2022-11-14 19:05:47,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:05:47,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:05:47,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:05:47,068 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:05:47,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-14 19:05:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:05:47,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-14 19:05:47,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:05:47,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2022-11-14 19:05:48,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:48,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-11-14 19:05:48,296 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:05:48,304 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:05:48,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 33 [2022-11-14 19:05:48,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:05:48,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-14 19:05:48,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-14 19:05:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:48,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:05:48,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_579 Int)) (< 0 (+ 2147483650 (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_578) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_579)) .cse1))))) is different from false [2022-11-14 19:05:49,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:49,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 52 [2022-11-14 19:05:49,122 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:49,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 75 [2022-11-14 19:05:49,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2022-11-14 19:05:49,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-14 19:05:49,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:05:49,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 52 [2022-11-14 19:05:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:05:49,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961549625] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:05:49,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:05:49,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 18] total 58 [2022-11-14 19:05:49,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025802581] [2022-11-14 19:05:49,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:05:49,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-14 19:05:49,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:05:49,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-14 19:05:49,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2948, Unknown=15, NotChecked=112, Total=3422 [2022-11-14 19:05:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:49,446 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:05:49,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 6.517241379310345) internal successors, (378), 59 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:05:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:05:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:05:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:05:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:05:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:05:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:05:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:05:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-14 19:05:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-14 19:05:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:06:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:06:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:06:06,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-14 19:06:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:06:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:06:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:06:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:06:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:06:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:06:06,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-14 19:06:06,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:06:06,667 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:06:06,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:06:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1525993803, now seen corresponding path program 2 times [2022-11-14 19:06:06,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:06:06,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241611484] [2022-11-14 19:06:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:06:06,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:06:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:06:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:06:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:06:13,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241611484] [2022-11-14 19:06:13,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241611484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:06:13,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330716843] [2022-11-14 19:06:13,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:06:13,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:06:13,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:06:13,348 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:06:13,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-14 19:06:13,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:06:13,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:06:13,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-14 19:06:13,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:06:13,658 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:06:13,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:06:13,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-14 19:06:13,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:06:14,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:06:14,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:14,604 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:06:14,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:06:14,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:14,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:14,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:15,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:15,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:15,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:06:15,554 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:15,568 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:06:15,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:06:15,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:15,777 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:15,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:16,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:16,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:16,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-14 19:06:16,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:16,595 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2022-11-14 19:06:16,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 39 [2022-11-14 19:06:16,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:16,855 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:16,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:17,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2022-11-14 19:06:17,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:17,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 25 treesize of output 25 [2022-11-14 19:06:17,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:06:17,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:06:17,492 INFO L321 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2022-11-14 19:06:17,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 37 [2022-11-14 19:06:17,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-14 19:06:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:06:17,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:06:17,932 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (not (<= v_ArrVal_694 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)))))) is different from false [2022-11-14 19:06:18,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 (+ 84 |c_~#queue~0.offset|)))))))) is different from false [2022-11-14 19:06:18,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_692) .cse2 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_694) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 88 |c_~#queue~0.offset|)) 2147483647) (not (<= v_ArrVal_692 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))))))) is different from false [2022-11-14 19:06:19,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| 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_53| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_690)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse4 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse1) 1) v_ArrVal_694) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse2 .cse4) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 (+ 84 |c_~#queue~0.offset|))))))))))) is different from false [2022-11-14 19:06:19,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse1 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_690)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse1 .cse2 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 (+ 84 |c_~#queue~0.offset|)))) (< (+ (select .cse1 .cse2) 1) v_ArrVal_692) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (+ (select .cse1 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse3)))))))) is different from false [2022-11-14 19:06:28,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse2 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (< (+ (select .cse0 .cse2) 1) v_ArrVal_692) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse2) 2147483647) (not (<= v_ArrVal_688 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse1))))))))) is different from false [2022-11-14 19:06:31,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_686) .cse6 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse3))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_688) (not (<= v_ArrVal_686 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))))))) is different from false [2022-11-14 19:06:31,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_686) .cse6 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse4 .cse3))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem37#1| 1) v_ArrVal_686) (< (+ (select .cse2 .cse1) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse0 .cse3))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_688)))))))) is different from false [2022-11-14 19:06:34,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_683)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_686) .cse2 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse7 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse6 (+ 84 |c_~#queue~0.offset|))) (let ((.cse5 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_692) .cse6 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (< (+ (select .cse0 .cse2) 1) v_ArrVal_688) (< (+ (select .cse3 .cse4) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse6))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse7 .cse6))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse4) 2147483647) (< (+ (select .cse3 .cse6) 1) v_ArrVal_694)))))))) is different from false [2022-11-14 19:06:34,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| 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_56| (select .cse0 .cse1))) (forall ((v_ArrVal_689 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int)) (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_683)) (.cse8 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse7 .cse8 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse2 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (< (+ (select .cse2 .cse5) 1) v_ArrVal_692) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_686) (< (+ (select .cse7 .cse1) 1) v_ArrVal_688))))))))))) is different from false [2022-11-14 19:06:34,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_683)) (.cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse0 .cse5 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse6 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse7 .cse8 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse4 .cse1))) (< (+ (select .cse0 .cse5) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse6 .cse3))) (< (+ (select .cse7 .cse8) 1) v_ArrVal_692) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse8) 2147483647) (< (+ (select .cse7 .cse3) 1) v_ArrVal_694))))))))) is different from false [2022-11-14 19:06:53,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_690 Int)) (let ((.cse8 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse2 .cse3))) (< (+ (select .cse0 .cse3) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse3))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_694) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647)))))))))) is different from false [2022-11-14 19:06:53,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse0 (select .cse8 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse8 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 .cse3 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_686) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_688) (not (<= v_ArrVal_680 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse1))) (< (+ (select .cse6 .cse3) 1) v_ArrVal_692) (< (+ (select .cse6 .cse1) 1) v_ArrVal_694)))))))))) is different from false [2022-11-14 19:06:53,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse7 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse3 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_686) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse3) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_688) (< (+ (select .cse5 .cse6) 1) v_ArrVal_680) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse1))) (< (+ (select .cse8 .cse3) 1) v_ArrVal_692) (< (+ (select .cse8 .cse1) 1) v_ArrVal_694))))))))))) is different from false [2022-11-14 19:06:54,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_679) .cse6 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse3 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse2 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse0 .cse1))) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse3) 2147483647) (< (+ (select .cse4 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse2 .cse1))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_692) (not (<= v_ArrVal_679 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1))) (< (+ (select .cse5 .cse6) 1) v_ArrVal_680) (< (+ (select .cse7 .cse3) 1) v_ArrVal_686) (< (+ (select .cse7 .cse1) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse1))))))))))))) is different from false [2022-11-14 19:06:54,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_679) .cse7 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse5 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse9 (select .cse10 |c_~#queue~0.base|))) (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_679) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse2 .cse3))) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse6 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse3))) (< (+ (select .cse6 .cse5) 1) v_ArrVal_692) (< (+ (select .cse0 .cse7) 1) v_ArrVal_680) (< (+ (select .cse8 .cse5) 1) v_ArrVal_686) (< (+ (select .cse8 .cse3) 1) v_ArrVal_688) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse9 .cse3))))))))))))) is different from false [2022-11-14 19:06:54,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.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_677)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_679) .cse9 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse4 .cse5 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse0 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse0 .cse5 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_694) (< (+ (select .cse2 .cse3) 1) v_ArrVal_679) (< (+ (select .cse4 .cse5) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse6 .cse1))) (< (+ (select .cse0 .cse5) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse7 .cse1))) (< (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse2 .cse9) 1) v_ArrVal_680) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse8 .cse1))) (< (+ (select .cse4 .cse1) 1) v_ArrVal_688))))))))))) is different from false [2022-11-14 19:06:55,092 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse12 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int)) (let ((.cse6 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_677)) (.cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse11 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 .cse9 v_ArrVal_679) .cse7 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse8 .cse4 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse5 (select (store (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_694) (< (+ (select .cse6 .cse7) 1) v_ArrVal_680) (< (+ (select .cse8 .cse1) 1) v_ArrVal_688) (< (+ (select .cse6 .cse9) 1) v_ArrVal_679) (< (+ (select .cse8 .cse4) 1) v_ArrVal_686) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse4) 2147483647))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse12 .cse7)))))) is different from false [2022-11-14 19:06:55,284 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_677)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse12 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 .cse3 v_ArrVal_679) .cse7 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse4 (select .cse12 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683)) (.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse11 (store (store .cse12 |c_~#queue~0.base| (store (store .cse0 .cse8 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse6 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse10 (select (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_688) (< (+ (select .cse2 .cse3) 1) v_ArrVal_679) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse6 .cse1))) (< (+ 1 (select .cse2 .cse7)) v_ArrVal_680) (< (+ (select .cse0 .cse8) 1) v_ArrVal_686) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse9 .cse7))) (< (select (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse8) 2147483647) (< (+ (select .cse5 .cse8) 1) v_ArrVal_692) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse10 .cse1)))))))))))))) is different from false [2022-11-14 19:06:55,542 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_677)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_679) .cse3 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse0 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse5 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_692) (< (+ (select .cse2 .cse1) 1) v_ArrVal_686) (< (+ (select .cse0 .cse3) 1) v_ArrVal_694) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse5 .cse3))) (< (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (< (+ (select .cse6 .cse3) 1) v_ArrVal_680) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse7 .cse3))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_688) (< (+ (select .cse6 .cse1) 1) v_ArrVal_679) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse3)))))))))))))) is different from false [2022-11-14 19:06:56,539 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int)) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_675))) (let ((.cse4 (select .cse11 |c_~#queue~0.base|))) (let ((.cse0 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_677)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_679) .cse3 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse1 v_ArrVal_686) .cse3 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse8 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse1 v_ArrVal_692) .cse3 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_679) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse5 .cse3))) (< (+ (select .cse6 .cse1) 1) v_ArrVal_692) (< (+ (select .cse7 .cse3) 1) v_ArrVal_688) (< (+ (select .cse6 .cse3) 1) v_ArrVal_694) (< (+ (select .cse0 .cse3) 1) v_ArrVal_680) (< (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse8 .cse3))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_686))))))))))))) is different from false [2022-11-14 19:06:58,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_696 (Array Int Int)) (v_ArrVal_679 Int) (v_ArrVal_675 (Array Int Int)) (v_ArrVal_677 Int) (v_ArrVal_688 Int) (v_ArrVal_689 (Array Int Int)) (v_ArrVal_698 Int) (v_ArrVal_686 Int) (v_ArrVal_674 Int) (v_ArrVal_683 Int) (v_ArrVal_694 Int) (v_ArrVal_692 Int) (v_ArrVal_680 Int) (v_ArrVal_690 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| Int)) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_674)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_675))) (let ((.cse0 (select .cse11 |c_~#queue~0.base|))) (let ((.cse6 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59|) |c_~#queue~0.offset|) v_ArrVal_677)) (.cse5 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_679) .cse1 v_ArrVal_680)) |c_~#stored_elements~0.base| v_ArrVal_682))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_683))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse5 v_ArrVal_686) .cse1 v_ArrVal_688)) |c_~#stored_elements~0.base| v_ArrVal_689))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse3 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53|) |c_~#queue~0.offset|) v_ArrVal_690))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse5 v_ArrVal_692) .cse1 v_ArrVal_694)) |c_~#stored_elements~0.base| v_ArrVal_696) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_59| (select .cse0 .cse1))) (not (<= v_ArrVal_674 0)) (< (+ (select .cse2 .cse1) 1) v_ArrVal_688) (< (+ (select .cse3 .cse1) 1) v_ArrVal_694) (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50|) |c_~#queue~0.offset|) v_ArrVal_698) .cse5) 2147483647) (< (+ (select .cse2 .cse5) 1) v_ArrVal_686) (< (+ (select .cse6 .cse1) 1) v_ArrVal_680) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| (select .cse7 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_50| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_53| (select .cse8 .cse1))) (< (+ (select .cse6 .cse5) 1) v_ArrVal_679) (< (+ (select .cse3 .cse5) 1) v_ArrVal_692))))))))))))) is different from false [2022-11-14 19:06:58,144 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:58,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1481 treesize of output 946 [2022-11-14 19:06:58,188 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:06:58,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2026 treesize of output 2014 [2022-11-14 19:06:58,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 938 treesize of output 874 [2022-11-14 19:06:58,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 729 treesize of output 717 [2022-11-14 19:06:58,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1331 treesize of output 1283 [2022-11-14 19:06:58,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1427 treesize of output 1403 [2022-11-14 19:06:58,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-14 19:07:00,238 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:07:00,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 397 [2022-11-14 19:07:02,052 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:07:02,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:07:02,100 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 40 refuted. 14 times theorem prover too weak. 0 trivial. 117 not checked. [2022-11-14 19:07:02,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330716843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:07:02,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:07:02,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 44, 49] total 135 [2022-11-14 19:07:02,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151058546] [2022-11-14 19:07:02,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:07:02,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 136 states [2022-11-14 19:07:02,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:07:02,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2022-11-14 19:07:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1667, Invalid=11136, Unknown=167, NotChecked=5390, Total=18360 [2022-11-14 19:07:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:02,106 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:07:02,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 136 states, 135 states have (on average 4.362962962962963) internal successors, (589), 136 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:07:02,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:02,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:02,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:02,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:07:02,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:07:02,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-14 19:07:02,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:07:02,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:07:02,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:07:02,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-11-14 19:07:02,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:07:02,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:07:02,107 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:07:52,957 WARN L233 SmtUtils]: Spent 8.32s on a formula simplification. DAG size of input: 156 DAG size of output: 152 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:08:21,902 WARN L233 SmtUtils]: Spent 8.49s on a formula simplification. DAG size of input: 154 DAG size of output: 150 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:09:45,335 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification. DAG size of input: 151 DAG size of output: 147 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:10:15,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:10:15,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-14 19:10:15,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-14 19:10:15,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-14 19:10:15,753 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:10:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:10:15,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1624944705, now seen corresponding path program 2 times [2022-11-14 19:10:15,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:10:15,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41813216] [2022-11-14 19:10:15,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:10:15,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:10:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:10:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 18 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:10:22,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:10:22,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41813216] [2022-11-14 19:10:22,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41813216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:10:22,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491325416] [2022-11-14 19:10:22,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:10:22,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:10:22,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:10:22,949 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:10:22,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-14 19:10:23,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:10:23,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:10:23,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-14 19:10:23,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:10:23,282 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:10:23,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:10:23,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-14 19:10:23,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:10:23,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:10:24,224 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:10:24,232 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:10:24,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:10:24,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:24,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:10:24,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:10:24,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:24,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:10:24,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:10:25,001 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:10:25,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:10:25,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:25,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:10:25,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:10:25,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:25,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:10:25,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:10:25,887 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:10:25,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:10:25,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:25,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:10:26,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-14 19:10:26,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:26,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:10:26,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:10:26,774 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:10:26,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:10:26,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:10:26,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:10:26,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-14 19:10:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:10:26,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:10:27,635 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (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_828) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:10:27,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20))))) is different from false [2022-11-14 19:10:27,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))) is different from false [2022-11-14 19:10:27,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_822)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1)))))) is different from false [2022-11-14 19:10:27,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| 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_69| (select .cse0 .cse1))) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_822))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse3))))))))) is different from false [2022-11-14 19:10:30,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (store (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 .cse5 .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20))))))) is different from false [2022-11-14 19:10:30,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_818) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))))) is different from false [2022-11-14 19:10:31,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_816)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_818) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20))))))) is different from false [2022-11-14 19:10:31,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| 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_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_816))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_818) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse7 .cse6)))))) is different from false [2022-11-14 19:10:31,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_816))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_818) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) v_ArrVal_825) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse1))))))))) is different from false [2022-11-14 19:10:31,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse3 .cse1))) (not (= (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20))))))))) is different from false [2022-11-14 19:10:32,436 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (not (= 20 (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1)))))))))) is different from false [2022-11-14 19:10:32,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1)))))))))) is different from false [2022-11-14 19:10:32,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_808)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse3 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse8 .cse6 v_ArrVal_818) .cse1 (+ 1 (select .cse8 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1)))))))))) is different from false [2022-11-14 19:10:32,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| 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_75| (select .cse0 .cse1))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_808))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_810) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse10 .cse8 v_ArrVal_818) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse7 .cse8 v_ArrVal_825) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse5 .cse3))) (not (= (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse3) 20)))))))))))) is different from false [2022-11-14 19:10:32,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse3 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_808))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_810) .cse4 (+ (select .cse11 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse10 .cse8 v_ArrVal_818) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse2 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse7 .cse8 v_ArrVal_825) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse3 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse5 .cse1))) (not (= (select (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)))))))))) is different from false [2022-11-14 19:10:34,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| Int) (v_ArrVal_808 Int) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_805 Int) (v_ArrVal_816 Int) (v_ArrVal_825 Int) (v_ArrVal_822 Int) (v_ArrVal_810 Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_807 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_805)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_807))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75|)) v_ArrVal_808))) (store (store .cse11 .cse7 v_ArrVal_810) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse9 .cse7 v_ArrVal_818) .cse1 (+ 1 (select .cse9 .cse1))))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse3 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 .cse7 v_ArrVal_825) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_75| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse3 .cse1))) (not (= 20 (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse4 .cse1)))))))))))) is different from false [2022-11-14 19:10:34,896 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:10:34,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2504 treesize of output 1519 [2022-11-14 19:10:34,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:10:34,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2079 treesize of output 2053 [2022-11-14 19:10:34,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2059 treesize of output 2039 [2022-11-14 19:10:34,965 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 1767 treesize of output 1703 [2022-11-14 19:10:34,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2072 treesize of output 2024 [2022-11-14 19:10:35,004 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 2203 treesize of output 2171 [2022-11-14 19:10:35,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-14 19:10:36,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:10:36,278 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 266 treesize of output 250 [2022-11-14 19:10:37,227 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:10:37,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:10:37,419 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 97 proven. 55 refuted. 13 times theorem prover too weak. 0 trivial. 121 not checked. [2022-11-14 19:10:37,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491325416] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:10:37,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:10:37,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 35, 43] total 122 [2022-11-14 19:10:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584358342] [2022-11-14 19:10:37,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:10:37,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-11-14 19:10:37,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:10:37,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-11-14 19:10:37,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1115, Invalid=9784, Unknown=89, NotChecked=3774, Total=14762 [2022-11-14 19:10:37,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:10:37,425 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:10:37,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 5.467213114754099) internal successors, (667), 122 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2022-11-14 19:10:37,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:11:14,073 WARN L233 SmtUtils]: Spent 10.29s on a formula simplification. DAG size of input: 151 DAG size of output: 147 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:11:48,485 WARN L233 SmtUtils]: Spent 22.76s on a formula simplification. DAG size of input: 165 DAG size of output: 161 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:11:48,494 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (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|))))) (and (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_828 (Array Int Int))) (let ((.cse0 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse0 .cse1)))))) (forall ((v_ArrVal_821 (Array Int Int)) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse5 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse6 .cse7 v_ArrVal_825) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= 20 (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse4 .cse1)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse13 (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_814))) (let ((.cse9 (select .cse13 |c_~#queue~0.base|))) (let ((.cse11 (store (store .cse13 |c_~#queue~0.base| (let ((.cse14 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse14 .cse7 v_ArrVal_818) .cse1 (+ (select .cse14 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse10 (select .cse11 |c_~#queue~0.base|))) (let ((.cse8 (select (store (store .cse11 |c_~#queue~0.base| (let ((.cse12 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse12 .cse7 v_ArrVal_825) .cse1 (+ (select .cse12 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse8 .cse1))) (not (= (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse9 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse10 .cse1)))))))))))) is different from false [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-14 19:11:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-14 19:11:48,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-14 19:11:48,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-14 19:11:48,705 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2022-11-14 19:11:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:11:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash 202398260, now seen corresponding path program 2 times [2022-11-14 19:11:48,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:11:48,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711910102] [2022-11-14 19:11:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:11:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:11:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:11:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:11:52,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:11:52,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711910102] [2022-11-14 19:11:52,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711910102] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:11:52,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564335802] [2022-11-14 19:11:52,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:11:52,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:11:52,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:11:52,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:11:52,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-14 19:11:52,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:11:52,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:11:52,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 106 conjunts are in the unsatisfiable core [2022-11-14 19:11:53,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:11:53,129 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:11:53,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:11:53,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-14 19:11:53,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:11:53,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:11:53,979 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:11:53,988 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:11:53,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:11:54,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:54,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:11:54,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-14 19:11:54,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:54,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:11:54,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:11:54,700 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:11:54,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:11:54,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:54,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:11:55,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-14 19:11:55,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:55,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:11:55,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:11:55,596 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-14 19:11:55,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-14 19:11:55,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:55,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-14 19:11:56,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-14 19:11:56,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:56,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-14 19:11:56,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:11:56,378 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-14 19:11:56,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 27 [2022-11-14 19:11:56,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-14 19:11:56,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-14 19:11:56,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-14 19:11:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:11:56,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:11:57,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_948)))) is different from false [2022-11-14 19:11:57,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (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_946) .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_948))))) is different from false [2022-11-14 19:11:57,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_945)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (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_946) .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse3) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))))))) is different from false [2022-11-14 19:11:57,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_945)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_946) .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_948)))))) is different from false [2022-11-14 19:12:06,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse4 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 (+ 88 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= v_ArrVal_941 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (< (+ (select .cse0 .cse1) 1) v_ArrVal_948) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse3 .cse1))))))))) is different from false [2022-11-14 19:12:10,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int)) (let ((.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int)) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_937))) (let ((.cse6 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_939) .cse4 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse0 .cse1))) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse2 .cse1))) (< (+ (select .cse3 .cse4) 1) v_ArrVal_941) (< (+ (select .cse5 .cse1) 1) v_ArrVal_948)))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse7 .cse4)))))) is different from false [2022-11-14 19:12:10,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_937)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_939) .cse3 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse6 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse6 (+ 88 |c_~#queue~0.offset|) v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse4 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1))) (< (+ 1 (select .cse6 .cse1)) v_ArrVal_948))))))))) is different from false [2022-11-14 19:12:25,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse3 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse3 .cse1))) (< (select (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse5 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse4 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_935))))))))))) is different from false [2022-11-14 19:12:25,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_933) .cse7 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse3 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse0 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse4 .cse1))) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse5 .cse1) 1) v_ArrVal_941) (< (+ (select .cse6 .cse7) 1) v_ArrVal_935))))))))))) is different from false [2022-11-14 19:12:26,274 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse6 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_931)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_933) .cse7 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse8 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse3 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_941) (< (+ (select .cse3 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1))) (< (+ (select .cse6 .cse7) 1) v_ArrVal_935) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647))))))))))) is different from false [2022-11-14 19:12:26,366 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int)) (let ((.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse0 (store .cse11 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_931))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_933) .cse1 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse5 (select .cse10 |c_~#queue~0.base|))) (let ((.cse7 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_939) .cse3 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse2 (select .cse8 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse6 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse4 .cse9 v_ArrVal_946) .cse3 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse5 .cse3))) (< (select (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse3) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse6 .cse3))) (< (+ (select .cse7 .cse3) 1) v_ArrVal_941))))))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse11 .cse1)))))) is different from false [2022-11-14 19:12:26,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_931)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse11 (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_933) .cse4 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse7 (select .cse11 |c_~#queue~0.base|))) (let ((.cse2 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937)) (.cse10 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse9 (store (store .cse11 |c_~#queue~0.base| (store (store .cse2 .cse10 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse5 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse10 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_941) (< (+ (select .cse3 .cse4) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse6 .cse4))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse7 .cse1))) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse8 .cse1) 1) v_ArrVal_948)))))))))))) is different from false [2022-11-14 19:12:39,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_939 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_929 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_929))) (let ((.cse5 (select .cse11 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_931)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse3 .cse9 v_ArrVal_933) .cse1 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse2 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse6 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_941) (< (+ (select .cse3 .cse1) 1) v_ArrVal_935) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse4 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse6 .cse1))) (< (+ (select .cse7 .cse1) 1) v_ArrVal_948))))))))))))) is different from false [2022-11-14 19:12:40,684 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_928 Int) (v_ArrVal_939 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| Int) (v_ArrVal_937 Int) (v_ArrVal_948 Int) (v_ArrVal_935 Int) (v_ArrVal_946 Int) (v_ArrVal_945 Int) (v_ArrVal_933 Int) (v_ArrVal_931 Int) (v_ArrVal_941 Int) (v_ArrVal_950 (Array Int Int)) (v_ArrVal_952 Int) (v_ArrVal_943 (Array Int Int)) (v_ArrVal_936 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| Int) (v_ArrVal_929 (Array Int Int))) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 88 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_928)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_929))) (let ((.cse2 (select .cse11 |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88|) |c_~#queue~0.offset|) v_ArrVal_931)) (.cse9 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse10 (store (store .cse11 |c_~#queue~0.base| (store (store .cse5 .cse9 v_ArrVal_933) .cse1 v_ArrVal_935)) |c_~#stored_elements~0.base| v_ArrVal_936))) (let ((.cse7 (select .cse10 |c_~#queue~0.base|))) (let ((.cse3 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|) |c_~#queue~0.offset|) v_ArrVal_937))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (store (store .cse3 .cse9 v_ArrVal_939) .cse1 v_ArrVal_941)) |c_~#stored_elements~0.base| v_ArrVal_943))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse6 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82|) |c_~#queue~0.offset|) v_ArrVal_945))) (let ((.cse0 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse6 .cse9 v_ArrVal_946) .cse1 v_ArrVal_948)) |c_~#stored_elements~0.base| v_ArrVal_950) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79|)) v_ArrVal_952) .cse1) 2147483647) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_88| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_941) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_79| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_82| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_935) (< (+ (select .cse6 .cse1) 1) v_ArrVal_948) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| (select .cse7 .cse1))))))))))))))) is different from false [2022-11-14 19:12:40,716 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:12:40,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1201 treesize of output 771 [2022-11-14 19:12:40,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:12:40,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1543 treesize of output 1539 [2022-11-14 19:12:40,774 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 496 treesize of output 488 [2022-11-14 19:12:40,795 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 893 treesize of output 829 [2022-11-14 19:12:40,818 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 1010 treesize of output 978 [2022-11-14 19:12:40,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 998 treesize of output 982 [2022-11-14 19:12:40,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-14 19:12:41,272 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-14 19:12:41,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 560 treesize of output 556 [2022-11-14 19:12:42,922 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-14 19:12:42,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 38 [2022-11-14 19:12:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 76 refuted. 34 times theorem prover too weak. 0 trivial. 91 not checked. [2022-11-14 19:12:42,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564335802] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:12:42,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:12:42,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 43] total 110 [2022-11-14 19:12:42,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308623699] [2022-11-14 19:12:42,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:12:42,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-11-14 19:12:42,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:12:42,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-11-14 19:12:42,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1293, Invalid=7874, Unknown=201, NotChecked=2842, Total=12210 [2022-11-14 19:12:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:12:42,988 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:12:42,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 5.627272727272727) internal successors, (619), 111 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-14 19:12:42,989 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:13:27,786 WARN L233 SmtUtils]: Spent 8.76s on a formula simplification. DAG size of input: 132 DAG size of output: 128 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:14:25,418 WARN L233 SmtUtils]: Spent 8.30s on a formula simplification. DAG size of input: 141 DAG size of output: 128 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:15:09,390 WARN L233 SmtUtils]: Spent 16.83s on a formula simplification. DAG size of input: 159 DAG size of output: 113 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:15:49,885 WARN L233 SmtUtils]: Spent 11.25s on a formula simplification. DAG size of input: 200 DAG size of output: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:16:30,225 WARN L233 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 124 DAG size of output: 91 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:17:25,804 WARN L233 SmtUtils]: Spent 32.67s on a formula simplification. DAG size of input: 234 DAG size of output: 188 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:17:25,815 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse12 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse8 (select .cse13 .cse12))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_~#queue~0.offset|) v_ArrVal_816))) (store (store .cse7 .cse6 v_ArrVal_818) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse0 (select .cse4 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse5 .cse6 v_ArrVal_825) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse2 .cse1))))))))) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse10 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_822))) (store (store .cse10 .cse11 v_ArrVal_825) .cse12 (+ (select .cse10 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| .cse8)) (not (= (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse9 .cse1)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| Int) (v_ArrVal_821 (Array Int Int)) (v_ArrVal_818 Int) (v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int) (v_ArrVal_816 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_828 (Array Int Int)) (v_ArrVal_825 Int) (v_ArrVal_822 Int)) (let ((.cse16 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse18 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_816))) (store (store .cse18 .cse11 v_ArrVal_818) .cse12 (+ (select .cse18 .cse12) 1)))) |c_~#stored_elements~0.base| v_ArrVal_821))) (let ((.cse15 (select .cse16 |c_~#queue~0.base|))) (let ((.cse14 (select (store (store .cse16 |c_~#queue~0.base| (let ((.cse17 (store .cse15 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_822))) (store (store .cse17 .cse6 v_ArrVal_825) .cse1 (+ (select .cse17 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_828) |c_~#queue~0.base|))) (or (not (= (select (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_~#queue~0.offset|) v_ArrVal_829) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| (select .cse14 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_72| .cse8)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| (select .cse15 .cse1)))))))) (forall ((v_ArrVal_829 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66| .cse8)) (not (= (select (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_66|) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_829) .cse12) 20))))))) is different from false [2022-11-14 19:17:41,623 WARN L233 SmtUtils]: Spent 14.35s on a formula simplification. DAG size of input: 263 DAG size of output: 150 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-11-14 19:17:57,314 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 19:17:57,318 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 19:17:57,318 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 19:17:58,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-11-14 19:17:58,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-14 19:17:58,527 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-11-14 19:17:58,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-11-14 19:17:58,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-14 19:17:58,559 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-11-14 19:17:58,561 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-14 19:17:58,561 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-14 19:17:58,561 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-14 19:17:58,562 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-14 19:17:58,562 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-14 19:17:58,562 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-14 19:17:58,567 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-14 19:17:58,568 INFO L307 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/3) [2022-11-14 19:17:58,570 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-14 19:17:58,570 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-14 19:17:58,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 07:17:58 BasicIcfg [2022-11-14 19:17:58,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-14 19:17:58,572 INFO L158 Benchmark]: Toolchain (without parser) took 825554.32ms. Allocated memory was 201.3MB in the beginning and 857.7MB in the end (delta: 656.4MB). Free memory was 170.9MB in the beginning and 447.1MB in the end (delta: -276.2MB). Peak memory consumption was 380.7MB. Max. memory is 8.0GB. [2022-11-14 19:17:58,573 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-14 19:17:58,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.75ms. Allocated memory was 201.3MB in the beginning and 297.8MB in the end (delta: 96.5MB). Free memory was 170.9MB in the beginning and 247.0MB in the end (delta: -76.1MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-11-14 19:17:58,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.54ms. Allocated memory is still 297.8MB. Free memory was 247.0MB in the beginning and 243.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-14 19:17:58,573 INFO L158 Benchmark]: Boogie Preprocessor took 31.56ms. Allocated memory is still 297.8MB. Free memory was 243.8MB in the beginning and 241.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-14 19:17:58,573 INFO L158 Benchmark]: RCFGBuilder took 667.52ms. Allocated memory is still 297.8MB. Free memory was 241.7MB in the beginning and 219.2MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-11-14 19:17:58,574 INFO L158 Benchmark]: TraceAbstraction took 824235.66ms. Allocated memory was 297.8MB in the beginning and 857.7MB in the end (delta: 559.9MB). Free memory was 218.7MB in the beginning and 447.1MB in the end (delta: -228.4MB). Peak memory consumption was 333.1MB. Max. memory is 8.0GB. [2022-11-14 19:17:58,575 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.40ms. Allocated memory is still 201.3MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 549.75ms. Allocated memory was 201.3MB in the beginning and 297.8MB in the end (delta: 96.5MB). Free memory was 170.9MB in the beginning and 247.0MB in the end (delta: -76.1MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 64.54ms. Allocated memory is still 297.8MB. Free memory was 247.0MB in the beginning and 243.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.56ms. Allocated memory is still 297.8MB. Free memory was 243.8MB in the beginning and 241.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 667.52ms. Allocated memory is still 297.8MB. Free memory was 241.7MB in the beginning and 219.2MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 824235.66ms. Allocated memory was 297.8MB in the beginning and 857.7MB in the end (delta: 559.9MB). Free memory was 218.7MB in the beginning and 447.1MB in the end (delta: -228.4MB). Peak memory consumption was 333.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7831, independent: 7585, independent conditional: 1571, independent unconditional: 6014, dependent: 246, dependent conditional: 226, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 1571, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 1571, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 0, independent unconditional: 7585, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 0, independent unconditional: 7585, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 0, independent unconditional: 7585, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5936, independent: 5916, independent conditional: 0, independent unconditional: 5916, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5936, independent: 5914, independent conditional: 0, independent unconditional: 5914, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7605, independent: 1669, independent conditional: 0, independent unconditional: 1669, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5936, unknown conditional: 0, unknown unconditional: 5936] , Statistics on independence cache: Total cache size (in pairs): 5936, Positive cache size: 5916, Positive conditional cache size: 0, Positive unconditional cache size: 5916, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 226 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 116, Number of trivial persistent sets: 77, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6034, independent: 6014, independent conditional: 0, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7831, independent: 7585, independent conditional: 1571, independent unconditional: 6014, dependent: 246, dependent conditional: 226, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 1571, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 1571, independent unconditional: 6014, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 0, independent unconditional: 7585, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 0, independent unconditional: 7585, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7605, independent: 7585, independent conditional: 0, independent unconditional: 7585, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5936, independent: 5916, independent conditional: 0, independent unconditional: 5916, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5936, independent: 5914, independent conditional: 0, independent unconditional: 5914, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 22, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 112, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 7605, independent: 1669, independent conditional: 0, independent unconditional: 1669, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5936, unknown conditional: 0, unknown unconditional: 5936] , Statistics on independence cache: Total cache size (in pairs): 5936, Positive cache size: 5916, Positive conditional cache size: 0, Positive unconditional cache size: 5916, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 226 - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 392 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 824.0s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 644.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: 447, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 176.0s InterpolantComputationTime, 3652 NumberOfCodeBlocks, 3652 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 4984 ConstructedInterpolants, 877 QuantifiedInterpolants, 319687 SizeOfPredicates, 263 NumberOfNonLiveVariables, 3386 ConjunctsInSsa, 641 ConjunctsInUnsatCore, 32 InterpolantComputations, 7 PerfectInterpolantSequences, 381/2535 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown