/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-VarAbsGlobalSyntactic.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/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-9868fc6-m [2022-11-15 14:19:16,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-15 14:19:16,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-15 14:19:16,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-15 14:19:16,908 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-15 14:19:16,909 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-15 14:19:16,910 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-15 14:19:16,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-15 14:19:16,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-15 14:19:16,913 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-15 14:19:16,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-15 14:19:16,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-15 14:19:16,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-15 14:19:16,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-15 14:19:16,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-15 14:19:16,916 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-15 14:19:16,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-15 14:19:16,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-15 14:19:16,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-15 14:19:16,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-15 14:19:16,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-15 14:19:16,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-15 14:19:16,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-15 14:19:16,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-15 14:19:16,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-15 14:19:16,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-15 14:19:16,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-15 14:19:16,924 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-15 14:19:16,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-15 14:19:16,925 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-15 14:19:16,925 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-15 14:19:16,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-15 14:19:16,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-15 14:19:16,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-15 14:19:16,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-15 14:19:16,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-15 14:19:16,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-15 14:19:16,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-15 14:19:16,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-15 14:19:16,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-15 14:19:16,929 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-15 14:19:16,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-15 14:19:16,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-15 14:19:16,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-15 14:19:16,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-15 14:19:16,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-15 14:19:16,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-15 14:19:16,960 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-15 14:19:16,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-15 14:19:16,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-15 14:19:16,961 INFO L138 SettingsManager]: * Use SBE=true [2022-11-15 14:19:16,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-15 14:19:16,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-15 14:19:16,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-15 14:19:16,963 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-15 14:19:16,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-15 14:19:16,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-15 14:19:16,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 14:19:16,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-15 14:19:16,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-15 14:19:16,967 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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-15 14:19:17,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-15 14:19:17,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-15 14:19:17,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-15 14:19:17,173 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-15 14:19:17,174 INFO L275 PluginConnector]: CDTParser initialized [2022-11-15 14:19:17,175 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2022-11-15 14:19:17,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d38ad68/d88c66b7988a4934924cf260c5037c82/FLAGbc0573958 [2022-11-15 14:19:17,633 INFO L306 CDTParser]: Found 1 translation units. [2022-11-15 14:19:17,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2022-11-15 14:19:17,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d38ad68/d88c66b7988a4934924cf260c5037c82/FLAGbc0573958 [2022-11-15 14:19:17,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d38ad68/d88c66b7988a4934924cf260c5037c82 [2022-11-15 14:19:17,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-15 14:19:17,663 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-15 14:19:17,666 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-15 14:19:17,666 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-15 14:19:17,668 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-15 14:19:17,669 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 02:19:17" (1/1) ... [2022-11-15 14:19:17,670 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319f46cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:17, skipping insertion in model container [2022-11-15 14:19:17,670 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 02:19:17" (1/1) ... [2022-11-15 14:19:17,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-15 14:19:17,716 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-15 14:19:17,976 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2022-11-15 14:19:18,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 14:19:18,017 INFO L203 MainTranslator]: Completed pre-run [2022-11-15 14:19:18,040 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2022-11-15 14:19:18,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 14:19:18,085 INFO L208 MainTranslator]: Completed translation [2022-11-15 14:19:18,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18 WrapperNode [2022-11-15 14:19:18,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-15 14:19:18,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-15 14:19:18,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-15 14:19:18,087 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-15 14:19:18,091 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,141 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 269 [2022-11-15 14:19:18,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-15 14:19:18,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-15 14:19:18,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-15 14:19:18,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-15 14:19:18,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,171 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,172 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,177 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-15 14:19:18,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-15 14:19:18,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-15 14:19:18,178 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-15 14:19:18,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (1/1) ... [2022-11-15 14:19:18,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 14:19:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:18,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-15 14:19:18,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-15 14:19:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-15 14:19:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-15 14:19:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-15 14:19:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-15 14:19:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-15 14:19:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-15 14:19:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-15 14:19:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-15 14:19:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-15 14:19:18,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-15 14:19:18,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-15 14:19:18,229 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-15 14:19:18,365 INFO L235 CfgBuilder]: Building ICFG [2022-11-15 14:19:18,366 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-15 14:19:18,674 INFO L276 CfgBuilder]: Performing block encoding [2022-11-15 14:19:18,683 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-15 14:19:18,683 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2022-11-15 14:19:18,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 02:19:18 BoogieIcfgContainer [2022-11-15 14:19:18,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-15 14:19:18,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-15 14:19:18,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-15 14:19:18,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-15 14:19:18,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 02:19:17" (1/3) ... [2022-11-15 14:19:18,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301b7304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 02:19:18, skipping insertion in model container [2022-11-15 14:19:18,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 02:19:18" (2/3) ... [2022-11-15 14:19:18,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301b7304 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 02:19:18, skipping insertion in model container [2022-11-15 14:19:18,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 02:19:18" (3/3) ... [2022-11-15 14:19:18,694 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2022-11-15 14:19:18,699 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-15 14:19:18,706 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-15 14:19:18,706 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-15 14:19:18,706 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-15 14:19:18,805 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-15 14:19:18,850 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-15 14:19:18,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 14:19:18,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:18,853 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-15 14:19:18,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-15 14:19:18,881 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 14:19:18,891 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-11-15 14:19:18,901 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;@1e699df4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 14:19:18,901 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-15 14:19:19,203 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1999583012, now seen corresponding path program 1 times [2022-11-15 14:19:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:19,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129603143] [2022-11-15 14:19:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:19,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129603143] [2022-11-15 14:19:19,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129603143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:19,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 14:19:19,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 14:19:19,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683936966] [2022-11-15 14:19:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:19,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 14:19:19,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 14:19:19,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 14:19:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:19,406 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:19,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:19,407 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:19,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:19,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-15 14:19:19,450 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:19,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2040647739, now seen corresponding path program 1 times [2022-11-15 14:19:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:19,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854284279] [2022-11-15 14:19:19,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:19,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:19,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:19,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854284279] [2022-11-15 14:19:19,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854284279] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:19,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 14:19:19,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 14:19:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068763309] [2022-11-15 14:19:19,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:19,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-15 14:19:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:19,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-15 14:19:19,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-15 14:19:19,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:19,605 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:19,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:19,606 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:19,607 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:19,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:19,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-15 14:19:19,648 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:19,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:19,649 INFO L85 PathProgramCache]: Analyzing trace with hash -980841847, now seen corresponding path program 1 times [2022-11-15 14:19:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:19,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517174298] [2022-11-15 14:19:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:19,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:19,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:19,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517174298] [2022-11-15 14:19:19,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517174298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:19,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232584821] [2022-11-15 14:19:19,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:19,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:19,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:19,760 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-15 14:19:19,761 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-15 14:19:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:19,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-15 14:19:19,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:19,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:19,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 14:19:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:19,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232584821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 14:19:19,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 14:19:19,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-15 14:19:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478723149] [2022-11-15 14:19:19,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 14:19:19,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-15 14:19:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:19,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-15 14:19:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-15 14:19:19,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:19,974 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:19,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:19,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:20,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:20,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:20,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-15 14:19:20,261 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,SelfDestructingSolverStorable2 [2022-11-15 14:19:20,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1867721143, now seen corresponding path program 2 times [2022-11-15 14:19:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:20,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605896755] [2022-11-15 14:19:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:20,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:20,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605896755] [2022-11-15 14:19:20,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605896755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:20,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706376246] [2022-11-15 14:19:20,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 14:19:20,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:20,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:20,449 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:19:20,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-15 14:19:20,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-15 14:19:20,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 14:19:20,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-15 14:19:20,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:20,604 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 7 treesize of output 6 [2022-11-15 14:19:20,782 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 14:19:20,782 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-15 14:19:20,824 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 13 treesize of output 15 [2022-11-15 14:19:20,904 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 14 treesize of output 10 [2022-11-15 14:19:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-15 14:19:20,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-15 14:19:20,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706376246] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:20,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-15 14:19:20,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 18 [2022-11-15 14:19:20,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197429236] [2022-11-15 14:19:20,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:20,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-15 14:19:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:20,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-15 14:19:20,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-15 14:19:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:20,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:20,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:20,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:20,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:20,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:20,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:21,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:21,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:21,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:21,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-15 14:19:21,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:21,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2064779729, now seen corresponding path program 1 times [2022-11-15 14:19:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:21,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411157228] [2022-11-15 14:19:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:21,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:21,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:21,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411157228] [2022-11-15 14:19:21,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411157228] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:21,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121740871] [2022-11-15 14:19:21,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:21,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:21,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:21,486 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:19:21,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-15 14:19:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:21,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-15 14:19:21,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:21,601 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:21,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 14:19:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:21,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121740871] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 14:19:21,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 14:19:21,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-15 14:19:21,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313274936] [2022-11-15 14:19:21,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 14:19:21,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-15 14:19:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:21,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-15 14:19:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-15 14:19:21,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:21,684 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:21,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:21,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:21,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:21,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:21,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:21,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:21,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-15 14:19:22,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:22,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:22,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:22,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1012334255, now seen corresponding path program 2 times [2022-11-15 14:19:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:22,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843152427] [2022-11-15 14:19:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:22,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:22,309 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:22,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:22,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843152427] [2022-11-15 14:19:22,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843152427] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:22,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385786333] [2022-11-15 14:19:22,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 14:19:22,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:22,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:22,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:19:22,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-15 14:19:22,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-15 14:19:22,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 14:19:22,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-15 14:19:22,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:22,419 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 7 treesize of output 6 [2022-11-15 14:19:22,699 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 14:19:22,700 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-15 14:19:22,740 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 13 treesize of output 15 [2022-11-15 14:19:22,825 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 14 treesize of output 10 [2022-11-15 14:19:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-15 14:19:22,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-15 14:19:22,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385786333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:22,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-15 14:19:22,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 26 [2022-11-15 14:19:22,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967893220] [2022-11-15 14:19:22,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:22,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-15 14:19:22,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:22,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-15 14:19:22,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-15 14:19:22,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:22,862 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:22,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:22,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:22,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:22,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:22,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:22,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:22,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:23,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:23,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:23,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-15 14:19:23,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:23,219 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:23,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:23,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1487027237, now seen corresponding path program 1 times [2022-11-15 14:19:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:23,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671866084] [2022-11-15 14:19:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:23,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:23,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:23,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671866084] [2022-11-15 14:19:23,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671866084] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:23,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748794180] [2022-11-15 14:19:23,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:23,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:23,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:23,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:19:23,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-15 14:19:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:23,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-15 14:19:23,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:23,668 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:23,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 14:19:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-15 14:19:23,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748794180] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 14:19:23,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 14:19:23,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-15 14:19:23,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209390990] [2022-11-15 14:19:23,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 14:19:23,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-15 14:19:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:23,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-15 14:19:23,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-15 14:19:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:23,847 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:23,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:23,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:23,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:23,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:23,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:23,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:23,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:23,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:24,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-15 14:19:24,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:24,329 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:24,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:24,329 INFO L85 PathProgramCache]: Analyzing trace with hash 404394217, now seen corresponding path program 2 times [2022-11-15 14:19:24,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:24,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119849876] [2022-11-15 14:19:24,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:24,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:24,504 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:19:24,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:24,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119849876] [2022-11-15 14:19:24,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119849876] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:24,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 14:19:24,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-15 14:19:24,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089865984] [2022-11-15 14:19:24,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:24,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-15 14:19:24,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:24,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-15 14:19:24,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-15 14:19:24,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:24,507 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:24,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:24,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 14:19:24,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-15 14:19:24,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:24,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash -348680299, now seen corresponding path program 1 times [2022-11-15 14:19:24,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:24,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768811812] [2022-11-15 14:19:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:19:24,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:24,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768811812] [2022-11-15 14:19:24,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768811812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:24,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 14:19:24,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-15 14:19:24,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810249593] [2022-11-15 14:19:24,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:24,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-15 14:19:24,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:24,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-15 14:19:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-15 14:19:24,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:24,949 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:24,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 14:19:24,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:25,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:25,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-15 14:19:25,187 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:25,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1554218159, now seen corresponding path program 1 times [2022-11-15 14:19:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:25,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448122320] [2022-11-15 14:19:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:19:25,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:25,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448122320] [2022-11-15 14:19:25,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448122320] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:25,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 14:19:25,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 14:19:25,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884398303] [2022-11-15 14:19:25,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:25,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-15 14:19:25,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:25,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-15 14:19:25,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-15 14:19:25,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:25,277 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:25,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:25,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:25,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:25,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:25,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:25,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-15 14:19:25,336 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:25,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:25,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1584131277, now seen corresponding path program 1 times [2022-11-15 14:19:25,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:25,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161474723] [2022-11-15 14:19:25,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:25,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:19:26,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:26,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161474723] [2022-11-15 14:19:26,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161474723] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:26,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252164752] [2022-11-15 14:19:26,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:26,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:26,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:26,828 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:19:26,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-15 14:19:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:26,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-15 14:19:26,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:26,977 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 7 treesize of output 6 [2022-11-15 14:19:27,271 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 14:19:27,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 11 treesize of output 11 [2022-11-15 14:19:27,314 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 13 treesize of output 15 [2022-11-15 14:19:27,536 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 0 case distinctions, treesize of input 24 treesize of output 17 [2022-11-15 14:19:27,680 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 32 treesize of output 25 [2022-11-15 14:19:27,817 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 14 treesize of output 10 [2022-11-15 14:19:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-11-15 14:19:27,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 14:19:28,924 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 9 treesize of output 7 [2022-11-15 14:19:28,962 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-15 14:19:28,963 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 13 treesize of output 12 [2022-11-15 14:19:28,966 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-11-15 14:19:28,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252164752] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 14:19:28,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 14:19:28,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 46 [2022-11-15 14:19:28,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105916258] [2022-11-15 14:19:28,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 14:19:28,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-15 14:19:28,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:28,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-15 14:19:28,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1943, Unknown=5, NotChecked=0, Total=2162 [2022-11-15 14:19:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:28,969 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:28,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 6.065217391304348) internal successors, (279), 47 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:28,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:28,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:28,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:28,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:28,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:28,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:28,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:28,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:28,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:28,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:28,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:30,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:30,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 14:19:30,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-15 14:19:31,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:31,022 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:31,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:31,023 INFO L85 PathProgramCache]: Analyzing trace with hash 253955737, now seen corresponding path program 1 times [2022-11-15 14:19:31,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:31,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426737000] [2022-11-15 14:19:31,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:31,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-15 14:19:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:31,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426737000] [2022-11-15 14:19:31,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426737000] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:31,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 14:19:31,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-15 14:19:31,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120690123] [2022-11-15 14:19:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:31,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-15 14:19:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-15 14:19:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-15 14:19:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:31,098 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:31,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 41.0) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:31,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:31,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:31,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:31,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 14:19:31,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:31,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:31,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 14:19:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:31,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-15 14:19:31,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:31,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:31,133 INFO L85 PathProgramCache]: Analyzing trace with hash -717305905, now seen corresponding path program 1 times [2022-11-15 14:19:31,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:31,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807712787] [2022-11-15 14:19:31,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:31,238 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:19:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:31,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807712787] [2022-11-15 14:19:31,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807712787] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:31,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109558788] [2022-11-15 14:19:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:31,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:31,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:31,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:19:31,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-15 14:19:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:31,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-15 14:19:31,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:19:31,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-15 14:19:31,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109558788] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:31,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-15 14:19:31,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-15 14:19:31,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143110890] [2022-11-15 14:19:31,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:31,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-15 14:19:31,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:31,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-15 14:19:31,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-15 14:19:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:31,454 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:31,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:31,455 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:31,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:31,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-15 14:19:31,910 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-15 14:19:31,910 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1316553484, now seen corresponding path program 1 times [2022-11-15 14:19:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:31,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315680565] [2022-11-15 14:19:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:31,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-11-15 14:19:32,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:32,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315680565] [2022-11-15 14:19:32,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315680565] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:32,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922516529] [2022-11-15 14:19:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:32,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:32,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:32,029 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:19:32,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-15 14:19:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:32,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-15 14:19:32,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2022-11-15 14:19:32,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-15 14:19:32,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922516529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 14:19:32,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-15 14:19:32,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-15 14:19:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356560995] [2022-11-15 14:19:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 14:19:32,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-15 14:19:32,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-15 14:19:32,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-15 14:19:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:32,172 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:32,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:32,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:32,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:32,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:32,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-15 14:19:32,479 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-15 14:19:32,479 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:32,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1646461943, now seen corresponding path program 1 times [2022-11-15 14:19:32,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:32,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349660857] [2022-11-15 14:19:32,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:32,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-11-15 14:19:32,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:32,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349660857] [2022-11-15 14:19:32,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349660857] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:32,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722984724] [2022-11-15 14:19:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:32,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:32,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:32,602 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:19:32,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-15 14:19:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:32,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-15 14:19:32,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-11-15 14:19:32,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 14:19:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2022-11-15 14:19:32,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722984724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 14:19:32,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 14:19:32,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-15 14:19:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734237350] [2022-11-15 14:19:32,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 14:19:32,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-15 14:19:32,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:19:32,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-15 14:19:32,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-15 14:19:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:32,961 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:19:32,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:32,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:32,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:32,962 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:19:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:19:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:19:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:19:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:19:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:19:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:19:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:19:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:19:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-15 14:19:33,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-15 14:19:33,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-15 14:19:33,233 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:19:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:19:33,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2090006455, now seen corresponding path program 1 times [2022-11-15 14:19:33,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:19:33,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668287007] [2022-11-15 14:19:33,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:33,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:19:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:19:43,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:19:43,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668287007] [2022-11-15 14:19:43,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668287007] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:19:43,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128873821] [2022-11-15 14:19:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:19:43,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:19:43,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:19:43,041 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:19:43,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-15 14:19:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:19:43,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-15 14:19:43,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:19:43,238 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 7 treesize of output 6 [2022-11-15 14:19:43,592 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-15 14:19:43,592 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-15 14:19:43,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-15 14:19:43,888 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 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-15 14:19:44,003 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 21 treesize of output 16 [2022-11-15 14:19:49,448 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 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-15 14:19:52,267 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 19 treesize of output 21 [2022-11-15 14:19:54,669 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 24 treesize of output 19 [2022-11-15 14:20:34,495 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 20 treesize of output 16 [2022-11-15 14:20:34,630 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:20:34,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 14:20:35,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_990))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-11-15 14:20:35,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_988 Int)) (or (< (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_988)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_990))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-11-15 14:20:35,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_988 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_988)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_990))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647))) is different from false [2022-11-15 14:20:35,398 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_988 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_988)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_990) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2022-11-15 14:20:35,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_36| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_36|)) (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_988 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_36| 28))) (or (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_988)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_990) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))))) is different from false [2022-11-15 14:20:35,476 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_988 Int) (|v_t_funThread1of1ForFork0_~i~0#1_36| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_36| 28))) (or (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_988)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_990) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< |v_t_funThread1of1ForFork0_~i~0#1_36| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2022-11-15 14:20:35,601 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_988 Int) (v_ArrVal_986 Int) (|v_t_funThread1of1ForFork0_~i~0#1_36| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_36| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_36| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_986)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_988))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_990) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)))) is different from false [2022-11-15 14:20:35,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_988 Int) (v_ArrVal_986 Int) (|v_t_funThread1of1ForFork0_~i~0#1_36| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_36| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_36| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|) (< (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_986)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_988))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_990) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|))))) is different from false [2022-11-15 14:20:35,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_988 Int) (v_ArrVal_986 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_986) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_988)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_990) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2022-11-15 14:20:36,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_989 (Array Int Int)) (v_ArrVal_990 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_982 (Array Int Int)) (v_ArrVal_988 Int) (v_ArrVal_986 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_982))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_986) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_988))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_989) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| v_ArrVal_990) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| 28)))) is different from false [2022-11-15 14:20:37,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 14:20:37,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 14:20:37,280 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 27 treesize of output 25 [2022-11-15 14:20:37,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 14:20:37,284 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 55 treesize of output 51 [2022-11-15 14:20:37,342 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-15 14:20:37,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-15 14:20:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 78 not checked. [2022-11-15 14:20:37,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128873821] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 14:20:37,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 14:20:37,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 67 [2022-11-15 14:20:37,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70993867] [2022-11-15 14:20:37,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 14:20:37,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-15 14:20:37,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:20:37,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-15 14:20:37,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=2974, Unknown=39, NotChecked=1210, Total=4556 [2022-11-15 14:20:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:20:37,350 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:20:37,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 6.597014925373134) internal successors, (442), 68 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:20:37,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-15 14:20:37,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:23:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:23:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:23:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:23:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:23:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-15 14:23:19,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-15 14:23:19,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-15 14:23:19,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-15 14:23:19,976 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-15 14:23:19,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 14:23:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash -420204077, now seen corresponding path program 2 times [2022-11-15 14:23:19,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 14:23:19,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012855154] [2022-11-15 14:23:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 14:23:19,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 14:23:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 14:24:38,227 WARN L233 SmtUtils]: Spent 6.70s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 14:24:55,906 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 14:25:16,454 WARN L233 SmtUtils]: Spent 6.57s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 14:25:31,082 WARN L233 SmtUtils]: Spent 5.22s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 14:25:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:25:35,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 14:25:35,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012855154] [2022-11-15 14:25:35,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012855154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 14:25:35,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023494176] [2022-11-15 14:25:35,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 14:25:35,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 14:25:35,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 14:25:35,488 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-15 14:25:35,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-15 14:25:35,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 14:25:35,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 14:25:35,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-15 14:25:35,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 14:25:36,256 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 7 treesize of output 6 [2022-11-15 14:25:37,251 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-15 14:25:37,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-15 14:25:37,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-11-15 14:25:37,994 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 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-15 14:25:38,294 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 21 treesize of output 16 [2022-11-15 14:25:46,139 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 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-15 14:25:49,298 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 24 treesize of output 19 [2022-11-15 14:26:29,050 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 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-15 14:26:37,521 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 27 treesize of output 22 [2022-11-15 14:27:31,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-15 14:27:33,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-11-15 14:27:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-15 14:27:34,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 14:27:36,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2022-11-15 14:27:36,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int)) (or (forall ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse0)) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|)))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_41|)))) is different from false [2022-11-15 14:27:36,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse0)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|)))) is different from false [2022-11-15 14:27:36,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse0)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|)))) is different from false [2022-11-15 14:27:37,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse0)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647)))) is different from false [2022-11-15 14:27:37,049 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse0)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647)))) is different from false [2022-11-15 14:27:37,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse1 (+ |c_~#cache~0.offset| .cse0))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse0)) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 2)))))) is different from false [2022-11-15 14:27:37,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse1 (+ |c_~#cache~0.offset| .cse0))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse0)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)))))) is different from false [2022-11-15 14:27:37,278 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse2 (+ |c_~#cache~0.offset| .cse0))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse0)) (< (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)))))) is different from false [2022-11-15 14:27:37,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse2 (+ |c_~#cache~0.offset| .cse0))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse0)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1155)))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)))))) is different from false [2022-11-15 14:27:37,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28)) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647))) is different from false [2022-11-15 14:27:37,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1151 (Array Int Int))) (or (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1151))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28)))) is different from false [2022-11-15 14:27:39,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 14:27:39,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 14:27:39,776 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 14:27:39,782 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 24 treesize of output 22 [2022-11-15 14:27:39,802 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 58 treesize of output 54 [2022-11-15 14:27:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 325 trivial. 165 not checked. [2022-11-15 14:27:40,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023494176] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 14:27:40,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 14:27:40,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 27] total 88 [2022-11-15 14:27:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028899129] [2022-11-15 14:27:40,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 14:27:40,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-11-15 14:27:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 14:27:40,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-11-15 14:27:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=5425, Unknown=97, NotChecked=1932, Total=7832 [2022-11-15 14:27:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:27:40,094 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 14:27:40,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 88 states have (on average 6.5227272727272725) internal successors, (574), 89 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-15 14:27:40,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:27:40,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-11-15 14:27:40,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-15 14:27:40,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-15 14:27:40,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-15 14:27:40,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-15 14:27:40,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-15 14:27:40,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 14:30:33,310 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse53 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse34 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse85 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse53 0)) (.cse35 ((as const (Array Int Int)) 0))) (let ((.cse75 (@diff .cse85 .cse35)) (.cse15 (@diff .cse34 .cse35))) (let ((.cse97 (store .cse34 .cse15 0)) (.cse87 (store .cse85 .cse75 0))) (let ((.cse38 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse74 (@diff .cse87 .cse35)) (.cse6 (@diff .cse97 .cse35))) (let ((.cse98 (store .cse97 .cse6 0)) (.cse88 (store .cse87 .cse74 0)) (.cse101 (@diff .cse38 .cse35))) (let ((.cse100 (store .cse38 .cse101 0)) (.cse72 (@diff .cse88 .cse35)) (.cse7 (@diff .cse98 .cse35))) (let ((.cse96 (store .cse98 .cse7 0)) (.cse90 (store .cse88 .cse72 0)) (.cse99 (@diff .cse100 .cse35))) (let ((.cse81 (store .cse38 .cse53 0)) (.cse84 (store .cse100 .cse99 0)) (.cse70 (@diff .cse90 .cse35)) (.cse12 (@diff .cse96 .cse35))) (let ((.cse94 (store .cse96 .cse12 0)) (.cse89 (store .cse90 .cse70 0)) (.cse93 (@diff .cse84 .cse35)) (.cse80 (@diff .cse81 .cse35))) (let ((.cse83 (store .cse81 .cse80 0)) (.cse92 (store .cse84 .cse93 0)) (.cse71 (@diff .cse89 .cse35)) (.cse2 (@diff .cse94 .cse35))) (let ((.cse95 (store .cse94 .cse2 0)) (.cse86 (store .cse89 .cse71 0)) (.cse91 (@diff .cse92 .cse35)) (.cse82 (@diff .cse83 .cse35))) (let ((.cse79 (store .cse83 .cse82 0)) (.cse16 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse59 (= .cse35 .cse38)) (.cse58 (+ .cse101 28)) (.cse63 (= .cse35 .cse100)) (.cse62 (+ .cse99 28)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse67 (store .cse92 .cse91 0)) (.cse73 (@diff .cse86 .cse35)) (.cse14 (= .cse35 .cse34)) (.cse8 (= .cse35 .cse98)) (.cse5 (= .cse35 .cse97)) (.cse40 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse13 (= .cse35 .cse96)) (.cse11 (@diff .cse95 .cse35))) (let ((.cse10 (= .cse35 .cse95)) (.cse9 (= .cse35 (store .cse95 .cse11 0))) (.cse41 (or (<= .cse12 .cse40) .cse13)) (.cse4 (= .cse35 .cse94)) (.cse42 (or .cse5 (<= .cse6 .cse40))) (.cse43 (or (<= .cse7 .cse40) .cse8)) (.cse44 (or (<= .cse15 .cse40) .cse14)) (.cse32 (+ 28 .cse73)) (.cse26 (+ 28 .cse71)) (.cse22 (+ .cse72 28)) (.cse31 (+ .cse74 28)) (.cse28 (+ .cse70 28)) (.cse23 (+ .cse75 28)) (.cse54 (= .cse35 .cse67)) (.cse65 (+ .cse93 28)) (.cse56 (= .cse92 .cse35)) (.cse57 (+ .cse91 28)) (.cse27 (= .cse35 .cse90)) (.cse25 (= .cse35 .cse89)) (.cse21 (= .cse35 .cse88)) (.cse33 (= .cse35 .cse86)) (.cse30 (= .cse35 .cse87)) (.cse29 (= .cse35 (store .cse86 .cse73 0))) (.cse24 (= .cse85 .cse35)) (.cse17 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse66 (= .cse84 .cse35)) (.cse68 (or .cse63 (<= .cse62 .cse3))) (.cse69 (or .cse59 (<= .cse58 .cse3))) (.cse0 (not .cse16)) (.cse20 (= .cse35 .cse79)) (.cse18 (or (<= (+ .cse82 28) .cse3) (= .cse83 .cse35))) (.cse19 (or (<= (+ .cse80 28) .cse3) (= .cse35 .cse81))) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse64 (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (or .cse0 .cse1) (or (and (or (<= (+ .cse2 28) .cse3) .cse4) (or .cse5 (<= (+ .cse6 28) .cse3)) (or (<= (+ .cse7 28) .cse3) .cse8) .cse9 (or .cse10 (<= (+ .cse11 28) .cse3)) (or (<= (+ .cse12 28) .cse3) .cse13) (or .cse14 (<= (+ 28 .cse15) .cse3))) .cse16) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) .cse17 (or (and .cse17 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse18 .cse19 .cse1 .cse20) .cse0) (or (and (or .cse21 (<= .cse22 .cse3)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= .cse23 .cse3) .cse24) (or .cse25 (<= .cse26 .cse3)) (or .cse27 (<= .cse28 .cse3)) .cse1 .cse29 (or .cse30 (<= .cse31 .cse3)) (or (<= .cse32 .cse3) .cse33)) .cse0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse3) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse3) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse3) (= .cse34 (store (store .cse35 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)))) (or (and .cse17 .cse14) .cse16) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse36 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse39 (+ |c_~#cache~0.offset| .cse36))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse36)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (select (select (store (let ((.cse37 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse38 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1155)))) (store .cse37 |c_~#cache~0.base| (store (store (select .cse37 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< .cse39 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< .cse39 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)))))) .cse14 (or (and (or .cse10 (<= .cse11 .cse40)) (or .cse4 (<= .cse2 .cse40)) .cse41 .cse9 .cse42 .cse43 .cse44) .cse16) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (or .cse0 (let ((.cse46 (store .cse34 .cse53 0))) (let ((.cse45 (@diff .cse46 .cse35))) (let ((.cse49 (store .cse46 .cse45 0))) (let ((.cse50 (@diff .cse49 .cse35))) (let ((.cse47 (store .cse49 .cse50 0))) (let ((.cse48 (@diff .cse47 .cse35))) (let ((.cse51 (store .cse47 .cse48 0))) (let ((.cse52 (@diff .cse51 .cse35))) (and (or (<= .cse45 .cse40) (= .cse35 .cse46)) (or (= .cse35 .cse47) (<= .cse48 .cse40)) (or (= .cse35 .cse49) (<= .cse50 .cse40)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse35 (store .cse51 .cse52 0)) (or (<= .cse52 .cse40) (= .cse35 .cse51)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (and .cse17 .cse24 .cse1)) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1155 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse3) (= .cse34 (store .cse35 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse35 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)))) (or (and .cse41 .cse4 .cse42 .cse43 .cse44) .cse16) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse55 (@diff .cse67 .cse35))) (let ((.cse61 (store .cse67 .cse55 0))) (let ((.cse60 (@diff .cse61 .cse35))) (and (or .cse54 (<= (+ .cse55 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse56 (<= .cse57 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse58 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse59) (or (<= (+ .cse60 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= .cse35 .cse61)) (or (<= .cse62 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse63) (= .cse35 (store .cse61 .cse60 0)) (not .cse64) (or (<= .cse65 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse66))))) (and (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (or (<= .cse32 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse33) (or .cse25 (<= .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse21 (<= .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse30 (<= .cse31 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse27 (<= .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse24) .cse1 .cse29 .cse64)) (or (and .cse17 .cse54 .cse68 .cse69 (or (<= .cse65 .cse3) .cse66) (or .cse56 (<= .cse57 .cse3))) .cse16) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse3) (= .cse34 (store (store (store .cse35 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse3) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse3))) (or .cse0 (and (or .cse27 (<= .cse70 .cse40)) (or (<= .cse71 .cse40) .cse25) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse21 (<= .cse72 .cse40)) (or .cse33 (<= .cse73 .cse40)) (or (<= .cse74 .cse40) .cse30) .cse1 .cse29 (or (<= .cse75 .cse40) .cse24))) (= |c_~#cache~0.base| 3) (or (and .cse17 .cse66 .cse68 .cse69) .cse16) (or .cse0 (let ((.cse76 (@diff .cse79 .cse35))) (let ((.cse78 (store .cse79 .cse76 0))) (let ((.cse77 (@diff .cse78 .cse35))) (and (or .cse20 (<= (+ .cse76 28) .cse3)) .cse18 .cse19 (or (<= (+ .cse77 28) .cse3) (= .cse35 .cse78)) (= .cse35 (store .cse78 .cse77 0)) .cse1 .cse64 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))))))))))))))))))) is different from true [2022-11-15 14:30:48,959 WARN L233 SmtUtils]: Spent 8.88s on a formula simplification. DAG size of input: 233 DAG size of output: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 14:30:51,047 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse49 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse34 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse81 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse49 0)) (.cse35 ((as const (Array Int Int)) 0))) (let ((.cse71 (@diff .cse81 .cse35)) (.cse15 (@diff .cse34 .cse35))) (let ((.cse93 (store .cse34 .cse15 0)) (.cse83 (store .cse81 .cse71 0))) (let ((.cse98 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse70 (@diff .cse83 .cse35)) (.cse6 (@diff .cse93 .cse35))) (let ((.cse94 (store .cse93 .cse6 0)) (.cse84 (store .cse83 .cse70 0)) (.cse97 (@diff .cse98 .cse35))) (let ((.cse96 (store .cse98 .cse97 0)) (.cse68 (@diff .cse84 .cse35)) (.cse7 (@diff .cse94 .cse35))) (let ((.cse92 (store .cse94 .cse7 0)) (.cse86 (store .cse84 .cse68 0)) (.cse95 (@diff .cse96 .cse35))) (let ((.cse77 (store .cse98 .cse49 0)) (.cse80 (store .cse96 .cse95 0)) (.cse66 (@diff .cse86 .cse35)) (.cse12 (@diff .cse92 .cse35))) (let ((.cse90 (store .cse92 .cse12 0)) (.cse85 (store .cse86 .cse66 0)) (.cse89 (@diff .cse80 .cse35)) (.cse76 (@diff .cse77 .cse35))) (let ((.cse79 (store .cse77 .cse76 0)) (.cse88 (store .cse80 .cse89 0)) (.cse67 (@diff .cse85 .cse35)) (.cse2 (@diff .cse90 .cse35))) (let ((.cse91 (store .cse90 .cse2 0)) (.cse82 (store .cse85 .cse67 0)) (.cse87 (@diff .cse88 .cse35)) (.cse78 (@diff .cse79 .cse35))) (let ((.cse75 (store .cse79 .cse78 0)) (.cse16 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse55 (= .cse35 .cse98)) (.cse54 (+ .cse97 28)) (.cse59 (= .cse35 .cse96)) (.cse58 (+ .cse95 28)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse63 (store .cse88 .cse87 0)) (.cse69 (@diff .cse82 .cse35)) (.cse14 (= .cse35 .cse34)) (.cse8 (= .cse35 .cse94)) (.cse5 (= .cse35 .cse93)) (.cse36 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse13 (= .cse35 .cse92)) (.cse11 (@diff .cse91 .cse35))) (let ((.cse10 (= .cse35 .cse91)) (.cse9 (= .cse35 (store .cse91 .cse11 0))) (.cse37 (or (<= .cse12 .cse36) .cse13)) (.cse4 (= .cse35 .cse90)) (.cse38 (or .cse5 (<= .cse6 .cse36))) (.cse39 (or (<= .cse7 .cse36) .cse8)) (.cse40 (or (<= .cse15 .cse36) .cse14)) (.cse32 (+ 28 .cse69)) (.cse26 (+ 28 .cse67)) (.cse22 (+ .cse68 28)) (.cse31 (+ .cse70 28)) (.cse28 (+ .cse66 28)) (.cse23 (+ .cse71 28)) (.cse50 (= .cse35 .cse63)) (.cse61 (+ .cse89 28)) (.cse52 (= .cse88 .cse35)) (.cse53 (+ .cse87 28)) (.cse27 (= .cse35 .cse86)) (.cse25 (= .cse35 .cse85)) (.cse21 (= .cse35 .cse84)) (.cse33 (= .cse35 .cse82)) (.cse30 (= .cse35 .cse83)) (.cse29 (= .cse35 (store .cse82 .cse69 0))) (.cse24 (= .cse81 .cse35)) (.cse17 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse62 (= .cse80 .cse35)) (.cse64 (or .cse59 (<= .cse58 .cse3))) (.cse65 (or .cse55 (<= .cse54 .cse3))) (.cse0 (not .cse16)) (.cse20 (= .cse35 .cse75)) (.cse18 (or (<= (+ .cse78 28) .cse3) (= .cse79 .cse35))) (.cse19 (or (<= (+ .cse76 28) .cse3) (= .cse35 .cse77))) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse60 (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (or .cse0 .cse1) (or (and (or (<= (+ .cse2 28) .cse3) .cse4) (or .cse5 (<= (+ .cse6 28) .cse3)) (or (<= (+ .cse7 28) .cse3) .cse8) .cse9 (or .cse10 (<= (+ .cse11 28) .cse3)) (or (<= (+ .cse12 28) .cse3) .cse13) (or .cse14 (<= (+ 28 .cse15) .cse3))) .cse16) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) .cse17 (or (and .cse17 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse18 .cse19 .cse1 .cse20) .cse0) (or (and (or .cse21 (<= .cse22 .cse3)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= .cse23 .cse3) .cse24) (or .cse25 (<= .cse26 .cse3)) (or .cse27 (<= .cse28 .cse3)) .cse1 .cse29 (or .cse30 (<= .cse31 .cse3)) (or (<= .cse32 .cse3) .cse33)) .cse0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse3) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse3) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse3) (= .cse34 (store (store .cse35 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)))) (or (and .cse17 .cse14) .cse16) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) .cse14 (or (and (or .cse10 (<= .cse11 .cse36)) (or .cse4 (<= .cse2 .cse36)) .cse37 .cse9 .cse38 .cse39 .cse40) .cse16) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (or .cse0 (let ((.cse42 (store .cse34 .cse49 0))) (let ((.cse41 (@diff .cse42 .cse35))) (let ((.cse45 (store .cse42 .cse41 0))) (let ((.cse46 (@diff .cse45 .cse35))) (let ((.cse43 (store .cse45 .cse46 0))) (let ((.cse44 (@diff .cse43 .cse35))) (let ((.cse47 (store .cse43 .cse44 0))) (let ((.cse48 (@diff .cse47 .cse35))) (and (or (<= .cse41 .cse36) (= .cse35 .cse42)) (or (= .cse35 .cse43) (<= .cse44 .cse36)) (or (= .cse35 .cse45) (<= .cse46 .cse36)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse35 (store .cse47 .cse48 0)) (or (<= .cse48 .cse36) (= .cse35 .cse47)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (and .cse17 .cse24 .cse1)) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1155 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse3) (= .cse34 (store .cse35 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse35 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)))) (or (and .cse37 .cse4 .cse38 .cse39 .cse40) .cse16) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse51 (@diff .cse63 .cse35))) (let ((.cse57 (store .cse63 .cse51 0))) (let ((.cse56 (@diff .cse57 .cse35))) (and (or .cse50 (<= (+ .cse51 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse52 (<= .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse54 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse55) (or (<= (+ .cse56 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= .cse35 .cse57)) (or (<= .cse58 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse59) (= .cse35 (store .cse57 .cse56 0)) (not .cse60) (or (<= .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse62))))) (and (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (or (<= .cse32 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse33) (or .cse25 (<= .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse21 (<= .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse30 (<= .cse31 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse27 (<= .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse24) .cse1 .cse29 .cse60)) (or (and .cse17 .cse50 .cse64 .cse65 (or (<= .cse61 .cse3) .cse62) (or .cse52 (<= .cse53 .cse3))) .cse16) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse3) (= .cse34 (store (store (store .cse35 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse3) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse3))) (or .cse0 (and (or .cse27 (<= .cse66 .cse36)) (or (<= .cse67 .cse36) .cse25) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse21 (<= .cse68 .cse36)) (or .cse33 (<= .cse69 .cse36)) (or (<= .cse70 .cse36) .cse30) .cse1 .cse29 (or (<= .cse71 .cse36) .cse24))) (= |c_~#cache~0.base| 3) (or (and .cse17 .cse62 .cse64 .cse65) .cse16) (or .cse0 (let ((.cse72 (@diff .cse75 .cse35))) (let ((.cse74 (store .cse75 .cse72 0))) (let ((.cse73 (@diff .cse74 .cse35))) (and (or .cse20 (<= (+ .cse72 28) .cse3)) .cse18 .cse19 (or (<= (+ .cse73 28) .cse3) (= .cse35 .cse74)) (= .cse35 (store .cse74 .cse73 0)) .cse1 .cse60 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))))))))))))))))))) is different from true [2022-11-15 14:31:02,102 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse96 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse58 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse39 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse84 (store .cse96 .cse58 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse28 (@diff .cse84 .cse22)) (.cse20 (@diff .cse39 .cse22))) (let ((.cse102 (store .cse39 .cse20 0)) (.cse86 (store .cse84 .cse28 0))) (let ((.cse36 (@diff .cse86 .cse22)) (.cse11 (@diff .cse102 .cse22))) (let ((.cse103 (store .cse102 .cse11 0)) (.cse87 (store .cse86 .cse36 0))) (let ((.cse27 (@diff .cse87 .cse22)) (.cse12 (@diff .cse103 .cse22))) (let ((.cse101 (store .cse103 .cse12 0)) (.cse90 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse89 (store .cse87 .cse27 0))) (let ((.cse33 (@diff .cse89 .cse22)) (.cse100 (store .cse90 .cse58 0)) (.cse17 (@diff .cse101 .cse22))) (let ((.cse97 (@diff .cse90 .cse22)) (.cse91 (store .cse101 .cse17 0)) (.cse94 (@diff .cse100 .cse22)) (.cse88 (store .cse89 .cse33 0))) (let ((.cse31 (@diff .cse88 .cse22)) (.cse92 (store .cse100 .cse94 0)) (.cse7 (@diff .cse91 .cse22)) (.cse98 (store .cse90 .cse97 0))) (let ((.cse99 (@diff .cse98 .cse22)) (.cse95 (store .cse91 .cse7 0)) (.cse93 (@diff .cse92 .cse22)) (.cse85 (store .cse88 .cse31 0))) (let ((.cse37 (@diff .cse85 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse39)) (.cse13 (= .cse22 .cse103)) (.cse10 (= .cse22 .cse102)) (.cse45 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse101)) (.cse40 (= .cse22 .cse100)) (.cse66 (store .cse92 .cse93 0)) (.cse16 (@diff .cse95 .cse22)) (.cse41 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse83 (= .cse22 .cse90)) (.cse25 (store .cse98 .cse99 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse98) (<= (+ .cse99 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse97 28) .cse8) .cse83)) (.cse42 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse43 (= (select .cse96 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse44 (and (not .cse41) (= (select .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse95)) (.cse14 (= .cse22 (store .cse95 .cse16 0))) (.cse59 (= .cse22 .cse66)) (.cse63 (or .cse40 (<= (+ 28 .cse94) .cse8))) (.cse64 (or (= .cse22 .cse92) (<= (+ 28 .cse93) .cse8))) (.cse46 (or (<= .cse17 .cse45) .cse18)) (.cse9 (= .cse22 .cse91)) (.cse47 (or .cse10 (<= .cse11 .cse45))) (.cse48 (or (<= .cse12 .cse45) .cse13)) (.cse49 (or (<= .cse20 .cse45) .cse19)) (.cse65 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse75 (store .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse32 (= .cse22 .cse89)) (.cse30 (= .cse22 .cse88)) (.cse26 (= .cse22 .cse87)) (.cse38 (= .cse22 .cse85)) (.cse35 (= .cse22 .cse86)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse34 (= .cse22 (store .cse85 .cse37 0))) (.cse29 (= .cse84 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (or (and (or .cse26 (<= (+ .cse27 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse28 28) .cse8) .cse29) (or .cse30 (<= (+ 28 .cse31) .cse8)) (or .cse32 (<= (+ .cse33 28) .cse8)) .cse1 .cse34 (or .cse35 (<= (+ .cse36 28) .cse8)) (or (<= (+ 28 .cse37) .cse8) .cse38)) .cse0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse3 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse8) (= .cse39 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse40 .cse1 .cse41)) (or (and .cse42 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse41 .cse43) .cse44) (or (and .cse42 .cse1 .cse41 .cse43) .cse44) .cse19 (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_1163)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (and (or .cse15 (<= .cse16 .cse45)) (or .cse9 (<= .cse7 .cse45)) .cse46 .cse14 .cse47 .cse48 .cse49) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (or .cse0 (let ((.cse51 (store .cse39 .cse58 0))) (let ((.cse50 (@diff .cse51 .cse22))) (let ((.cse54 (store .cse51 .cse50 0))) (let ((.cse55 (@diff .cse54 .cse22))) (let ((.cse52 (store .cse54 .cse55 0))) (let ((.cse53 (@diff .cse52 .cse22))) (let ((.cse56 (store .cse52 .cse53 0))) (let ((.cse57 (@diff .cse56 .cse22))) (and (or (<= .cse50 .cse45) (= .cse22 .cse51)) (or (= .cse22 .cse52) (<= .cse53 .cse45)) (or (= .cse22 .cse54) (<= .cse55 .cse45)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse56 .cse57 0)) (or (<= .cse57 .cse45) (= .cse22 .cse56)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (let ((.cse60 (@diff .cse66 .cse22))) (let ((.cse62 (store .cse66 .cse60 0))) (let ((.cse61 (@diff .cse62 .cse22))) (and (or .cse59 (<= (+ .cse60 28) .cse8)) (or (<= (+ .cse61 28) .cse8) (= .cse22 .cse62)) .cse63 .cse64 (= .cse22 (store .cse62 .cse61 0)) .cse1 .cse41 .cse65))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse59 .cse63 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse64 .cse1) .cse0) (or (and .cse46 .cse9 .cse47 .cse48 .cse49) .cse6) (or .cse0 (let ((.cse73 (store .cse75 .cse58 0))) (let ((.cse74 (@diff .cse73 .cse22))) (let ((.cse67 (store .cse73 .cse74 0))) (let ((.cse68 (@diff .cse67 .cse22))) (let ((.cse71 (store .cse67 .cse68 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse69 (store .cse71 .cse72 0))) (let ((.cse70 (@diff .cse69 .cse22))) (and (or (= .cse22 .cse67) (<= (+ .cse68 28) .cse8)) (= .cse22 (store .cse69 .cse70 0)) (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (or (= .cse22 .cse73) (<= (+ .cse74 28) .cse8)) (or (<= (+ 28 .cse70) .cse8) (= .cse22 .cse69)) .cse1 .cse41 .cse65)))))))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (= .cse39 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse8) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse8))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse82 (store .cse75 .cse76 0))) (let ((.cse81 (@diff .cse82 .cse22))) (let ((.cse77 (store .cse82 .cse81 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse80 (store .cse77 .cse78 0))) (let ((.cse79 (@diff .cse80 .cse22))) (and (or (<= (+ .cse76 28) .cse8) (= .cse22 .cse75)) .cse3 (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse79) .cse8) (= .cse22 .cse80)) (= .cse22 (store .cse80 .cse79 0)) (or (<= (+ 28 .cse81) .cse8) (= .cse22 .cse82)))))))))) .cse6) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (= .cse39 (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse8))) (or .cse0 (and (or .cse32 (<= .cse33 .cse45)) (or (<= .cse31 .cse45) .cse30) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse26 (<= .cse27 .cse45)) (or .cse38 (<= .cse37 .cse45)) (or (<= .cse36 .cse45) .cse35) .cse1 .cse34 (or (<= .cse28 .cse45) .cse29))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse83) .cse6)))))))))))))))) is different from true [2022-11-15 14:31:04,183 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse99 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse62 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse43 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse88 (store .cse99 .cse62 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse28 (@diff .cse88 .cse22)) (.cse20 (@diff .cse43 .cse22))) (let ((.cse105 (store .cse43 .cse20 0)) (.cse90 (store .cse88 .cse28 0))) (let ((.cse36 (@diff .cse90 .cse22)) (.cse11 (@diff .cse105 .cse22))) (let ((.cse106 (store .cse105 .cse11 0)) (.cse91 (store .cse90 .cse36 0))) (let ((.cse27 (@diff .cse91 .cse22)) (.cse12 (@diff .cse106 .cse22))) (let ((.cse104 (store .cse106 .cse12 0)) (.cse41 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse93 (store .cse91 .cse27 0))) (let ((.cse33 (@diff .cse93 .cse22)) (.cse103 (store .cse41 .cse62 0)) (.cse17 (@diff .cse104 .cse22))) (let ((.cse100 (@diff .cse41 .cse22)) (.cse94 (store .cse104 .cse17 0)) (.cse97 (@diff .cse103 .cse22)) (.cse92 (store .cse93 .cse33 0))) (let ((.cse31 (@diff .cse92 .cse22)) (.cse95 (store .cse103 .cse97 0)) (.cse7 (@diff .cse94 .cse22)) (.cse101 (store .cse41 .cse100 0))) (let ((.cse102 (@diff .cse101 .cse22)) (.cse98 (store .cse94 .cse7 0)) (.cse96 (@diff .cse95 .cse22)) (.cse89 (store .cse92 .cse31 0))) (let ((.cse37 (@diff .cse89 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse43)) (.cse13 (= .cse22 .cse106)) (.cse10 (= .cse22 .cse105)) (.cse49 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse104)) (.cse44 (= .cse22 .cse103)) (.cse70 (store .cse95 .cse96 0)) (.cse16 (@diff .cse98 .cse22)) (.cse45 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse87 (= .cse22 .cse41)) (.cse25 (store .cse101 .cse102 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse101) (<= (+ .cse102 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse100 28) .cse8) .cse87)) (.cse46 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse47 (= (select .cse99 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse48 (and (not .cse45) (= (select .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse98)) (.cse14 (= .cse22 (store .cse98 .cse16 0))) (.cse63 (= .cse22 .cse70)) (.cse67 (or .cse44 (<= (+ 28 .cse97) .cse8))) (.cse68 (or (= .cse22 .cse95) (<= (+ 28 .cse96) .cse8))) (.cse50 (or (<= .cse17 .cse49) .cse18)) (.cse9 (= .cse22 .cse94)) (.cse51 (or .cse10 (<= .cse11 .cse49))) (.cse52 (or (<= .cse12 .cse49) .cse13)) (.cse53 (or (<= .cse20 .cse49) .cse19)) (.cse69 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse79 (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse32 (= .cse22 .cse93)) (.cse30 (= .cse22 .cse92)) (.cse26 (= .cse22 .cse91)) (.cse38 (= .cse22 .cse89)) (.cse35 (= .cse22 .cse90)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse34 (= .cse22 (store .cse89 .cse37 0))) (.cse29 (= .cse88 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (or (and (or .cse26 (<= (+ .cse27 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse28 28) .cse8) .cse29) (or .cse30 (<= (+ 28 .cse31) .cse8)) (or .cse32 (<= (+ .cse33 28) .cse8)) .cse1 .cse34 (or .cse35 (<= (+ .cse36 28) .cse8)) (or (<= (+ 28 .cse37) .cse8) .cse38)) .cse0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse3 (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse39 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse42 (+ |c_~#cache~0.offset| .cse39))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse39)) (< (select (select (store (let ((.cse40 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)))) (store .cse40 |c_~#cache~0.base| (store (store (select .cse40 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse42 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< .cse42 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse8) (= .cse43 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse44 .cse1 .cse45)) (or (and .cse46 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse45 .cse47) .cse48) (or (and .cse46 .cse1 .cse45 .cse47) .cse48) .cse19 (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_1163)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (or (and (or .cse15 (<= .cse16 .cse49)) (or .cse9 (<= .cse7 .cse49)) .cse50 .cse14 .cse51 .cse52 .cse53) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (or .cse0 (let ((.cse55 (store .cse43 .cse62 0))) (let ((.cse54 (@diff .cse55 .cse22))) (let ((.cse58 (store .cse55 .cse54 0))) (let ((.cse59 (@diff .cse58 .cse22))) (let ((.cse56 (store .cse58 .cse59 0))) (let ((.cse57 (@diff .cse56 .cse22))) (let ((.cse60 (store .cse56 .cse57 0))) (let ((.cse61 (@diff .cse60 .cse22))) (and (or (<= .cse54 .cse49) (= .cse22 .cse55)) (or (= .cse22 .cse56) (<= .cse57 .cse49)) (or (= .cse22 .cse58) (<= .cse59 .cse49)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse60 .cse61 0)) (or (<= .cse61 .cse49) (= .cse22 .cse60)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (let ((.cse64 (@diff .cse70 .cse22))) (let ((.cse66 (store .cse70 .cse64 0))) (let ((.cse65 (@diff .cse66 .cse22))) (and (or .cse63 (<= (+ .cse64 28) .cse8)) (or (<= (+ .cse65 28) .cse8) (= .cse22 .cse66)) .cse67 .cse68 (= .cse22 (store .cse66 .cse65 0)) .cse1 .cse45 .cse69))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse63 .cse67 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse68 .cse1) .cse0) (or (and .cse50 .cse9 .cse51 .cse52 .cse53) .cse6) (or .cse0 (let ((.cse77 (store .cse79 .cse62 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse71 (store .cse77 .cse78 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse75 (store .cse71 .cse72 0))) (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse73 (store .cse75 .cse76 0))) (let ((.cse74 (@diff .cse73 .cse22))) (and (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (= .cse22 (store .cse73 .cse74 0)) (or (= .cse22 .cse75) (<= (+ .cse76 28) .cse8)) (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse74) .cse8) (= .cse22 .cse73)) .cse1 .cse45 .cse69)))))))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (= .cse43 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse8) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse8))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse80 (@diff .cse79 .cse22))) (let ((.cse86 (store .cse79 .cse80 0))) (let ((.cse85 (@diff .cse86 .cse22))) (let ((.cse81 (store .cse86 .cse85 0))) (let ((.cse82 (@diff .cse81 .cse22))) (let ((.cse84 (store .cse81 .cse82 0))) (let ((.cse83 (@diff .cse84 .cse22))) (and (or (<= (+ .cse80 28) .cse8) (= .cse22 .cse79)) .cse3 (or (= .cse22 .cse81) (<= (+ .cse82 28) .cse8)) (or (<= (+ 28 .cse83) .cse8) (= .cse22 .cse84)) (= .cse22 (store .cse84 .cse83 0)) (or (<= (+ 28 .cse85) .cse8) (= .cse22 .cse86)))))))))) .cse6) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (= .cse43 (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse8))) (or .cse0 (and (or .cse32 (<= .cse33 .cse49)) (or (<= .cse31 .cse49) .cse30) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse26 (<= .cse27 .cse49)) (or .cse38 (<= .cse37 .cse49)) (or (<= .cse36 .cse49) .cse35) .cse1 .cse34 (or (<= .cse28 .cse49) .cse29))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse87) .cse6)))))))))))))))) is different from true [2022-11-15 14:31:19,172 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse99 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse62 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse43 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse88 (store .cse99 .cse62 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse28 (@diff .cse88 .cse22)) (.cse20 (@diff .cse43 .cse22))) (let ((.cse105 (store .cse43 .cse20 0)) (.cse90 (store .cse88 .cse28 0))) (let ((.cse36 (@diff .cse90 .cse22)) (.cse11 (@diff .cse105 .cse22))) (let ((.cse106 (store .cse105 .cse11 0)) (.cse91 (store .cse90 .cse36 0))) (let ((.cse27 (@diff .cse91 .cse22)) (.cse12 (@diff .cse106 .cse22))) (let ((.cse104 (store .cse106 .cse12 0)) (.cse41 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse93 (store .cse91 .cse27 0))) (let ((.cse33 (@diff .cse93 .cse22)) (.cse103 (store .cse41 .cse62 0)) (.cse17 (@diff .cse104 .cse22))) (let ((.cse100 (@diff .cse41 .cse22)) (.cse94 (store .cse104 .cse17 0)) (.cse97 (@diff .cse103 .cse22)) (.cse92 (store .cse93 .cse33 0))) (let ((.cse31 (@diff .cse92 .cse22)) (.cse95 (store .cse103 .cse97 0)) (.cse7 (@diff .cse94 .cse22)) (.cse101 (store .cse41 .cse100 0))) (let ((.cse102 (@diff .cse101 .cse22)) (.cse98 (store .cse94 .cse7 0)) (.cse96 (@diff .cse95 .cse22)) (.cse89 (store .cse92 .cse31 0))) (let ((.cse37 (@diff .cse89 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse43)) (.cse13 (= .cse22 .cse106)) (.cse10 (= .cse22 .cse105)) (.cse49 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse104)) (.cse44 (= .cse22 .cse103)) (.cse70 (store .cse95 .cse96 0)) (.cse16 (@diff .cse98 .cse22)) (.cse45 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse87 (= .cse22 .cse41)) (.cse25 (store .cse101 .cse102 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse101) (<= (+ .cse102 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse100 28) .cse8) .cse87)) (.cse46 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse47 (= (select .cse99 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse48 (and (not .cse45) (= (select .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse98)) (.cse14 (= .cse22 (store .cse98 .cse16 0))) (.cse63 (= .cse22 .cse70)) (.cse67 (or .cse44 (<= (+ 28 .cse97) .cse8))) (.cse68 (or (= .cse22 .cse95) (<= (+ 28 .cse96) .cse8))) (.cse50 (or (<= .cse17 .cse49) .cse18)) (.cse9 (= .cse22 .cse94)) (.cse51 (or .cse10 (<= .cse11 .cse49))) (.cse52 (or (<= .cse12 .cse49) .cse13)) (.cse53 (or (<= .cse20 .cse49) .cse19)) (.cse69 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse79 (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse32 (= .cse22 .cse93)) (.cse30 (= .cse22 .cse92)) (.cse26 (= .cse22 .cse91)) (.cse38 (= .cse22 .cse89)) (.cse35 (= .cse22 .cse90)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse34 (= .cse22 (store .cse89 .cse37 0))) (.cse29 (= .cse88 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (or (and (or .cse26 (<= (+ .cse27 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse28 28) .cse8) .cse29) (or .cse30 (<= (+ 28 .cse31) .cse8)) (or .cse32 (<= (+ .cse33 28) .cse8)) .cse1 .cse34 (or .cse35 (<= (+ .cse36 28) .cse8)) (or (<= (+ 28 .cse37) .cse8) .cse38)) .cse0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse3 (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse39 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse42 (+ |c_~#cache~0.offset| .cse39))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse39)) (< (select (select (store (let ((.cse40 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)))) (store .cse40 |c_~#cache~0.base| (store (store (select .cse40 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse42 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< .cse42 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse8) (= .cse43 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse44 .cse1 .cse45)) (or (and .cse46 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse45 .cse47) .cse48) (or (and .cse46 .cse1 .cse45 .cse47) .cse48) .cse19 (or (and (or .cse15 (<= .cse16 .cse49)) (or .cse9 (<= .cse7 .cse49)) .cse50 .cse14 .cse51 .cse52 .cse53) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (or .cse0 (let ((.cse55 (store .cse43 .cse62 0))) (let ((.cse54 (@diff .cse55 .cse22))) (let ((.cse58 (store .cse55 .cse54 0))) (let ((.cse59 (@diff .cse58 .cse22))) (let ((.cse56 (store .cse58 .cse59 0))) (let ((.cse57 (@diff .cse56 .cse22))) (let ((.cse60 (store .cse56 .cse57 0))) (let ((.cse61 (@diff .cse60 .cse22))) (and (or (<= .cse54 .cse49) (= .cse22 .cse55)) (or (= .cse22 .cse56) (<= .cse57 .cse49)) (or (= .cse22 .cse58) (<= .cse59 .cse49)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse60 .cse61 0)) (or (<= .cse61 .cse49) (= .cse22 .cse60)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| 0) (or .cse0 (let ((.cse64 (@diff .cse70 .cse22))) (let ((.cse66 (store .cse70 .cse64 0))) (let ((.cse65 (@diff .cse66 .cse22))) (and (or .cse63 (<= (+ .cse64 28) .cse8)) (or (<= (+ .cse65 28) .cse8) (= .cse22 .cse66)) .cse67 .cse68 (= .cse22 (store .cse66 .cse65 0)) .cse1 .cse45 .cse69))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse63 .cse67 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse68 .cse1) .cse0) (or (and .cse50 .cse9 .cse51 .cse52 .cse53) .cse6) (or .cse0 (let ((.cse77 (store .cse79 .cse62 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse71 (store .cse77 .cse78 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse75 (store .cse71 .cse72 0))) (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse73 (store .cse75 .cse76 0))) (let ((.cse74 (@diff .cse73 .cse22))) (and (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (= .cse22 (store .cse73 .cse74 0)) (or (= .cse22 .cse75) (<= (+ .cse76 28) .cse8)) (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse74) .cse8) (= .cse22 .cse73)) .cse1 .cse45 .cse69)))))))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (= .cse43 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse8) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse8))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 0) (or (let ((.cse80 (@diff .cse79 .cse22))) (let ((.cse86 (store .cse79 .cse80 0))) (let ((.cse85 (@diff .cse86 .cse22))) (let ((.cse81 (store .cse86 .cse85 0))) (let ((.cse82 (@diff .cse81 .cse22))) (let ((.cse84 (store .cse81 .cse82 0))) (let ((.cse83 (@diff .cse84 .cse22))) (and (or (<= (+ .cse80 28) .cse8) (= .cse22 .cse79)) .cse3 (or (= .cse22 .cse81) (<= (+ .cse82 28) .cse8)) (or (<= (+ 28 .cse83) .cse8) (= .cse22 .cse84)) (= .cse22 (store .cse84 .cse83 0)) (or (<= (+ 28 .cse85) .cse8) (= .cse22 .cse86)))))))))) .cse6) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (= .cse43 (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse8))) (or .cse0 (and (or .cse32 (<= .cse33 .cse49)) (or (<= .cse31 .cse49) .cse30) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse26 (<= .cse27 .cse49)) (or .cse38 (<= .cse37 .cse49)) (or (<= .cse36 .cse49) .cse35) .cse1 .cse34 (or (<= .cse28 .cse49) .cse29))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse87) .cse6)))))))))))))))) is different from true [2022-11-15 14:31:21,241 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse96 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse58 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse39 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse84 (store .cse96 .cse58 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse28 (@diff .cse84 .cse22)) (.cse20 (@diff .cse39 .cse22))) (let ((.cse102 (store .cse39 .cse20 0)) (.cse86 (store .cse84 .cse28 0))) (let ((.cse36 (@diff .cse86 .cse22)) (.cse11 (@diff .cse102 .cse22))) (let ((.cse103 (store .cse102 .cse11 0)) (.cse87 (store .cse86 .cse36 0))) (let ((.cse27 (@diff .cse87 .cse22)) (.cse12 (@diff .cse103 .cse22))) (let ((.cse101 (store .cse103 .cse12 0)) (.cse90 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse89 (store .cse87 .cse27 0))) (let ((.cse33 (@diff .cse89 .cse22)) (.cse100 (store .cse90 .cse58 0)) (.cse17 (@diff .cse101 .cse22))) (let ((.cse97 (@diff .cse90 .cse22)) (.cse91 (store .cse101 .cse17 0)) (.cse94 (@diff .cse100 .cse22)) (.cse88 (store .cse89 .cse33 0))) (let ((.cse31 (@diff .cse88 .cse22)) (.cse92 (store .cse100 .cse94 0)) (.cse7 (@diff .cse91 .cse22)) (.cse98 (store .cse90 .cse97 0))) (let ((.cse99 (@diff .cse98 .cse22)) (.cse95 (store .cse91 .cse7 0)) (.cse93 (@diff .cse92 .cse22)) (.cse85 (store .cse88 .cse31 0))) (let ((.cse37 (@diff .cse85 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse39)) (.cse13 (= .cse22 .cse103)) (.cse10 (= .cse22 .cse102)) (.cse45 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse101)) (.cse40 (= .cse22 .cse100)) (.cse66 (store .cse92 .cse93 0)) (.cse16 (@diff .cse95 .cse22)) (.cse41 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse83 (= .cse22 .cse90)) (.cse25 (store .cse98 .cse99 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse98) (<= (+ .cse99 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse97 28) .cse8) .cse83)) (.cse42 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse43 (= (select .cse96 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse44 (and (not .cse41) (= (select .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse95)) (.cse14 (= .cse22 (store .cse95 .cse16 0))) (.cse59 (= .cse22 .cse66)) (.cse63 (or .cse40 (<= (+ 28 .cse94) .cse8))) (.cse64 (or (= .cse22 .cse92) (<= (+ 28 .cse93) .cse8))) (.cse46 (or (<= .cse17 .cse45) .cse18)) (.cse9 (= .cse22 .cse91)) (.cse47 (or .cse10 (<= .cse11 .cse45))) (.cse48 (or (<= .cse12 .cse45) .cse13)) (.cse49 (or (<= .cse20 .cse45) .cse19)) (.cse65 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse75 (store .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse32 (= .cse22 .cse89)) (.cse30 (= .cse22 .cse88)) (.cse26 (= .cse22 .cse87)) (.cse38 (= .cse22 .cse85)) (.cse35 (= .cse22 .cse86)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse34 (= .cse22 (store .cse85 .cse37 0))) (.cse29 (= .cse84 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (or (and (or .cse26 (<= (+ .cse27 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse28 28) .cse8) .cse29) (or .cse30 (<= (+ 28 .cse31) .cse8)) (or .cse32 (<= (+ .cse33 28) .cse8)) .cse1 .cse34 (or .cse35 (<= (+ .cse36 28) .cse8)) (or (<= (+ 28 .cse37) .cse8) .cse38)) .cse0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse3 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse8) (= .cse39 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse40 .cse1 .cse41)) (or (and .cse42 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse41 .cse43) .cse44) (or (and .cse42 .cse1 .cse41 .cse43) .cse44) .cse19 (or (and (or .cse15 (<= .cse16 .cse45)) (or .cse9 (<= .cse7 .cse45)) .cse46 .cse14 .cse47 .cse48 .cse49) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (or .cse0 (let ((.cse51 (store .cse39 .cse58 0))) (let ((.cse50 (@diff .cse51 .cse22))) (let ((.cse54 (store .cse51 .cse50 0))) (let ((.cse55 (@diff .cse54 .cse22))) (let ((.cse52 (store .cse54 .cse55 0))) (let ((.cse53 (@diff .cse52 .cse22))) (let ((.cse56 (store .cse52 .cse53 0))) (let ((.cse57 (@diff .cse56 .cse22))) (and (or (<= .cse50 .cse45) (= .cse22 .cse51)) (or (= .cse22 .cse52) (<= .cse53 .cse45)) (or (= .cse22 .cse54) (<= .cse55 .cse45)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse56 .cse57 0)) (or (<= .cse57 .cse45) (= .cse22 .cse56)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| 0) (or .cse0 (let ((.cse60 (@diff .cse66 .cse22))) (let ((.cse62 (store .cse66 .cse60 0))) (let ((.cse61 (@diff .cse62 .cse22))) (and (or .cse59 (<= (+ .cse60 28) .cse8)) (or (<= (+ .cse61 28) .cse8) (= .cse22 .cse62)) .cse63 .cse64 (= .cse22 (store .cse62 .cse61 0)) .cse1 .cse41 .cse65))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse59 .cse63 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse64 .cse1) .cse0) (or (and .cse46 .cse9 .cse47 .cse48 .cse49) .cse6) (or .cse0 (let ((.cse73 (store .cse75 .cse58 0))) (let ((.cse74 (@diff .cse73 .cse22))) (let ((.cse67 (store .cse73 .cse74 0))) (let ((.cse68 (@diff .cse67 .cse22))) (let ((.cse71 (store .cse67 .cse68 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse69 (store .cse71 .cse72 0))) (let ((.cse70 (@diff .cse69 .cse22))) (and (or (= .cse22 .cse67) (<= (+ .cse68 28) .cse8)) (= .cse22 (store .cse69 .cse70 0)) (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (or (= .cse22 .cse73) (<= (+ .cse74 28) .cse8)) (or (<= (+ 28 .cse70) .cse8) (= .cse22 .cse69)) .cse1 .cse41 .cse65)))))))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (= .cse39 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse8) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse8))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse82 (store .cse75 .cse76 0))) (let ((.cse81 (@diff .cse82 .cse22))) (let ((.cse77 (store .cse82 .cse81 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse80 (store .cse77 .cse78 0))) (let ((.cse79 (@diff .cse80 .cse22))) (and (or (<= (+ .cse76 28) .cse8) (= .cse22 .cse75)) .cse3 (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse79) .cse8) (= .cse22 .cse80)) (= .cse22 (store .cse80 .cse79 0)) (or (<= (+ 28 .cse81) .cse8) (= .cse22 .cse82)))))))))) .cse6) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (= .cse39 (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse8))) (or .cse0 (and (or .cse32 (<= .cse33 .cse45)) (or (<= .cse31 .cse45) .cse30) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse26 (<= .cse27 .cse45)) (or .cse38 (<= .cse37 .cse45)) (or (<= .cse36 .cse45) .cse35) .cse1 .cse34 (or (<= .cse28 .cse45) .cse29))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse83) .cse6)))))))))))))))) is different from true [2022-11-15 14:31:36,202 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse96 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse58 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse39 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse84 (store .cse96 .cse58 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse28 (@diff .cse84 .cse22)) (.cse20 (@diff .cse39 .cse22))) (let ((.cse102 (store .cse39 .cse20 0)) (.cse86 (store .cse84 .cse28 0))) (let ((.cse36 (@diff .cse86 .cse22)) (.cse11 (@diff .cse102 .cse22))) (let ((.cse103 (store .cse102 .cse11 0)) (.cse87 (store .cse86 .cse36 0))) (let ((.cse27 (@diff .cse87 .cse22)) (.cse12 (@diff .cse103 .cse22))) (let ((.cse101 (store .cse103 .cse12 0)) (.cse90 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse89 (store .cse87 .cse27 0))) (let ((.cse33 (@diff .cse89 .cse22)) (.cse100 (store .cse90 .cse58 0)) (.cse17 (@diff .cse101 .cse22))) (let ((.cse97 (@diff .cse90 .cse22)) (.cse91 (store .cse101 .cse17 0)) (.cse94 (@diff .cse100 .cse22)) (.cse88 (store .cse89 .cse33 0))) (let ((.cse31 (@diff .cse88 .cse22)) (.cse92 (store .cse100 .cse94 0)) (.cse7 (@diff .cse91 .cse22)) (.cse98 (store .cse90 .cse97 0))) (let ((.cse99 (@diff .cse98 .cse22)) (.cse95 (store .cse91 .cse7 0)) (.cse93 (@diff .cse92 .cse22)) (.cse85 (store .cse88 .cse31 0))) (let ((.cse37 (@diff .cse85 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse39)) (.cse13 (= .cse22 .cse103)) (.cse10 (= .cse22 .cse102)) (.cse45 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse101)) (.cse40 (= .cse22 .cse100)) (.cse66 (store .cse92 .cse93 0)) (.cse16 (@diff .cse95 .cse22)) (.cse41 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse83 (= .cse22 .cse90)) (.cse25 (store .cse98 .cse99 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse98) (<= (+ .cse99 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse97 28) .cse8) .cse83)) (.cse42 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse43 (= (select .cse96 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse44 (and (not .cse41) (= (select .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse95)) (.cse14 (= .cse22 (store .cse95 .cse16 0))) (.cse59 (= .cse22 .cse66)) (.cse63 (or .cse40 (<= (+ 28 .cse94) .cse8))) (.cse64 (or (= .cse22 .cse92) (<= (+ 28 .cse93) .cse8))) (.cse46 (or (<= .cse17 .cse45) .cse18)) (.cse9 (= .cse22 .cse91)) (.cse47 (or .cse10 (<= .cse11 .cse45))) (.cse48 (or (<= .cse12 .cse45) .cse13)) (.cse49 (or (<= .cse20 .cse45) .cse19)) (.cse65 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse75 (store .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse32 (= .cse22 .cse89)) (.cse30 (= .cse22 .cse88)) (.cse26 (= .cse22 .cse87)) (.cse38 (= .cse22 .cse85)) (.cse35 (= .cse22 .cse86)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse34 (= .cse22 (store .cse85 .cse37 0))) (.cse29 (= .cse84 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (or (and (or .cse26 (<= (+ .cse27 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse28 28) .cse8) .cse29) (or .cse30 (<= (+ 28 .cse31) .cse8)) (or .cse32 (<= (+ .cse33 28) .cse8)) .cse1 .cse34 (or .cse35 (<= (+ .cse36 28) .cse8)) (or (<= (+ 28 .cse37) .cse8) .cse38)) .cse0) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse3 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse8) (= .cse39 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse40 .cse1 .cse41)) (or (and .cse42 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse41 .cse43) .cse44) (or (and .cse42 .cse1 .cse41 .cse43) .cse44) .cse19 (or (and (or .cse15 (<= .cse16 .cse45)) (or .cse9 (<= .cse7 .cse45)) .cse46 .cse14 .cse47 .cse48 .cse49) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (or .cse0 (let ((.cse51 (store .cse39 .cse58 0))) (let ((.cse50 (@diff .cse51 .cse22))) (let ((.cse54 (store .cse51 .cse50 0))) (let ((.cse55 (@diff .cse54 .cse22))) (let ((.cse52 (store .cse54 .cse55 0))) (let ((.cse53 (@diff .cse52 .cse22))) (let ((.cse56 (store .cse52 .cse53 0))) (let ((.cse57 (@diff .cse56 .cse22))) (and (or (<= .cse50 .cse45) (= .cse22 .cse51)) (or (= .cse22 .cse52) (<= .cse53 .cse45)) (or (= .cse22 .cse54) (<= .cse55 .cse45)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse56 .cse57 0)) (or (<= .cse57 .cse45) (= .cse22 .cse56)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (let ((.cse60 (@diff .cse66 .cse22))) (let ((.cse62 (store .cse66 .cse60 0))) (let ((.cse61 (@diff .cse62 .cse22))) (and (or .cse59 (<= (+ .cse60 28) .cse8)) (or (<= (+ .cse61 28) .cse8) (= .cse22 .cse62)) .cse63 .cse64 (= .cse22 (store .cse62 .cse61 0)) .cse1 .cse41 .cse65))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse59 .cse63 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse64 .cse1) .cse0) (or (and .cse46 .cse9 .cse47 .cse48 .cse49) .cse6) (or .cse0 (let ((.cse73 (store .cse75 .cse58 0))) (let ((.cse74 (@diff .cse73 .cse22))) (let ((.cse67 (store .cse73 .cse74 0))) (let ((.cse68 (@diff .cse67 .cse22))) (let ((.cse71 (store .cse67 .cse68 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse69 (store .cse71 .cse72 0))) (let ((.cse70 (@diff .cse69 .cse22))) (and (or (= .cse22 .cse67) (<= (+ .cse68 28) .cse8)) (= .cse22 (store .cse69 .cse70 0)) (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (or (= .cse22 .cse73) (<= (+ .cse74 28) .cse8)) (or (<= (+ 28 .cse70) .cse8) (= .cse22 .cse69)) .cse1 .cse41 .cse65)))))))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (= .cse39 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse8) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse8))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse82 (store .cse75 .cse76 0))) (let ((.cse81 (@diff .cse82 .cse22))) (let ((.cse77 (store .cse82 .cse81 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse80 (store .cse77 .cse78 0))) (let ((.cse79 (@diff .cse80 .cse22))) (and (or (<= (+ .cse76 28) .cse8) (= .cse22 .cse75)) .cse3 (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse79) .cse8) (= .cse22 .cse80)) (= .cse22 (store .cse80 .cse79 0)) (or (<= (+ 28 .cse81) .cse8) (= .cse22 .cse82)))))))))) .cse6) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (= .cse39 (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse8))) (or .cse0 (and (or .cse32 (<= .cse33 .cse45)) (or (<= .cse31 .cse45) .cse30) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse26 (<= .cse27 .cse45)) (or .cse38 (<= .cse37 .cse45)) (or (<= .cse36 .cse45) .cse35) .cse1 .cse34 (or (<= .cse28 .cse45) .cse29))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse83) .cse6)))))))))))))))) is different from true [2022-11-15 14:31:49,943 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse60 (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse37 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse59 (store .cse60 .cse37 0)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse56 (@diff .cse59 .cse2)) (.cse55 (@diff .cse60 .cse2))) (let ((.cse54 (store .cse60 .cse55 0)) (.cse57 (store .cse59 .cse56 0))) (let ((.cse58 (@diff .cse57 .cse2)) (.cse53 (@diff .cse54 .cse2))) (let ((.cse41 (store .cse54 .cse53 0)) (.cse24 (= .cse2 .cse60)) (.cse18 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse13 (= .cse2 .cse59)) (.cse23 (store .cse57 .cse58 0)) (.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse9 (or (= .cse2 .cse57) (<= (+ .cse58 28) .cse0))) (.cse10 (= .cse2 .cse23)) (.cse11 (or .cse13 (<= (+ .cse56 28) .cse0))) (.cse14 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse8 (not .cse18)) (.cse12 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse22 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse15 (or (<= (+ .cse55 28) .cse0) .cse24)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse16 (= .cse2 .cse41)) (.cse17 (or (<= (+ 28 .cse53) .cse0) (= .cse2 .cse54))) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (and (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1157 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse0) (= .cse1 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse3 (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1155 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (let ((.cse7 (+ |c_~#cache~0.offset| .cse4))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse4)) (< (select (select (store (let ((.cse5 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)))) (store .cse5 |c_~#cache~0.base| (store (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< .cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| 28)))))) (exists ((v_ArrVal_1152 Int)) (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1152) .cse1)) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse8 (and .cse9 .cse3 .cse10 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse11 .cse12)) (or .cse8 (and .cse13 .cse12 .cse14)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0) (= |c_~#cache~0.offset| 0) (or (and .cse15 .cse3 .cse16 .cse17) .cse18) (exists ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse0) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse0) (= (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160) .cse1))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or .cse8 (let ((.cse21 (@diff .cse23 .cse2))) (let ((.cse19 (store .cse23 .cse21 0))) (let ((.cse20 (@diff .cse19 .cse2))) (and .cse9 (= .cse2 (store .cse19 .cse20 0)) (or .cse10 (<= (+ .cse21 28) .cse0)) .cse11 (or (<= (+ 28 .cse20) .cse0) (= .cse2 .cse19)) .cse12 .cse14 .cse22))))) (or (and .cse3 .cse24) .cse18) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or .cse8 (let ((.cse30 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse37 0))) (let ((.cse29 (@diff .cse30 .cse2))) (let ((.cse25 (store .cse30 .cse29 0))) (let ((.cse26 (@diff .cse25 .cse2))) (let ((.cse31 (store .cse25 .cse26 0))) (let ((.cse32 (@diff .cse31 .cse2))) (let ((.cse35 (store .cse31 .cse32 0))) (let ((.cse36 (@diff .cse35 .cse2))) (let ((.cse27 (store .cse35 .cse36 0))) (let ((.cse28 (@diff .cse27 .cse2))) (let ((.cse33 (store .cse27 .cse28 0))) (let ((.cse34 (@diff .cse33 .cse2))) (and (or (= .cse2 .cse25) (<= .cse26 .cse0)) (or (= .cse2 .cse27) (<= .cse28 .cse0)) (or (<= .cse29 .cse0) (= .cse30 .cse2)) (or (= .cse2 .cse31) (<= .cse32 .cse0)) (or (= .cse2 .cse33) (<= .cse34 .cse0)) (or (= .cse2 .cse35) (<= .cse36 .cse0)) .cse12 (= .cse2 (store .cse33 .cse34 0)) .cse22)))))))))))))) (or (let ((.cse38 (@diff .cse41 .cse2))) (let ((.cse40 (store .cse41 .cse38 0))) (let ((.cse39 (@diff .cse40 .cse2))) (and .cse15 .cse3 (or .cse16 (<= (+ .cse38 28) .cse0)) (or (<= (+ 28 .cse39) .cse0) (= .cse2 .cse40)) (= .cse2 (store .cse40 .cse39 0)) .cse17)))) .cse18) (or (let ((.cse42 (@diff .cse1 .cse2))) (let ((.cse51 (store .cse1 .cse42 0))) (let ((.cse52 (@diff .cse51 .cse2))) (let ((.cse49 (store .cse51 .cse52 0))) (let ((.cse50 (@diff .cse49 .cse2))) (let ((.cse48 (store .cse49 .cse50 0))) (let ((.cse47 (@diff .cse48 .cse2))) (let ((.cse45 (store .cse48 .cse47 0))) (let ((.cse46 (@diff .cse45 .cse2))) (let ((.cse43 (store .cse45 .cse46 0))) (let ((.cse44 (@diff .cse43 .cse2))) (and (or (<= .cse42 .cse0) (= .cse2 .cse1)) (= .cse2 (store .cse43 .cse44 0)) (or (= .cse2 .cse45) (<= .cse46 .cse0)) (or (= .cse2 .cse43) (<= .cse44 .cse0)) (or (<= .cse47 .cse0) (= .cse2 .cse48)) (or (= .cse2 .cse49) (<= .cse50 .cse0)) (or (= .cse2 .cse51) (<= .cse52 .cse0)))))))))))))) .cse18) (= |c_~#cache~0.base| 3)))))))))) is different from true [2022-11-15 14:32:14,820 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse86 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse69 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse86 0)) (.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse56 (@diff .cse1 .cse2)) (.cse44 (@diff .cse69 .cse2))) (let ((.cse71 (store .cse69 .cse44 0)) (.cse82 (store .cse1 .cse56 0))) (let ((.cse54 (@diff .cse82 .cse2)) (.cse41 (@diff .cse71 .cse2))) (let ((.cse72 (store .cse71 .cse41 0)) (.cse83 (store .cse82 .cse54 0))) (let ((.cse64 (@diff .cse83 .cse2)) (.cse47 (@diff .cse72 .cse2))) (let ((.cse85 (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse74 (store .cse72 .cse47 0)) (.cse81 (store .cse83 .cse64 0))) (let ((.cse65 (store .cse1 .cse86 0)) (.cse62 (@diff .cse81 .cse2)) (.cse51 (@diff .cse74 .cse2)) (.cse84 (store .cse85 .cse86 0))) (let ((.cse78 (@diff .cse84 .cse2)) (.cse77 (@diff .cse85 .cse2)) (.cse73 (store .cse74 .cse51 0)) (.cse68 (store .cse81 .cse62 0)) (.cse22 (@diff .cse65 .cse2))) (let ((.cse66 (store .cse65 .cse22 0)) (.cse13 (@diff .cse68 .cse2)) (.cse43 (@diff .cse73 .cse2)) (.cse76 (store .cse85 .cse77 0)) (.cse79 (store .cse84 .cse78 0))) (let ((.cse80 (@diff .cse79 .cse2)) (.cse75 (@diff .cse76 .cse2)) (.cse70 (store .cse73 .cse43 0)) (.cse67 (store .cse68 .cse13 0)) (.cse27 (@diff .cse66 .cse2))) (let ((.cse30 (store .cse66 .cse27 0)) (.cse19 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse11 (@diff .cse67 .cse2)) (.cse49 (@diff .cse70 .cse2)) (.cse61 (store .cse76 .cse75 0)) (.cse39 (= .cse2 .cse85)) (.cse20 (= .cse2 .cse84)) (.cse38 (store .cse79 .cse80 0)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse57 (= .cse2 .cse1)) (.cse55 (= .cse2 .cse83)) (.cse53 (= .cse2 .cse82)) (.cse0 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse63 (= .cse2 .cse81))) (let ((.cse14 (or (<= .cse62 .cse0) .cse63)) (.cse16 (or .cse53 (<= .cse54 .cse0))) (.cse17 (or (<= .cse64 .cse0) .cse55)) (.cse18 (or (<= .cse56 .cse0) .cse57)) (.cse6 (or (= .cse2 .cse79) (<= (+ .cse80 28) .cse3))) (.cse7 (= .cse2 .cse38)) (.cse8 (or .cse20 (<= (+ .cse78 28) .cse3))) (.cse21 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse37 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse31 (or (<= (+ .cse77 28) .cse3) .cse39)) (.cse4 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse32 (= .cse2 .cse61)) (.cse33 (or (<= (+ 28 .cse75) .cse3) (= .cse2 .cse76))) (.cse50 (= .cse2 .cse74)) (.cse42 (= .cse2 .cse73)) (.cse46 (= .cse2 .cse72)) (.cse48 (= .cse2 .cse70)) (.cse40 (= .cse2 .cse71)) (.cse52 (= .cse2 (store .cse70 .cse49 0))) (.cse45 (= .cse69 .cse2)) (.cse15 (= .cse2 (store .cse67 .cse11 0))) (.cse12 (= .cse2 .cse68)) (.cse10 (= .cse2 .cse67)) (.cse5 (not .cse19)) (.cse24 (= .cse2 .cse30)) (.cse26 (= .cse2 .cse66)) (.cse23 (= .cse2 .cse65)) (.cse9 (= |c_ULTIMATE.start_main_~i~3#1| 0))) (and (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse0) (= .cse1 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (= |c_t_funThread1of1ForFork0_#t~post41#1| 0) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1157 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse3) (= .cse1 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1157)))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1155 Int)) (and (= .cse1 (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse4 (exists ((v_ArrVal_1152 Int)) (= (store .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1152) .cse1)) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse5 (and .cse6 .cse4 .cse7 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse8 .cse9)) (or (and (or .cse10 (<= .cse11 .cse0)) (or .cse12 (<= .cse13 .cse0)) .cse14 .cse15 .cse16 .cse17 .cse18) .cse19) (or .cse5 (and .cse20 .cse9 .cse21)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3) (or .cse5 (let ((.cse25 (@diff .cse30 .cse2))) (let ((.cse28 (store .cse30 .cse25 0))) (let ((.cse29 (@diff .cse28 .cse2))) (and (or (<= .cse22 .cse0) .cse23) (or .cse24 (<= .cse25 .cse0)) (or .cse26 (<= .cse27 .cse0)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse2 (store .cse28 .cse29 0)) (or (<= .cse29 .cse0) (= .cse2 .cse28)) .cse9))))) (= |c_~#cache~0.offset| 0) (or (and .cse31 .cse4 .cse32 .cse33) .cse19) (exists ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse3) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse3) (= (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160) .cse1))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse14 .cse12 .cse16 .cse17 .cse18) .cse19) (or .cse5 (let ((.cse36 (@diff .cse38 .cse2))) (let ((.cse34 (store .cse38 .cse36 0))) (let ((.cse35 (@diff .cse34 .cse2))) (and .cse6 (= .cse2 (store .cse34 .cse35 0)) (or .cse7 (<= (+ .cse36 28) .cse3)) .cse8 (or (<= (+ 28 .cse35) .cse3) (= .cse2 .cse34)) .cse9 .cse21 .cse37))))) (or (and .cse4 .cse39) .cse19) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or .cse5 (and (or .cse40 (<= .cse41 .cse3)) (or .cse42 (<= .cse43 .cse3)) (or (<= .cse44 .cse3) .cse45) (or .cse46 (<= .cse47 .cse3)) (or .cse48 (<= .cse49 .cse3)) (or .cse50 (<= .cse51 .cse3)) .cse9 .cse52 .cse37)) (or (and (or .cse53 (<= .cse54 |c_~#cache~0.offset|)) .cse55 (or (<= .cse56 |c_~#cache~0.offset|) .cse57)) .cse19) (or (let ((.cse58 (@diff .cse61 .cse2))) (let ((.cse60 (store .cse61 .cse58 0))) (let ((.cse59 (@diff .cse60 .cse2))) (and .cse31 .cse4 (or .cse32 (<= (+ .cse58 28) .cse3)) (or (<= (+ 28 .cse59) .cse3) (= .cse2 .cse60)) (= .cse2 (store .cse60 .cse59 0)) .cse33)))) .cse19) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse0) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse0) (= .cse1 (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (or .cse5 (and (or .cse50 (<= .cse51 .cse0)) (or (<= .cse43 .cse0) .cse42) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse46 (<= .cse47 .cse0)) (or .cse48 (<= .cse49 .cse0)) (or (<= .cse41 .cse0) .cse40) .cse9 .cse52 (or (<= .cse44 .cse0) .cse45))) (or (and (or (<= .cse56 .cse3) .cse57) .cse15 (or .cse12 (<= .cse13 .cse3)) (or .cse10 (<= .cse11 .cse3)) (or (<= .cse62 .cse3) .cse63) (or .cse55 (<= .cse64 .cse3)) (or .cse53 (<= .cse54 .cse3))) .cse19) (or .cse5 (and .cse24 (or (<= .cse27 |c_~#cache~0.offset|) .cse26) (or (<= .cse22 |c_~#cache~0.offset|) .cse23) .cse9)) (= |c_~#cache~0.base| 3)))))))))))))))) is different from true [2022-11-15 14:32:17,233 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse72 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse83 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse72 0)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse28 (@diff .cse83 .cse2)) (.cse21 (@diff .cse1 .cse2))) (let ((.cse100 (store .cse1 .cse21 0)) (.cse85 (store .cse83 .cse28 0))) (let ((.cse37 (@diff .cse85 .cse2)) (.cse12 (@diff .cse100 .cse2))) (let ((.cse101 (store .cse100 .cse12 0)) (.cse86 (store .cse85 .cse37 0))) (let ((.cse27 (@diff .cse86 .cse2)) (.cse13 (@diff .cse101 .cse2))) (let ((.cse99 (store .cse101 .cse13 0)) (.cse89 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse88 (store .cse86 .cse27 0))) (let ((.cse81 (store .cse1 .cse72 0)) (.cse33 (@diff .cse88 .cse2)) (.cse93 (store .cse89 .cse72 0)) (.cse18 (@diff .cse99 .cse2))) (let ((.cse96 (@diff .cse89 .cse2)) (.cse90 (store .cse99 .cse18 0)) (.cse94 (@diff .cse93 .cse2)) (.cse87 (store .cse88 .cse33 0)) (.cse45 (@diff .cse81 .cse2))) (let ((.cse82 (store .cse81 .cse45 0)) (.cse31 (@diff .cse87 .cse2)) (.cse91 (store .cse93 .cse94 0)) (.cse8 (@diff .cse90 .cse2)) (.cse97 (store .cse89 .cse96 0))) (let ((.cse98 (@diff .cse97 .cse2)) (.cse95 (store .cse90 .cse8 0)) (.cse92 (@diff .cse91 .cse2)) (.cse84 (store .cse87 .cse31 0)) (.cse50 (@diff .cse82 .cse2))) (let ((.cse53 (store .cse82 .cse50 0)) (.cse7 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse38 (@diff .cse84 .cse2)) (.cse20 (= .cse2 .cse1)) (.cse14 (= .cse2 .cse101)) (.cse11 (= .cse2 .cse100)) (.cse0 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse19 (= .cse2 .cse99)) (.cse62 (store .cse91 .cse92 0)) (.cse17 (@diff .cse95 .cse2)) (.cse25 (store .cse97 .cse98 0)) (.cse9 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse3 (or (= .cse2 .cse97) (<= (+ .cse98 28) .cse9))) (.cse5 (= .cse2 .cse25)) (.cse6 (or (<= (+ .cse96 28) .cse9) (= .cse2 .cse89))) (.cse16 (= .cse2 .cse95)) (.cse15 (= .cse2 (store .cse95 .cse17 0))) (.cse54 (= .cse2 .cse62)) (.cse58 (or (= .cse2 .cse93) (<= (+ 28 .cse94) .cse9))) (.cse59 (or (= .cse2 .cse91) (<= (+ 28 .cse92) .cse9))) (.cse41 (or (<= .cse18 .cse0) .cse19)) (.cse10 (= .cse2 .cse90)) (.cse42 (or .cse11 (<= .cse12 .cse0))) (.cse43 (or (<= .cse13 .cse0) .cse14)) (.cse44 (or (<= .cse21 .cse0) .cse20)) (.cse60 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse61 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse4 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse71 (store .cse89 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse32 (= .cse2 .cse88)) (.cse30 (= .cse2 .cse87)) (.cse26 (= .cse2 .cse86)) (.cse39 (= .cse2 .cse84)) (.cse36 (= .cse2 .cse85)) (.cse35 (= .cse2 (store .cse84 .cse38 0))) (.cse29 (= .cse83 .cse2)) (.cse40 (not .cse7)) (.cse47 (= .cse2 .cse53)) (.cse49 (= .cse2 .cse82)) (.cse46 (= .cse2 .cse81)) (.cse34 (= |c_ULTIMATE.start_main_~i~3#1| 0))) (and (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse0) (= .cse1 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (= |c_t_funThread1of1ForFork0_#t~post41#1| 0) (or (and .cse3 .cse4 .cse5 .cse6) .cse7) (or (and (or (<= (+ .cse8 28) .cse9) .cse10) (or .cse11 (<= (+ .cse12 28) .cse9)) (or (<= (+ .cse13 28) .cse9) .cse14) .cse15 (or .cse16 (<= (+ .cse17 28) .cse9)) (or (<= (+ .cse18 28) .cse9) .cse19) (or .cse20 (<= (+ 28 .cse21) .cse9))) .cse7) (or (let ((.cse22 (@diff .cse25 .cse2))) (let ((.cse23 (store .cse25 .cse22 0))) (let ((.cse24 (@diff .cse23 .cse2))) (and .cse3 .cse4 (or (<= (+ .cse22 28) .cse9) .cse5) (= .cse2 (store .cse23 .cse24 0)) (or (= .cse2 .cse23) (<= (+ .cse24 28) .cse9)) .cse6)))) .cse7) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1155 Int)) (and (= .cse1 (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (or (and (or .cse26 (<= (+ .cse27 28) .cse9)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse28 28) .cse9) .cse29) (or .cse30 (<= (+ 28 .cse31) .cse9)) (or .cse32 (<= (+ .cse33 28) .cse9)) .cse34 .cse35 (or .cse36 (<= (+ .cse37 28) .cse9)) (or (<= (+ 28 .cse38) .cse9) .cse39)) .cse40) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse9) (= .cse1 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (and (or .cse16 (<= .cse17 .cse0)) (or .cse10 (<= .cse8 .cse0)) .cse41 .cse15 .cse42 .cse43 .cse44) .cse7) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse9) (or .cse40 (let ((.cse48 (@diff .cse53 .cse2))) (let ((.cse51 (store .cse53 .cse48 0))) (let ((.cse52 (@diff .cse51 .cse2))) (and (or (<= .cse45 .cse0) .cse46) (or .cse47 (<= .cse48 .cse0)) (or .cse49 (<= .cse50 .cse0)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse2 (store .cse51 .cse52 0)) (or (<= .cse52 .cse0) (= .cse2 .cse51)) .cse34))))) (= |c_~#cache~0.offset| 0) (or .cse40 (let ((.cse55 (@diff .cse62 .cse2))) (let ((.cse57 (store .cse62 .cse55 0))) (let ((.cse56 (@diff .cse57 .cse2))) (and (or .cse54 (<= (+ .cse55 28) .cse9)) (or (<= (+ .cse56 28) .cse9) (= .cse2 .cse57)) .cse58 .cse59 (= .cse2 (store .cse57 .cse56 0)) .cse34 .cse60 .cse61))))) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1155 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (= .cse1 (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (and .cse4 .cse54 .cse58 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse59 .cse34) .cse40) (or (and .cse41 .cse10 .cse42 .cse43 .cse44) .cse7) (or .cse40 (let ((.cse69 (store .cse71 .cse72 0))) (let ((.cse70 (@diff .cse69 .cse2))) (let ((.cse63 (store .cse69 .cse70 0))) (let ((.cse64 (@diff .cse63 .cse2))) (let ((.cse67 (store .cse63 .cse64 0))) (let ((.cse68 (@diff .cse67 .cse2))) (let ((.cse65 (store .cse67 .cse68 0))) (let ((.cse66 (@diff .cse65 .cse2))) (and (or (= .cse2 .cse63) (<= (+ .cse64 28) .cse9)) (= .cse2 (store .cse65 .cse66 0)) (or (= .cse2 .cse67) (<= (+ .cse68 28) .cse9)) (or (= .cse2 .cse69) (<= (+ .cse70 28) .cse9)) (or (<= (+ 28 .cse66) .cse9) (= .cse2 .cse65)) .cse34 .cse60 .cse61)))))))))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse73 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse73)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< .cse9 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) (< (+ |c_~#cache~0.offset| .cse73) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647)))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (and (or .cse11 (<= .cse12 |c_~#cache~0.offset|)) .cse14 (or (<= .cse21 |c_~#cache~0.offset|) .cse20)) .cse7) (or (let ((.cse74 (@diff .cse71 .cse2))) (let ((.cse80 (store .cse71 .cse74 0))) (let ((.cse79 (@diff .cse80 .cse2))) (let ((.cse75 (store .cse80 .cse79 0))) (let ((.cse76 (@diff .cse75 .cse2))) (let ((.cse78 (store .cse75 .cse76 0))) (let ((.cse77 (@diff .cse78 .cse2))) (and (or (<= (+ .cse74 28) .cse9) (= .cse2 .cse71)) .cse4 (or (= .cse2 .cse75) (<= (+ .cse76 28) .cse9)) (or (<= (+ 28 .cse77) .cse9) (= .cse2 .cse78)) (= .cse2 (store .cse78 .cse77 0)) (or (<= (+ 28 .cse79) .cse9) (= .cse2 .cse80)))))))))) .cse7) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse9) (= .cse1 (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse9) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse9))) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse0) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse0) (= .cse1 (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse0))) (or .cse40 (and (or .cse32 (<= .cse33 .cse0)) (or (<= .cse31 .cse0) .cse30) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse26 (<= .cse27 .cse0)) (or .cse39 (<= .cse38 .cse0)) (or (<= .cse37 .cse0) .cse36) .cse34 .cse35 (or (<= .cse28 .cse0) .cse29))) (or .cse40 (and .cse47 (or (<= .cse50 |c_~#cache~0.offset|) .cse49) (or (<= .cse45 |c_~#cache~0.offset|) .cse46) .cse34)) (= |c_~#cache~0.base| 3)))))))))))))))) is different from true [2022-11-15 14:32:58,513 WARN L233 SmtUtils]: Spent 8.73s on a formula simplification. DAG size of input: 180 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-15 14:33:00,995 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse80 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse67 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse80 0)) (.cse2 ((as const (Array Int Int)) 0))) (let ((.cse68 (@diff .cse67 .cse2))) (let ((.cse72 (store .cse67 .cse68 0))) (let ((.cse52 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse71 (@diff .cse72 .cse2))) (let ((.cse74 (store .cse72 .cse71 0)) (.cse79 (@diff .cse52 .cse2))) (let ((.cse78 (store .cse52 .cse79 0)) (.cse73 (@diff .cse74 .cse2))) (let ((.cse70 (store .cse74 .cse73 0)) (.cse77 (@diff .cse78 .cse2))) (let ((.cse58 (store .cse52 .cse80 0)) (.cse61 (store .cse78 .cse77 0)) (.cse69 (@diff .cse70 .cse2))) (let ((.cse76 (store .cse70 .cse69 0)) (.cse64 (@diff .cse61 .cse2)) (.cse57 (@diff .cse58 .cse2))) (let ((.cse60 (store .cse58 .cse57 0)) (.cse63 (store .cse61 .cse64 0)) (.cse75 (@diff .cse76 .cse2))) (let ((.cse65 (store .cse76 .cse75 0)) (.cse62 (@diff .cse63 .cse2)) (.cse59 (@diff .cse60 .cse2))) (let ((.cse56 (store .cse60 .cse59 0)) (.cse14 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse39 (= .cse2 .cse52)) (.cse38 (+ .cse79 28)) (.cse43 (= .cse2 .cse78)) (.cse42 (+ .cse77 28)) (.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse47 (store .cse63 .cse62 0)) (.cse66 (@diff .cse65 .cse2))) (let ((.cse32 (+ 28 .cse66)) (.cse33 (= .cse2 .cse65)) (.cse25 (= .cse2 .cse76)) (.cse26 (+ 28 .cse75)) (.cse21 (= .cse2 .cse74)) (.cse22 (+ .cse73 28)) (.cse30 (= .cse2 .cse72)) (.cse31 (+ .cse71 28)) (.cse27 (= .cse2 .cse70)) (.cse28 (+ .cse69 28)) (.cse23 (+ .cse68 28)) (.cse24 (= .cse67 .cse2)) (.cse29 (= .cse2 (store .cse65 .cse66 0))) (.cse34 (= .cse2 .cse47)) (.cse45 (+ .cse64 28)) (.cse36 (= .cse63 .cse2)) (.cse37 (+ .cse62 28)) (.cse12 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse15 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse46 (= .cse61 .cse2)) (.cse48 (or .cse43 (<= .cse42 .cse1))) (.cse49 (or .cse39 (<= .cse38 .cse1))) (.cse20 (not .cse14)) (.cse19 (= .cse2 .cse56)) (.cse16 (or (<= (+ .cse59 28) .cse1) (= .cse60 .cse2))) (.cse17 (or (<= (+ .cse57 28) .cse1) (= .cse2 .cse58))) (.cse18 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse44 (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (or (let ((.cse13 (@diff .cse12 .cse2))) (let ((.cse4 (store .cse12 .cse13 0))) (let ((.cse5 (@diff .cse4 .cse2))) (let ((.cse7 (store .cse4 .cse5 0))) (let ((.cse6 (@diff .cse7 .cse2))) (let ((.cse11 (store .cse7 .cse6 0))) (let ((.cse10 (@diff .cse11 .cse2))) (let ((.cse3 (store .cse11 .cse10 0))) (let ((.cse0 (@diff .cse3 .cse2))) (let ((.cse8 (store .cse3 .cse0 0))) (let ((.cse9 (@diff .cse8 .cse2))) (and (or (<= (+ .cse0 28) .cse1) (= .cse2 .cse3)) (or (= .cse2 .cse4) (<= (+ .cse5 28) .cse1)) (or (<= (+ .cse6 28) .cse1) (= .cse2 .cse7)) (= .cse2 (store .cse8 .cse9 0)) (or (= .cse2 .cse8) (<= (+ .cse9 28) .cse1)) (or (<= (+ .cse10 28) .cse1) (= .cse2 .cse11)) (or (= .cse2 .cse12) (<= (+ 28 .cse13) .cse1)))))))))))))) .cse14) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) .cse15 (or (and .cse15 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse16 .cse17 .cse18 .cse19) .cse20) (or (and (or .cse21 (<= .cse22 .cse1)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= .cse23 .cse1) .cse24) (or .cse25 (<= .cse26 .cse1)) (or .cse27 (<= .cse28 .cse1)) .cse18 .cse29 (or .cse30 (<= .cse31 .cse1)) (or (<= .cse32 .cse1) .cse33)) .cse20) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse1) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse1) (= .cse12 (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |c_~#cache~0.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1155 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= .cse12 (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse35 (@diff .cse47 .cse2))) (let ((.cse41 (store .cse47 .cse35 0))) (let ((.cse40 (@diff .cse41 .cse2))) (and (or .cse34 (<= (+ .cse35 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse36 (<= .cse37 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse38 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse39) (or (<= (+ .cse40 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= .cse2 .cse41)) (or (<= .cse42 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse43) (= .cse2 (store .cse41 .cse40 0)) (not .cse44) (or (<= .cse45 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse46))))) (and (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (or (<= .cse32 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse33) (or .cse25 (<= .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse21 (<= .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse30 (<= .cse31 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse27 (<= .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse24) .cse18 .cse29 .cse44)) (or (and .cse15 .cse34 .cse48 .cse49 (or (<= .cse45 .cse1) .cse46) (or .cse36 (<= .cse37 .cse1))) .cse14) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse1) (= .cse12 (store (store (store .cse2 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse1) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse1))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse50 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse50)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (+ |c_~#cache~0.offset| .cse50) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< (select (select (store (let ((.cse51 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse52 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158)))) (store .cse51 |c_~#cache~0.base| (store (select .cse51 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647)))) (= |c_~#cache~0.base| 3) (or (and .cse15 .cse46 .cse48 .cse49) .cse14) (or .cse20 (let ((.cse53 (@diff .cse56 .cse2))) (let ((.cse55 (store .cse56 .cse53 0))) (let ((.cse54 (@diff .cse55 .cse2))) (and (or .cse19 (<= (+ .cse53 28) .cse1)) .cse16 .cse17 (or (<= (+ .cse54 28) .cse1) (= .cse2 .cse55)) (= .cse2 (store .cse55 .cse54 0)) .cse18 .cse44 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))))))))))))))))))) is different from true [2022-11-15 14:33:03,067 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse41 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse8 ((as const (Array Int Int)) 0))) (let ((.cse56 (@diff .cse41 .cse8))) (let ((.cse55 (store .cse41 .cse56 0))) (let ((.cse54 (@diff .cse55 .cse8)) (.cse35 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse47 (store .cse41 .cse35 0)) (.cse50 (store .cse55 .cse54 0))) (let ((.cse53 (@diff .cse50 .cse8)) (.cse46 (@diff .cse47 .cse8))) (let ((.cse49 (store .cse47 .cse46 0)) (.cse52 (store .cse50 .cse53 0))) (let ((.cse51 (@diff .cse52 .cse8)) (.cse48 (@diff .cse49 .cse8))) (let ((.cse45 (store .cse49 .cse48 0)) (.cse38 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse14 (= .cse8 .cse41)) (.cse13 (+ .cse56 28)) (.cse18 (= .cse8 .cse55)) (.cse17 (+ .cse54 28)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse22 (store .cse52 .cse51 0))) (let ((.cse7 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse9 (= .cse8 .cse22)) (.cse20 (+ .cse53 28)) (.cse11 (= .cse52 .cse8)) (.cse12 (+ .cse51 28)) (.cse0 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse21 (= .cse50 .cse8)) (.cse36 (or .cse18 (<= .cse17 .cse6))) (.cse37 (or .cse14 (<= .cse13 .cse6))) (.cse5 (not .cse38)) (.cse4 (= .cse8 .cse45)) (.cse1 (or (<= (+ .cse48 28) .cse6) (= .cse49 .cse8))) (.cse2 (or (<= (+ .cse46 28) .cse6) (= .cse8 .cse47))) (.cse3 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse19 (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) .cse0 (or (and .cse0 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse1 .cse2 .cse3 .cse4) .cse5) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse6) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse6) (= .cse7 (store (store .cse8 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= |c_~#cache~0.offset| 0) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1155 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (= .cse7 (store .cse8 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1155)))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse8 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse10 (@diff .cse22 .cse8))) (let ((.cse16 (store .cse22 .cse10 0))) (let ((.cse15 (@diff .cse16 .cse8))) (and (or .cse9 (<= (+ .cse10 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse11 (<= .cse12 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse13 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse14) (or (<= (+ .cse15 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= .cse8 .cse16)) (or (<= .cse17 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse18) (= .cse8 (store .cse16 .cse15 0)) (not .cse19) (or (<= .cse20 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse21))))) (let ((.cse34 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse35 0))) (let ((.cse33 (@diff .cse34 .cse8))) (let ((.cse29 (store .cse34 .cse33 0))) (let ((.cse30 (@diff .cse29 .cse8))) (let ((.cse27 (store .cse29 .cse30 0))) (let ((.cse28 (@diff .cse27 .cse8))) (let ((.cse31 (store .cse27 .cse28 0))) (let ((.cse32 (@diff .cse31 .cse8))) (let ((.cse25 (store .cse31 .cse32 0))) (let ((.cse26 (@diff .cse25 .cse8))) (let ((.cse24 (store .cse25 .cse26 0))) (let ((.cse23 (@diff .cse24 .cse8))) (and (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (or (<= (+ 28 .cse23) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= .cse8 .cse24)) (or (= .cse8 .cse25) (<= (+ 28 .cse26) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (= .cse8 .cse27) (<= (+ .cse28 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (= .cse8 .cse29) (<= (+ .cse30 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (= .cse8 .cse31) (<= (+ .cse32 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= (+ .cse33 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= .cse34 .cse8)) .cse3 (= .cse8 (store .cse24 .cse23 0)) .cse19)))))))))))))) (or (and .cse0 .cse9 .cse36 .cse37 (or (<= .cse20 .cse6) .cse21) (or .cse11 (<= .cse12 .cse6))) .cse38) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse39 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse39)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (+ |c_~#cache~0.offset| .cse39) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) (< (select (select (store (let ((.cse40 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse41 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| v_ArrVal_1158)))) (store .cse40 |c_~#cache~0.base| (store (select .cse40 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647)))) (= |c_~#cache~0.base| 3) (or (and .cse0 .cse21 .cse36 .cse37) .cse38) (or .cse5 (let ((.cse42 (@diff .cse45 .cse8))) (let ((.cse44 (store .cse45 .cse42 0))) (let ((.cse43 (@diff .cse44 .cse8))) (and (or .cse4 (<= (+ .cse42 28) .cse6)) .cse1 .cse2 (or (<= (+ .cse43 28) .cse6) (= .cse8 .cse44)) (= .cse8 (store .cse44 .cse43 0)) .cse3 .cse19 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))))))))))))))) is different from true [2022-11-15 14:33:13,187 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse67 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse37 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse70 (store .cse67 .cse37 0)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse72 (@diff .cse67 .cse7)) (.cse71 (@diff .cse70 .cse7))) (let ((.cse68 (store .cse70 .cse71 0)) (.cse73 (store .cse67 .cse72 0))) (let ((.cse74 (@diff .cse73 .cse7)) (.cse69 (@diff .cse68 .cse7))) (let ((.cse4 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse50 (store .cse68 .cse69 0)) (.cse40 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse22 (store .cse73 .cse74 0)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse0 (or (= .cse7 .cse73) (<= (+ .cse74 28) .cse6))) (.cse2 (= .cse7 .cse22)) (.cse3 (or (<= (+ .cse72 28) .cse6) (= .cse7 .cse67))) (.cse39 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse41 (= (select .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse42 (and (not .cse40) (= (select .cse67 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse43 (= .cse7 .cse50)) (.cse47 (or (= .cse7 .cse70) (<= (+ 28 .cse71) .cse6))) (.cse48 (or (= .cse7 .cse68) (<= (+ 28 .cse69) .cse6))) (.cse38 (not .cse4)) (.cse31 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse49 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse59 (store .cse67 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse17 (select |c_#memory_int| |c_~#cache~0.base|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4) (or (let ((.cse18 (@diff .cse17 .cse7))) (let ((.cse9 (store .cse17 .cse18 0))) (let ((.cse10 (@diff .cse9 .cse7))) (let ((.cse12 (store .cse9 .cse10 0))) (let ((.cse11 (@diff .cse12 .cse7))) (let ((.cse16 (store .cse12 .cse11 0))) (let ((.cse15 (@diff .cse16 .cse7))) (let ((.cse8 (store .cse16 .cse15 0))) (let ((.cse5 (@diff .cse8 .cse7))) (let ((.cse13 (store .cse8 .cse5 0))) (let ((.cse14 (@diff .cse13 .cse7))) (and (or (<= (+ .cse5 28) .cse6) (= .cse7 .cse8)) (or (= .cse7 .cse9) (<= (+ .cse10 28) .cse6)) (or (<= (+ .cse11 28) .cse6) (= .cse7 .cse12)) (= .cse7 (store .cse13 .cse14 0)) (or (= .cse7 .cse13) (<= (+ .cse14 28) .cse6)) (or (<= (+ .cse15 28) .cse6) (= .cse7 .cse16)) (or (= .cse7 .cse17) (<= (+ 28 .cse18) .cse6)))))))))))))) .cse4) (or (let ((.cse19 (@diff .cse22 .cse7))) (let ((.cse20 (store .cse22 .cse19 0))) (let ((.cse21 (@diff .cse20 .cse7))) (and .cse0 .cse1 (or (<= (+ .cse19 28) .cse6) .cse2) (= .cse7 (store .cse20 .cse21 0)) (or (= .cse7 .cse20) (<= (+ .cse21 28) .cse6)) .cse3)))) .cse4) (or (let ((.cse26 (store .cse36 .cse37 0))) (let ((.cse25 (@diff .cse26 .cse7))) (let ((.cse34 (store .cse26 .cse25 0))) (let ((.cse35 (@diff .cse34 .cse7))) (let ((.cse23 (store .cse34 .cse35 0))) (let ((.cse24 (@diff .cse23 .cse7))) (let ((.cse29 (store .cse23 .cse24 0))) (let ((.cse30 (@diff .cse29 .cse7))) (let ((.cse27 (store .cse29 .cse30 0))) (let ((.cse28 (@diff .cse27 .cse7))) (let ((.cse32 (store .cse27 .cse28 0))) (let ((.cse33 (@diff .cse32 .cse7))) (and (or (= .cse7 .cse23) (<= (+ .cse24 28) .cse6)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse25 28) .cse6) (= .cse26 .cse7)) (or (= .cse7 .cse27) (<= (+ 28 .cse28) .cse6)) (or (= .cse7 .cse29) (<= (+ .cse30 28) .cse6)) .cse31 (= .cse7 (store .cse32 .cse33 0)) (or (= .cse7 .cse34) (<= (+ .cse35 28) .cse6)) (or (<= (+ 28 .cse33) .cse6) (= .cse7 .cse32))))))))))))))) .cse38) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse1 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse6) (= .cse17 (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (and .cse39 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse40 .cse41) .cse42) (or (and .cse39 .cse31 .cse40 .cse41) .cse42) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_1163)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (= |c_~#cache~0.offset| 0) (or .cse38 (let ((.cse44 (@diff .cse50 .cse7))) (let ((.cse46 (store .cse50 .cse44 0))) (let ((.cse45 (@diff .cse46 .cse7))) (and (or .cse43 (<= (+ .cse44 28) .cse6)) (or (<= (+ .cse45 28) .cse6) (= .cse7 .cse46)) .cse47 .cse48 (= .cse7 (store .cse46 .cse45 0)) .cse31 .cse40 .cse49))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (and .cse1 .cse43 .cse47 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse48 .cse31) .cse38) (or .cse38 (let ((.cse57 (store .cse59 .cse37 0))) (let ((.cse58 (@diff .cse57 .cse7))) (let ((.cse51 (store .cse57 .cse58 0))) (let ((.cse52 (@diff .cse51 .cse7))) (let ((.cse55 (store .cse51 .cse52 0))) (let ((.cse56 (@diff .cse55 .cse7))) (let ((.cse53 (store .cse55 .cse56 0))) (let ((.cse54 (@diff .cse53 .cse7))) (and (or (= .cse7 .cse51) (<= (+ .cse52 28) .cse6)) (= .cse7 (store .cse53 .cse54 0)) (or (= .cse7 .cse55) (<= (+ .cse56 28) .cse6)) (or (= .cse7 .cse57) (<= (+ .cse58 28) .cse6)) (or (<= (+ 28 .cse54) .cse6) (= .cse7 .cse53)) .cse31 .cse40 .cse49)))))))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (= .cse17 (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse6) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse6))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse60 (@diff .cse59 .cse7))) (let ((.cse66 (store .cse59 .cse60 0))) (let ((.cse65 (@diff .cse66 .cse7))) (let ((.cse61 (store .cse66 .cse65 0))) (let ((.cse62 (@diff .cse61 .cse7))) (let ((.cse64 (store .cse61 .cse62 0))) (let ((.cse63 (@diff .cse64 .cse7))) (and (or (<= (+ .cse60 28) .cse6) (= .cse7 .cse59)) .cse1 (or (= .cse7 .cse61) (<= (+ .cse62 28) .cse6)) (or (<= (+ 28 .cse63) .cse6) (= .cse7 .cse64)) (= .cse7 (store .cse64 .cse63 0)) (or (<= (+ 28 .cse65) .cse6) (= .cse7 .cse66)))))))))) .cse4) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (= .cse17 (store (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse6) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse6))) (= |c_~#cache~0.base| 3))))))))) is different from true [2022-11-15 14:33:15,399 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse62 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse37 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse72 (store .cse62 .cse37 0)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse74 (@diff .cse62 .cse7)) (.cse73 (@diff .cse72 .cse7))) (let ((.cse70 (store .cse72 .cse73 0)) (.cse75 (store .cse62 .cse74 0))) (let ((.cse76 (@diff .cse75 .cse7)) (.cse71 (@diff .cse70 .cse7))) (let ((.cse4 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse50 (store .cse70 .cse71 0)) (.cse40 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse36 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse22 (store .cse75 .cse76 0)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse0 (or (= .cse7 .cse75) (<= (+ .cse76 28) .cse6))) (.cse2 (= .cse7 .cse22)) (.cse3 (or (<= (+ .cse74 28) .cse6) (= .cse7 .cse62))) (.cse39 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse41 (= (select .cse36 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse42 (and (not .cse40) (= (select .cse62 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse43 (= .cse7 .cse50)) (.cse47 (or (= .cse7 .cse72) (<= (+ 28 .cse73) .cse6))) (.cse48 (or (= .cse7 .cse70) (<= (+ 28 .cse71) .cse6))) (.cse38 (not .cse4)) (.cse31 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse49 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse59 (store .cse62 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse17 (select |c_#memory_int| |c_~#cache~0.base|))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4) (or (let ((.cse18 (@diff .cse17 .cse7))) (let ((.cse9 (store .cse17 .cse18 0))) (let ((.cse10 (@diff .cse9 .cse7))) (let ((.cse12 (store .cse9 .cse10 0))) (let ((.cse11 (@diff .cse12 .cse7))) (let ((.cse16 (store .cse12 .cse11 0))) (let ((.cse15 (@diff .cse16 .cse7))) (let ((.cse8 (store .cse16 .cse15 0))) (let ((.cse5 (@diff .cse8 .cse7))) (let ((.cse13 (store .cse8 .cse5 0))) (let ((.cse14 (@diff .cse13 .cse7))) (and (or (<= (+ .cse5 28) .cse6) (= .cse7 .cse8)) (or (= .cse7 .cse9) (<= (+ .cse10 28) .cse6)) (or (<= (+ .cse11 28) .cse6) (= .cse7 .cse12)) (= .cse7 (store .cse13 .cse14 0)) (or (= .cse7 .cse13) (<= (+ .cse14 28) .cse6)) (or (<= (+ .cse15 28) .cse6) (= .cse7 .cse16)) (or (= .cse7 .cse17) (<= (+ 28 .cse18) .cse6)))))))))))))) .cse4) (or (let ((.cse19 (@diff .cse22 .cse7))) (let ((.cse20 (store .cse22 .cse19 0))) (let ((.cse21 (@diff .cse20 .cse7))) (and .cse0 .cse1 (or (<= (+ .cse19 28) .cse6) .cse2) (= .cse7 (store .cse20 .cse21 0)) (or (= .cse7 .cse20) (<= (+ .cse21 28) .cse6)) .cse3)))) .cse4) (or (let ((.cse26 (store .cse36 .cse37 0))) (let ((.cse25 (@diff .cse26 .cse7))) (let ((.cse34 (store .cse26 .cse25 0))) (let ((.cse35 (@diff .cse34 .cse7))) (let ((.cse23 (store .cse34 .cse35 0))) (let ((.cse24 (@diff .cse23 .cse7))) (let ((.cse29 (store .cse23 .cse24 0))) (let ((.cse30 (@diff .cse29 .cse7))) (let ((.cse27 (store .cse29 .cse30 0))) (let ((.cse28 (@diff .cse27 .cse7))) (let ((.cse32 (store .cse27 .cse28 0))) (let ((.cse33 (@diff .cse32 .cse7))) (and (or (= .cse7 .cse23) (<= (+ .cse24 28) .cse6)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse25 28) .cse6) (= .cse26 .cse7)) (or (= .cse7 .cse27) (<= (+ 28 .cse28) .cse6)) (or (= .cse7 .cse29) (<= (+ .cse30 28) .cse6)) .cse31 (= .cse7 (store .cse32 .cse33 0)) (or (= .cse7 .cse34) (<= (+ .cse35 28) .cse6)) (or (<= (+ 28 .cse33) .cse6) (= .cse7 .cse32))))))))))))))) .cse38) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse1 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse6) (= .cse17 (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (and .cse39 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse40 .cse41) .cse42) (or (and .cse39 .cse31 .cse40 .cse41) .cse42) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| v_ArrVal_1163)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (= |c_~#cache~0.offset| 0) (or .cse38 (let ((.cse44 (@diff .cse50 .cse7))) (let ((.cse46 (store .cse50 .cse44 0))) (let ((.cse45 (@diff .cse46 .cse7))) (and (or .cse43 (<= (+ .cse44 28) .cse6)) (or (<= (+ .cse45 28) .cse6) (= .cse7 .cse46)) .cse47 .cse48 (= .cse7 (store .cse46 .cse45 0)) .cse31 .cse40 .cse49))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (and .cse1 .cse43 .cse47 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse48 .cse31) .cse38) (or .cse38 (let ((.cse57 (store .cse59 .cse37 0))) (let ((.cse58 (@diff .cse57 .cse7))) (let ((.cse51 (store .cse57 .cse58 0))) (let ((.cse52 (@diff .cse51 .cse7))) (let ((.cse55 (store .cse51 .cse52 0))) (let ((.cse56 (@diff .cse55 .cse7))) (let ((.cse53 (store .cse55 .cse56 0))) (let ((.cse54 (@diff .cse53 .cse7))) (and (or (= .cse7 .cse51) (<= (+ .cse52 28) .cse6)) (= .cse7 (store .cse53 .cse54 0)) (or (= .cse7 .cse55) (<= (+ .cse56 28) .cse6)) (or (= .cse7 .cse57) (<= (+ .cse58 28) .cse6)) (or (<= (+ 28 .cse54) .cse6) (= .cse7 .cse53)) .cse31 .cse40 .cse49)))))))))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse60 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse60)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (select (select (store (let ((.cse61 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse62 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)))) (store .cse61 |c_~#cache~0.base| (store (select .cse61 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< (+ |c_~#cache~0.offset| .cse60) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|)))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (= .cse17 (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse6) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse6))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse63 (@diff .cse59 .cse7))) (let ((.cse69 (store .cse59 .cse63 0))) (let ((.cse68 (@diff .cse69 .cse7))) (let ((.cse64 (store .cse69 .cse68 0))) (let ((.cse65 (@diff .cse64 .cse7))) (let ((.cse67 (store .cse64 .cse65 0))) (let ((.cse66 (@diff .cse67 .cse7))) (and (or (<= (+ .cse63 28) .cse6) (= .cse7 .cse59)) .cse1 (or (= .cse7 .cse64) (<= (+ .cse65 28) .cse6)) (or (<= (+ 28 .cse66) .cse6) (= .cse7 .cse67)) (= .cse7 (store .cse67 .cse66 0)) (or (<= (+ 28 .cse68) .cse6) (= .cse7 .cse69)))))))))) .cse4) (exists ((v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1158 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse6) (= .cse17 (store (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1163)) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 84) .cse6) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|) .cse6))) (= |c_~#cache~0.base| 3))))))))) is different from true [2022-11-15 14:33:28,676 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse58 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse36 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse68 (store .cse58 .cse36 0)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse70 (@diff .cse58 .cse7)) (.cse69 (@diff .cse68 .cse7))) (let ((.cse66 (store .cse68 .cse69 0)) (.cse71 (store .cse58 .cse70 0))) (let ((.cse72 (@diff .cse71 .cse7)) (.cse67 (@diff .cse66 .cse7))) (let ((.cse4 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse46 (store .cse66 .cse67 0)) (.cse22 (store .cse71 .cse72 0)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse0 (or (= .cse7 .cse71) (<= (+ .cse72 28) .cse6))) (.cse2 (= .cse7 .cse22)) (.cse3 (or (<= (+ .cse70 28) .cse6) (= .cse7 .cse58))) (.cse38 (= .cse7 .cse46)) (.cse42 (or (= .cse7 .cse68) (<= (+ 28 .cse69) .cse6))) (.cse43 (or (= .cse7 .cse66) (<= (+ 28 .cse67) .cse6))) (.cse37 (not .cse4)) (.cse31 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse44 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse45 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse17 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse55 (store .cse58 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4) (or (let ((.cse18 (@diff .cse17 .cse7))) (let ((.cse9 (store .cse17 .cse18 0))) (let ((.cse10 (@diff .cse9 .cse7))) (let ((.cse12 (store .cse9 .cse10 0))) (let ((.cse11 (@diff .cse12 .cse7))) (let ((.cse16 (store .cse12 .cse11 0))) (let ((.cse15 (@diff .cse16 .cse7))) (let ((.cse8 (store .cse16 .cse15 0))) (let ((.cse5 (@diff .cse8 .cse7))) (let ((.cse13 (store .cse8 .cse5 0))) (let ((.cse14 (@diff .cse13 .cse7))) (and (or (<= (+ .cse5 28) .cse6) (= .cse7 .cse8)) (or (= .cse7 .cse9) (<= (+ .cse10 28) .cse6)) (or (<= (+ .cse11 28) .cse6) (= .cse7 .cse12)) (= .cse7 (store .cse13 .cse14 0)) (or (= .cse7 .cse13) (<= (+ .cse14 28) .cse6)) (or (<= (+ .cse15 28) .cse6) (= .cse7 .cse16)) (or (= .cse7 .cse17) (<= (+ 28 .cse18) .cse6)))))))))))))) .cse4) (or (let ((.cse19 (@diff .cse22 .cse7))) (let ((.cse20 (store .cse22 .cse19 0))) (let ((.cse21 (@diff .cse20 .cse7))) (and .cse0 .cse1 (or (<= (+ .cse19 28) .cse6) .cse2) (= .cse7 (store .cse20 .cse21 0)) (or (= .cse7 .cse20) (<= (+ .cse21 28) .cse6)) .cse3)))) .cse4) (or (let ((.cse26 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse36 0))) (let ((.cse25 (@diff .cse26 .cse7))) (let ((.cse34 (store .cse26 .cse25 0))) (let ((.cse35 (@diff .cse34 .cse7))) (let ((.cse23 (store .cse34 .cse35 0))) (let ((.cse24 (@diff .cse23 .cse7))) (let ((.cse29 (store .cse23 .cse24 0))) (let ((.cse30 (@diff .cse29 .cse7))) (let ((.cse27 (store .cse29 .cse30 0))) (let ((.cse28 (@diff .cse27 .cse7))) (let ((.cse32 (store .cse27 .cse28 0))) (let ((.cse33 (@diff .cse32 .cse7))) (and (or (= .cse7 .cse23) (<= (+ .cse24 28) .cse6)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse25 28) .cse6) (= .cse26 .cse7)) (or (= .cse7 .cse27) (<= (+ 28 .cse28) .cse6)) (or (= .cse7 .cse29) (<= (+ .cse30 28) .cse6)) .cse31 (= .cse7 (store .cse32 .cse33 0)) (or (= .cse7 .cse34) (<= (+ .cse35 28) .cse6)) (or (<= (+ 28 .cse33) .cse6) (= .cse7 .cse32))))))))))))))) .cse37) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse1 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse6) (= .cse17 (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| 0) (or .cse37 (let ((.cse39 (@diff .cse46 .cse7))) (let ((.cse41 (store .cse46 .cse39 0))) (let ((.cse40 (@diff .cse41 .cse7))) (and (or .cse38 (<= (+ .cse39 28) .cse6)) (or (<= (+ .cse40 28) .cse6) (= .cse7 .cse41)) .cse42 .cse43 (= .cse7 (store .cse41 .cse40 0)) .cse31 .cse44 .cse45))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (and .cse1 .cse38 .cse42 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse43 .cse31) .cse37) (or .cse37 (let ((.cse53 (store .cse55 .cse36 0))) (let ((.cse54 (@diff .cse53 .cse7))) (let ((.cse47 (store .cse53 .cse54 0))) (let ((.cse48 (@diff .cse47 .cse7))) (let ((.cse51 (store .cse47 .cse48 0))) (let ((.cse52 (@diff .cse51 .cse7))) (let ((.cse49 (store .cse51 .cse52 0))) (let ((.cse50 (@diff .cse49 .cse7))) (and (or (= .cse7 .cse47) (<= (+ .cse48 28) .cse6)) (= .cse7 (store .cse49 .cse50 0)) (or (= .cse7 .cse51) (<= (+ .cse52 28) .cse6)) (or (= .cse7 .cse53) (<= (+ .cse54 28) .cse6)) (or (<= (+ 28 .cse50) .cse6) (= .cse7 .cse49)) .cse31 .cse44 .cse45)))))))))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (v_ArrVal_1163 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| Int) (v_ArrVal_1158 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (v_ArrVal_1164 (Array Int Int))) (let ((.cse56 (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55| (+ 28 |c_~#cache~0.offset| .cse56)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (select (select (store (let ((.cse57 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse58 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1158)))) (store .cse57 |c_~#cache~0.base| (store (select .cse57 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1163))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1164) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_55|) 2147483647) (< (+ |c_~#cache~0.offset| .cse56) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|)))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (= .cse17 (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse6) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse6))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 0) (or (let ((.cse59 (@diff .cse55 .cse7))) (let ((.cse65 (store .cse55 .cse59 0))) (let ((.cse64 (@diff .cse65 .cse7))) (let ((.cse60 (store .cse65 .cse64 0))) (let ((.cse61 (@diff .cse60 .cse7))) (let ((.cse63 (store .cse60 .cse61 0))) (let ((.cse62 (@diff .cse63 .cse7))) (and (or (<= (+ .cse59 28) .cse6) (= .cse7 .cse55)) .cse1 (or (= .cse7 .cse60) (<= (+ .cse61 28) .cse6)) (or (<= (+ 28 .cse62) .cse6) (= .cse7 .cse63)) (= .cse7 (store .cse63 .cse62 0)) (or (<= (+ 28 .cse64) .cse6) (= .cse7 .cse65)))))))))) .cse4) (= |c_~#cache~0.base| 3))))))))) is different from true [2022-11-15 14:33:30,792 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse63 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse36 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse66 (store .cse63 .cse36 0)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse68 (@diff .cse63 .cse7)) (.cse67 (@diff .cse66 .cse7))) (let ((.cse64 (store .cse66 .cse67 0)) (.cse69 (store .cse63 .cse68 0))) (let ((.cse70 (@diff .cse69 .cse7)) (.cse65 (@diff .cse64 .cse7))) (let ((.cse4 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse46 (store .cse64 .cse65 0)) (.cse22 (store .cse69 .cse70 0)) (.cse6 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse0 (or (= .cse7 .cse69) (<= (+ .cse70 28) .cse6))) (.cse2 (= .cse7 .cse22)) (.cse3 (or (<= (+ .cse68 28) .cse6) (= .cse7 .cse63))) (.cse38 (= .cse7 .cse46)) (.cse42 (or (= .cse7 .cse66) (<= (+ 28 .cse67) .cse6))) (.cse43 (or (= .cse7 .cse64) (<= (+ 28 .cse65) .cse6))) (.cse37 (not .cse4)) (.cse31 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse44 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse45 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse17 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse55 (store .cse63 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4) (or (let ((.cse18 (@diff .cse17 .cse7))) (let ((.cse9 (store .cse17 .cse18 0))) (let ((.cse10 (@diff .cse9 .cse7))) (let ((.cse12 (store .cse9 .cse10 0))) (let ((.cse11 (@diff .cse12 .cse7))) (let ((.cse16 (store .cse12 .cse11 0))) (let ((.cse15 (@diff .cse16 .cse7))) (let ((.cse8 (store .cse16 .cse15 0))) (let ((.cse5 (@diff .cse8 .cse7))) (let ((.cse13 (store .cse8 .cse5 0))) (let ((.cse14 (@diff .cse13 .cse7))) (and (or (<= (+ .cse5 28) .cse6) (= .cse7 .cse8)) (or (= .cse7 .cse9) (<= (+ .cse10 28) .cse6)) (or (<= (+ .cse11 28) .cse6) (= .cse7 .cse12)) (= .cse7 (store .cse13 .cse14 0)) (or (= .cse7 .cse13) (<= (+ .cse14 28) .cse6)) (or (<= (+ .cse15 28) .cse6) (= .cse7 .cse16)) (or (= .cse7 .cse17) (<= (+ 28 .cse18) .cse6)))))))))))))) .cse4) (or (let ((.cse19 (@diff .cse22 .cse7))) (let ((.cse20 (store .cse22 .cse19 0))) (let ((.cse21 (@diff .cse20 .cse7))) (and .cse0 .cse1 (or (<= (+ .cse19 28) .cse6) .cse2) (= .cse7 (store .cse20 .cse21 0)) (or (= .cse7 .cse20) (<= (+ .cse21 28) .cse6)) .cse3)))) .cse4) (or (let ((.cse26 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse36 0))) (let ((.cse25 (@diff .cse26 .cse7))) (let ((.cse34 (store .cse26 .cse25 0))) (let ((.cse35 (@diff .cse34 .cse7))) (let ((.cse23 (store .cse34 .cse35 0))) (let ((.cse24 (@diff .cse23 .cse7))) (let ((.cse29 (store .cse23 .cse24 0))) (let ((.cse30 (@diff .cse29 .cse7))) (let ((.cse27 (store .cse29 .cse30 0))) (let ((.cse28 (@diff .cse27 .cse7))) (let ((.cse32 (store .cse27 .cse28 0))) (let ((.cse33 (@diff .cse32 .cse7))) (and (or (= .cse7 .cse23) (<= (+ .cse24 28) .cse6)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse25 28) .cse6) (= .cse26 .cse7)) (or (= .cse7 .cse27) (<= (+ 28 .cse28) .cse6)) (or (= .cse7 .cse29) (<= (+ .cse30 28) .cse6)) .cse31 (= .cse7 (store .cse32 .cse33 0)) (or (= .cse7 .cse34) (<= (+ .cse35 28) .cse6)) (or (<= (+ 28 .cse33) .cse6) (= .cse7 .cse32))))))))))))))) .cse37) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) .cse1 (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 28) .cse6) (= .cse17 (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155)))) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse6) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| 0) (or .cse37 (let ((.cse39 (@diff .cse46 .cse7))) (let ((.cse41 (store .cse46 .cse39 0))) (let ((.cse40 (@diff .cse41 .cse7))) (and (or .cse38 (<= (+ .cse39 28) .cse6)) (or (<= (+ .cse40 28) .cse6) (= .cse7 .cse41)) .cse42 .cse43 (= .cse7 (store .cse41 .cse40 0)) .cse31 .cse44 .cse45))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (and .cse1 .cse38 .cse42 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse43 .cse31) .cse37) (or .cse37 (let ((.cse53 (store .cse55 .cse36 0))) (let ((.cse54 (@diff .cse53 .cse7))) (let ((.cse47 (store .cse53 .cse54 0))) (let ((.cse48 (@diff .cse47 .cse7))) (let ((.cse51 (store .cse47 .cse48 0))) (let ((.cse52 (@diff .cse51 .cse7))) (let ((.cse49 (store .cse51 .cse52 0))) (let ((.cse50 (@diff .cse49 .cse7))) (and (or (= .cse7 .cse47) (<= (+ .cse48 28) .cse6)) (= .cse7 (store .cse49 .cse50 0)) (or (= .cse7 .cse51) (<= (+ .cse52 28) .cse6)) (or (= .cse7 .cse53) (<= (+ .cse54 28) .cse6)) (or (<= (+ 28 .cse50) .cse6) (= .cse7 .cse49)) .cse31 .cse44 .cse45)))))))))) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_1155 Int) (v_ArrVal_1158 Int)) (and (= .cse17 (store (store .cse7 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_1155) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1158)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) .cse6) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| 28) .cse6))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse56 (@diff .cse55 .cse7))) (let ((.cse62 (store .cse55 .cse56 0))) (let ((.cse61 (@diff .cse62 .cse7))) (let ((.cse57 (store .cse62 .cse61 0))) (let ((.cse58 (@diff .cse57 .cse7))) (let ((.cse60 (store .cse57 .cse58 0))) (let ((.cse59 (@diff .cse60 .cse7))) (and (or (<= (+ .cse56 28) .cse6) (= .cse7 .cse55)) .cse1 (or (= .cse7 .cse57) (<= (+ .cse58 28) .cse6)) (or (<= (+ 28 .cse59) .cse6) (= .cse7 .cse60)) (= .cse7 (store .cse60 .cse59 0)) (or (<= (+ 28 .cse61) .cse6) (= .cse7 .cse62)))))))))) .cse4) (= |c_~#cache~0.base| 3))))))))) is different from true Received shutdown request... [2022-11-15 14:33:39,712 WARN L249 SmtUtils]: Removed 3 from assertion stack [2022-11-15 14:33:39,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-15 14:33:39,734 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 14:33:39,734 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 14:33:39,734 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 14:33:39,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-15 14:33:39,912 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 1ms.. [2022-11-15 14:33:39,914 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-15 14:33:39,914 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-15 14:33:39,914 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-15 14:33:39,915 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-15 14:33:39,915 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-15 14:33:39,915 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-15 14:33:39,920 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-15 14:33:39,921 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-11-15 14:33:39,922 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-15 14:33:39,922 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-15 14:33:39,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 02:33:39 BasicIcfg [2022-11-15 14:33:39,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-15 14:33:39,924 INFO L158 Benchmark]: Toolchain (without parser) took 862260.85ms. Allocated memory was 190.8MB in the beginning and 641.7MB in the end (delta: 450.9MB). Free memory was 134.8MB in the beginning and 237.4MB in the end (delta: -102.6MB). Peak memory consumption was 347.4MB. Max. memory is 8.0GB. [2022-11-15 14:33:39,924 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 190.8MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-15 14:33:39,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.16ms. Allocated memory is still 190.8MB. Free memory was 134.5MB in the beginning and 143.6MB in the end (delta: -9.1MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-11-15 14:33:39,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.65ms. Allocated memory is still 190.8MB. Free memory was 143.6MB in the beginning and 140.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-15 14:33:39,924 INFO L158 Benchmark]: Boogie Preprocessor took 35.63ms. Allocated memory is still 190.8MB. Free memory was 140.5MB in the beginning and 138.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-15 14:33:39,924 INFO L158 Benchmark]: RCFGBuilder took 506.46ms. Allocated memory is still 190.8MB. Free memory was 138.4MB in the beginning and 115.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-11-15 14:33:39,925 INFO L158 Benchmark]: TraceAbstraction took 861237.29ms. Allocated memory was 190.8MB in the beginning and 641.7MB in the end (delta: 450.9MB). Free memory was 114.6MB in the beginning and 237.4MB in the end (delta: -122.7MB). Peak memory consumption was 329.2MB. Max. memory is 8.0GB. [2022-11-15 14:33:39,925 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.10ms. Allocated memory is still 190.8MB. Free memory is still 153.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 420.16ms. Allocated memory is still 190.8MB. Free memory was 134.5MB in the beginning and 143.6MB in the end (delta: -9.1MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.65ms. Allocated memory is still 190.8MB. Free memory was 143.6MB in the beginning and 140.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.63ms. Allocated memory is still 190.8MB. Free memory was 140.5MB in the beginning and 138.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 506.46ms. Allocated memory is still 190.8MB. Free memory was 138.4MB in the beginning and 115.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 861237.29ms. Allocated memory was 190.8MB in the beginning and 641.7MB in the end (delta: 450.9MB). Free memory was 114.6MB in the beginning and 237.4MB in the end (delta: -122.7MB). Peak memory consumption was 329.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3534, independent: 3518, independent conditional: 28, independent unconditional: 3490, dependent: 16, dependent conditional: 11, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3291, Positive cache size: 3286, Positive conditional cache size: 0, Positive unconditional cache size: 3286, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 11, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3534, independent: 3518, independent conditional: 28, independent unconditional: 3490, dependent: 16, dependent conditional: 11, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3291, Positive cache size: 3286, Positive conditional cache size: 0, Positive unconditional cache size: 3286, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 22, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3538, independent: 3518, independent conditional: 28, independent unconditional: 3490, dependent: 20, dependent conditional: 15, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3291, Positive cache size: 3286, Positive conditional cache size: 0, Positive unconditional cache size: 3286, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 37, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 3543, independent: 3518, independent conditional: 28, independent unconditional: 3490, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3291, Positive cache size: 3286, Positive conditional cache size: 0, Positive unconditional cache size: 3286, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 57, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2970, independent: 2939, independent conditional: 30, independent unconditional: 2909, dependent: 31, dependent conditional: 21, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3870, Positive cache size: 3855, Positive conditional cache size: 0, Positive unconditional cache size: 3855, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 78, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 2982, independent: 2939, independent conditional: 30, independent unconditional: 2909, dependent: 43, dependent conditional: 33, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3870, Positive cache size: 3855, Positive conditional cache size: 0, Positive unconditional cache size: 3855, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 111, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4761, independent: 4713, independent conditional: 43, independent unconditional: 4670, dependent: 48, dependent conditional: 36, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 5607, Positive cache size: 5590, Positive conditional cache size: 0, Positive unconditional cache size: 5590, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 147, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4770, independent: 4713, independent conditional: 43, independent unconditional: 4670, dependent: 57, dependent conditional: 45, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 5607, Positive cache size: 5590, Positive conditional cache size: 0, Positive unconditional cache size: 5590, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 192, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 4501, independent: 4440, independent conditional: 45, independent unconditional: 4395, dependent: 61, dependent conditional: 46, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 5980, Positive cache size: 5948, Positive conditional cache size: 0, Positive unconditional cache size: 5948, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 238, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6610, independent: 6543, independent conditional: 60, independent unconditional: 6483, dependent: 67, dependent conditional: 50, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 8055, Positive cache size: 8021, Positive conditional cache size: 0, Positive unconditional cache size: 8021, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 288, Statistics for Abstraction: - StatisticsResult: Independence relation #11 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6565, independent: 6485, independent conditional: 87, independent unconditional: 6398, dependent: 80, dependent conditional: 59, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 8614, Positive cache size: 8563, Positive conditional cache size: 0, Positive unconditional cache size: 8563, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 347, Statistics for Abstraction: - StatisticsResult: Independence relation #12 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6606, independent: 6517, independent conditional: 119, independent unconditional: 6398, dependent: 89, dependent conditional: 68, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 9339, Positive cache size: 9267, Positive conditional cache size: 0, Positive unconditional cache size: 9267, Negative cache size: 72, Negative conditional cache size: 0, Negative unconditional cache size: 72, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 415, Statistics for Abstraction: - StatisticsResult: Independence relation #13 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6609, independent: 6519, independent conditional: 121, independent unconditional: 6398, dependent: 90, dependent conditional: 69, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 9339, Positive cache size: 9267, Positive conditional cache size: 0, Positive unconditional cache size: 9267, Negative cache size: 72, Negative conditional cache size: 0, Negative unconditional cache size: 72, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 484, Statistics for Abstraction: - StatisticsResult: Independence relation #14 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 14491, independent: 14331, independent conditional: 365, independent unconditional: 13966, dependent: 160, dependent conditional: 127, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 12672, Positive cache size: 12596, Positive conditional cache size: 0, Positive unconditional cache size: 12596, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 610, Statistics for Abstraction: - StatisticsResult: Independence relation #15 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 16494, independent: 16333, independent conditional: 367, independent unconditional: 15966, dependent: 161, dependent conditional: 129, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 14415, Positive cache size: 14338, Positive conditional cache size: 0, Positive unconditional cache size: 14338, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 738, Statistics for Abstraction: - StatisticsResult: Independence relation #16 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 9117, independent: 8956, independent conditional: 335, independent unconditional: 8621, dependent: 161, dependent conditional: 121, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 15005, Positive cache size: 14925, Positive conditional cache size: 0, Positive unconditional cache size: 14925, Negative cache size: 80, Negative conditional cache size: 0, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 858, Statistics for Abstraction: - StatisticsResult: Independence relation #17 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 7885, independent: 7746, independent conditional: 269, independent unconditional: 7477, dependent: 139, dependent conditional: 112, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 15005, Positive cache size: 14925, Positive conditional cache size: 0, Positive unconditional cache size: 14925, Negative cache size: 80, Negative conditional cache size: 0, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 969, Statistics for Abstraction: - StatisticsResult: Independence relation #18 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6562, independent: 6483, independent conditional: 85, independent unconditional: 6398, dependent: 79, dependent conditional: 58, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 15005, Positive cache size: 14925, Positive conditional cache size: 0, Positive unconditional cache size: 14925, Negative cache size: 80, Negative conditional cache size: 0, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 1027, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 65, Number of trivial persistent sets: 49, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3534, independent: 3518, independent conditional: 28, independent unconditional: 3490, dependent: 16, dependent conditional: 11, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3291, Positive cache size: 3286, Positive conditional cache size: 0, Positive unconditional cache size: 3286, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 11, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 65, Number of trivial persistent sets: 49, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3534, independent: 3518, independent conditional: 28, independent unconditional: 3490, dependent: 16, dependent conditional: 11, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3291, Positive cache size: 3286, Positive conditional cache size: 0, Positive unconditional cache size: 3286, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 22, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 71, Number of trivial persistent sets: 55, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3538, independent: 3518, independent conditional: 28, independent unconditional: 3490, dependent: 20, dependent conditional: 15, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3291, Positive cache size: 3286, Positive conditional cache size: 0, Positive unconditional cache size: 3286, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 37, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 71, Number of trivial persistent sets: 55, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 3543, independent: 3518, independent conditional: 28, independent unconditional: 3490, dependent: 25, dependent conditional: 20, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3291, Positive cache size: 3286, Positive conditional cache size: 0, Positive unconditional cache size: 3286, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 57, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 72, Number of trivial persistent sets: 60, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2970, independent: 2939, independent conditional: 30, independent unconditional: 2909, dependent: 31, dependent conditional: 21, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3870, Positive cache size: 3855, Positive conditional cache size: 0, Positive unconditional cache size: 3855, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 78, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 72, Number of trivial persistent sets: 60, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 2982, independent: 2939, independent conditional: 30, independent unconditional: 2909, dependent: 43, dependent conditional: 33, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 3870, Positive cache size: 3855, Positive conditional cache size: 0, Positive unconditional cache size: 3855, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 111, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 82, Number of trivial persistent sets: 62, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 4761, independent: 4713, independent conditional: 43, independent unconditional: 4670, dependent: 48, dependent conditional: 36, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 5607, Positive cache size: 5590, Positive conditional cache size: 0, Positive unconditional cache size: 5590, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 147, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 82, Number of trivial persistent sets: 62, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 4770, independent: 4713, independent conditional: 43, independent unconditional: 4670, dependent: 57, dependent conditional: 45, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 5607, Positive cache size: 5590, Positive conditional cache size: 0, Positive unconditional cache size: 5590, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 192, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 83, Number of trivial persistent sets: 65, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 4501, independent: 4440, independent conditional: 45, independent unconditional: 4395, dependent: 61, dependent conditional: 46, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 5980, Positive cache size: 5948, Positive conditional cache size: 0, Positive unconditional cache size: 5948, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 238, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 94, Number of trivial persistent sets: 67, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6610, independent: 6543, independent conditional: 60, independent unconditional: 6483, dependent: 67, dependent conditional: 50, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 8055, Positive cache size: 8021, Positive conditional cache size: 0, Positive unconditional cache size: 8021, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 288, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 97, Number of trivial persistent sets: 71, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6565, independent: 6485, independent conditional: 87, independent unconditional: 6398, dependent: 80, dependent conditional: 59, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 8614, Positive cache size: 8563, Positive conditional cache size: 0, Positive unconditional cache size: 8563, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 347, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 97, Number of trivial persistent sets: 71, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6606, independent: 6517, independent conditional: 119, independent unconditional: 6398, dependent: 89, dependent conditional: 68, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 9339, Positive cache size: 9267, Positive conditional cache size: 0, Positive unconditional cache size: 9267, Negative cache size: 72, Negative conditional cache size: 0, Negative unconditional cache size: 72, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 415, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 97, Number of trivial persistent sets: 71, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6609, independent: 6519, independent conditional: 121, independent unconditional: 6398, dependent: 90, dependent conditional: 69, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 9339, Positive cache size: 9267, Positive conditional cache size: 0, Positive unconditional cache size: 9267, Negative cache size: 72, Negative conditional cache size: 0, Negative unconditional cache size: 72, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 484, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 243, Number of trivial persistent sets: 183, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 14491, independent: 14331, independent conditional: 365, independent unconditional: 13966, dependent: 160, dependent conditional: 127, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 12672, Positive cache size: 12596, Positive conditional cache size: 0, Positive unconditional cache size: 12596, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 610, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 247, Number of trivial persistent sets: 187, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 16494, independent: 16333, independent conditional: 367, independent unconditional: 15966, dependent: 161, dependent conditional: 129, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 14415, Positive cache size: 14338, Positive conditional cache size: 0, Positive unconditional cache size: 14338, Negative cache size: 77, Negative conditional cache size: 0, Negative unconditional cache size: 77, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 738, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 205, Number of trivial persistent sets: 161, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 9117, independent: 8956, independent conditional: 335, independent unconditional: 8621, dependent: 161, dependent conditional: 121, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 15005, Positive cache size: 14925, Positive conditional cache size: 0, Positive unconditional cache size: 14925, Negative cache size: 80, Negative conditional cache size: 0, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 858, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 132, Number of trivial persistent sets: 106, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 7885, independent: 7746, independent conditional: 269, independent unconditional: 7477, dependent: 139, dependent conditional: 112, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 15005, Positive cache size: 14925, Positive conditional cache size: 0, Positive unconditional cache size: 14925, Negative cache size: 80, Negative conditional cache size: 0, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 969, Statistics for Abstraction: - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.0s, Number of persistent set computation: 97, Number of trivial persistent sets: 71, Underlying independence relation: IndependenceRelationWithAbstraction.Independence Queries: [ total: 6562, independent: 6483, independent conditional: 85, independent unconditional: 6398, dependent: 79, dependent conditional: 58, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 115072, independent: 113729, independent conditional: 2111, independent unconditional: 111618, dependent: 1343, dependent conditional: 1031, dependent unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 114045, independent: 113729, independent conditional: 0, independent unconditional: 113729, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15005, independent: 14925, independent conditional: 0, independent unconditional: 14925, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 114045, independent: 98804, independent conditional: 0, independent unconditional: 98804, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 15005, unknown conditional: 0, unknown unconditional: 15005] , Statistics on independence cache: Total cache size (in pairs): 15005, Positive cache size: 14925, Positive conditional cache size: 0, Positive unconditional cache size: 14925, Negative cache size: 80, Negative conditional cache size: 0, Negative unconditional cache size: 80, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 1027, Statistics for Abstraction: - TimeoutResultAtElement [Line: 946]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 1ms.. - TimeoutResultAtElement [Line: 946]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 1ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 1ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 1ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 1ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 143 for 1ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 321 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 861.1s, OverallIterations: 17, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 525.9s, 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: 244, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 330.9s InterpolantComputationTime, 4095 NumberOfCodeBlocks, 4025 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5171 ConstructedInterpolants, 823 QuantifiedInterpolants, 210286 SizeOfPredicates, 117 NumberOfNonLiveVariables, 3531 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 35 InterpolantComputations, 10 PerfectInterpolantSequences, 7134/8703 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