/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-16 09:41:38,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-16 09:41:38,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-16 09:41:38,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-16 09:41:38,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-16 09:41:38,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-16 09:41:38,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-16 09:41:38,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-16 09:41:38,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-16 09:41:38,994 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-16 09:41:39,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-16 09:41:39,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-16 09:41:39,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-16 09:41:39,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-16 09:41:39,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-16 09:41:39,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-16 09:41:39,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-16 09:41:39,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-16 09:41:39,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-16 09:41:39,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-16 09:41:39,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-16 09:41:39,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-16 09:41:39,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-16 09:41:39,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-16 09:41:39,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-16 09:41:39,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-16 09:41:39,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-16 09:41:39,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-16 09:41:39,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-16 09:41:39,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-16 09:41:39,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-16 09:41:39,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-16 09:41:39,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-16 09:41:39,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-16 09:41:39,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-16 09:41:39,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-16 09:41:39,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-16 09:41:39,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-16 09:41:39,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-16 09:41:39,035 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-16 09:41:39,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-16 09:41:39,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy.epf [2022-02-16 09:41:39,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-16 09:41:39,065 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-16 09:41:39,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-16 09:41:39,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-16 09:41:39,066 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-16 09:41:39,066 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-16 09:41:39,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * Use SBE=true [2022-02-16 09:41:39,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-16 09:41:39,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-16 09:41:39,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-16 09:41:39,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-16 09:41:39,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-16 09:41:39,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-16 09:41:39,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-16 09:41:39,069 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-16 09:41:39,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-16 09:41:39,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-16 09:41:39,069 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-02-16 09:41:39,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-02-16 09:41:39,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-16 09:41:39,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-16 09:41:39,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-16 09:41:39,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-16 09:41:39,255 INFO L275 PluginConnector]: CDTParser initialized [2022-02-16 09:41:39,256 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-02-16 09:41:39,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7d8e294/0ac6e66471b9436394c2bb30d1dc8341/FLAG1263cbb6e [2022-02-16 09:41:39,719 INFO L306 CDTParser]: Found 1 translation units. [2022-02-16 09:41:39,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-02-16 09:41:39,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7d8e294/0ac6e66471b9436394c2bb30d1dc8341/FLAG1263cbb6e [2022-02-16 09:41:39,748 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7d8e294/0ac6e66471b9436394c2bb30d1dc8341 [2022-02-16 09:41:39,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-16 09:41:39,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-16 09:41:39,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-16 09:41:39,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-16 09:41:39,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-16 09:41:39,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 09:41:39" (1/1) ... [2022-02-16 09:41:39,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35574d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:39, skipping insertion in model container [2022-02-16 09:41:39,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 09:41:39" (1/1) ... [2022-02-16 09:41:39,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-16 09:41:39,797 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-16 09:41:40,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-16 09:41:40,103 INFO L203 MainTranslator]: Completed pre-run [2022-02-16 09:41:40,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-16 09:41:40,183 INFO L208 MainTranslator]: Completed translation [2022-02-16 09:41:40,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40 WrapperNode [2022-02-16 09:41:40,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-16 09:41:40,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-16 09:41:40,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-16 09:41:40,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-16 09:41:40,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,230 INFO L137 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-02-16 09:41:40,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-16 09:41:40,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-16 09:41:40,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-16 09:41:40,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-16 09:41:40,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-16 09:41:40,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-16 09:41:40,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-16 09:41:40,260 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-16 09:41:40,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (1/1) ... [2022-02-16 09:41:40,265 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-16 09:41:40,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:40,282 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-02-16 09:41:40,286 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-02-16 09:41:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-16 09:41:40,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-16 09:41:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-16 09:41:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-16 09:41:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-16 09:41:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-16 09:41:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-16 09:41:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-16 09:41:40,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-16 09:41:40,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-16 09:41:40,309 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-16 09:41:40,383 INFO L234 CfgBuilder]: Building ICFG [2022-02-16 09:41:40,384 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-16 09:41:40,560 INFO L275 CfgBuilder]: Performing block encoding [2022-02-16 09:41:40,565 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-16 09:41:40,565 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-16 09:41:40,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 09:41:40 BoogieIcfgContainer [2022-02-16 09:41:40,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-16 09:41:40,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-16 09:41:40,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-16 09:41:40,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-16 09:41:40,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 09:41:39" (1/3) ... [2022-02-16 09:41:40,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22976664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 09:41:40, skipping insertion in model container [2022-02-16 09:41:40,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 09:41:40" (2/3) ... [2022-02-16 09:41:40,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22976664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 09:41:40, skipping insertion in model container [2022-02-16 09:41:40,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 09:41:40" (3/3) ... [2022-02-16 09:41:40,572 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-02-16 09:41:40,575 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-16 09:41:40,575 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-16 09:41:40,575 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-16 09:41:40,575 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-16 09:41:40,614 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,615 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,616 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,617 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,618 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,619 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,620 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,621 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,622 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,623 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,623 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,623 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,623 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,623 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,623 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,623 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,623 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,624 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,624 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,624 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,624 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,624 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,624 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,625 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,625 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,625 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,625 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,626 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,627 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,628 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,628 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,628 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,628 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,628 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,628 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,629 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,630 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,631 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,631 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,631 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,631 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,631 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,631 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,631 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,632 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,632 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,632 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,632 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,632 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,632 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,633 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,640 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 09:41:40,642 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-16 09:41:40,684 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-16 09:41:40,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:40,687 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-02-16 09:41:40,690 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-02-16 09:41:40,727 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-16 09:41:40,736 INFO L339 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, mLazyFiniteAutomaton=true, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-16 09:41:40,737 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-02-16 09:41:40,777 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-02-16 09:41:40,780 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash 397060765, now seen corresponding path program 1 times [2022-02-16 09:41:40,790 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:40,790 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562069368] [2022-02-16 09:41:40,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:40,790 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:40,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:40,942 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:40,942 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562069368] [2022-02-16 09:41:40,942 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562069368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:40,943 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 09:41:40,943 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-16 09:41:40,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733470801] [2022-02-16 09:41:40,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:40,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-16 09:41:40,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:40,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-16 09:41:40,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-16 09:41:40,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:40,966 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:40,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-02-16 09:41:40,968 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:40,980 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-02-16 09:41:40,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:40,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-16 09:41:40,981 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:40,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1657093153, now seen corresponding path program 1 times [2022-02-16 09:41:40,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:40,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31327381] [2022-02-16 09:41:40,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:40,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:41,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:41,051 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:41,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31327381] [2022-02-16 09:41:41,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31327381] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:41,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 09:41:41,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-16 09:41:41,052 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885691449] [2022-02-16 09:41:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:41,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-16 09:41:41,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-16 09:41:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-16 09:41:41,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,060 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:41,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-02-16 09:41:41,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,086 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 51 transitions and produced 52 states. [2022-02-16 09:41:41,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:41,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-16 09:41:41,087 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:41,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1891473138, now seen corresponding path program 1 times [2022-02-16 09:41:41,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:41,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54034713] [2022-02-16 09:41:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:41,088 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:41,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:41,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54034713] [2022-02-16 09:41:41,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54034713] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:41,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138583262] [2022-02-16 09:41:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:41,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:41,173 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-02-16 09:41:41,174 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-02-16 09:41:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:41,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-16 09:41:41,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-16 09:41:41,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-16 09:41:41,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138583262] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:41,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-16 09:41:41,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-02-16 09:41:41,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002185895] [2022-02-16 09:41:41,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:41,323 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-16 09:41:41,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:41,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-16 09:41:41,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-16 09:41:41,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,324 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:41,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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-02-16 09:41:41,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:41,325 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,358 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 63 transitions and produced 64 states. [2022-02-16 09:41:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:41,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-16 09:41:41,567 WARN L452 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-02-16 09:41:41,568 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:41,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1317859348, now seen corresponding path program 1 times [2022-02-16 09:41:41,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:41,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745315416] [2022-02-16 09:41:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:41,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:41,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:41,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:41,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745315416] [2022-02-16 09:41:41,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745315416] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:41,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163819663] [2022-02-16 09:41:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:41,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:41,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:41,635 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-02-16 09:41:41,636 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-02-16 09:41:41,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:41,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-16 09:41:41,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:41,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 09:41:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:41,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163819663] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 09:41:41,959 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 09:41:41,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-16 09:41:41,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093864122] [2022-02-16 09:41:41,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 09:41:41,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-16 09:41:41,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:41,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-16 09:41:41,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-16 09:41:41,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,961 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:41,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 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-02-16 09:41:41,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:41,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:41,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:41,961 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:42,041 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 77 transitions and produced 78 states. [2022-02-16 09:41:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:42,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:42,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-16 09:41:42,261 WARN L452 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-02-16 09:41:42,261 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:42,262 INFO L85 PathProgramCache]: Analyzing trace with hash -626594124, now seen corresponding path program 2 times [2022-02-16 09:41:42,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:42,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144051023] [2022-02-16 09:41:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:42,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:42,389 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:42,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144051023] [2022-02-16 09:41:42,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144051023] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:42,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2456562] [2022-02-16 09:41:42,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-16 09:41:42,389 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:42,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:42,403 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-02-16 09:41:42,475 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-02-16 09:41:42,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-16 09:41:42,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-16 09:41:42,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-16 09:41:42,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:42,575 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-02-16 09:41:42,597 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-16 09:41:42,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-16 09:41:42,634 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-02-16 09:41:42,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 32 [2022-02-16 09:41:42,685 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-16 09:41:42,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 44 [2022-02-16 09:41:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-16 09:41:42,706 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-16 09:41:42,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2456562] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:42,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-16 09:41:42,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-02-16 09:41:42,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906661217] [2022-02-16 09:41:42,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:42,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 09:41:42,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:42,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 09:41:42,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-16 09:41:42,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:42,707 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:42,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 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-02-16 09:41:42,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:42,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:42,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:42,708 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:42,737 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 94 transitions and produced 95 states. [2022-02-16 09:41:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:42,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:42,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-16 09:41:42,958 WARN L452 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-02-16 09:41:42,958 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:42,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1568821428, now seen corresponding path program 1 times [2022-02-16 09:41:42,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:42,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544537665] [2022-02-16 09:41:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:42,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:43,039 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:43,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:43,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544537665] [2022-02-16 09:41:43,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544537665] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:43,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299861888] [2022-02-16 09:41:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:43,040 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:43,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:43,054 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-02-16 09:41:43,055 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-02-16 09:41:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:43,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-16 09:41:43,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:43,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 09:41:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:43,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299861888] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 09:41:43,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 09:41:43,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-16 09:41:43,345 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149975346] [2022-02-16 09:41:43,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 09:41:43,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-16 09:41:43,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:43,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-16 09:41:43,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-16 09:41:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:43,346 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:43,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.444444444444445) internal successors, (80), 18 states have internal predecessors, (80), 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-02-16 09:41:43,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:43,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:43,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:43,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:43,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:43,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:43,481 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 122 transitions and produced 115 states. [2022-02-16 09:41:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:43,498 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-02-16 09:41:43,691 WARN L452 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-02-16 09:41:43,691 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1158747276, now seen corresponding path program 2 times [2022-02-16 09:41:43,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:43,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186063359] [2022-02-16 09:41:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:43,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 09:41:43,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:43,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186063359] [2022-02-16 09:41:43,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186063359] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:43,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387877981] [2022-02-16 09:41:43,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-16 09:41:43,889 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:43,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:43,901 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-02-16 09:41:43,902 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-02-16 09:41:43,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-16 09:41:43,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-16 09:41:43,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-16 09:41:43,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:44,136 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-02-16 09:41:44,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-16 09:41:44,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,194 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-16 09:41:44,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-02-16 09:41:44,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:41:44,232 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-16 09:41:44,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2022-02-16 09:41:44,257 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-16 09:41:44,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-16 09:41:44,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387877981] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:44,257 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-16 09:41:44,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-02-16 09:41:44,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387611328] [2022-02-16 09:41:44,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:44,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-16 09:41:44,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:44,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-16 09:41:44,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-02-16 09:41:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:44,258 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:44,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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-02-16 09:41:44,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:44,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:44,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:44,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:44,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:44,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:44,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:44,435 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 155 transitions and produced 148 states. [2022-02-16 09:41:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:44,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:41:44,452 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-02-16 09:41:44,636 WARN L452 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-02-16 09:41:44,637 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:44,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:44,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1001729759, now seen corresponding path program 1 times [2022-02-16 09:41:44,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:44,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108985358] [2022-02-16 09:41:44,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:44,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-02-16 09:41:44,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:44,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108985358] [2022-02-16 09:41:44,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108985358] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:44,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175786902] [2022-02-16 09:41:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:44,685 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:44,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:44,700 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-02-16 09:41:44,744 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-02-16 09:41:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:44,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-16 09:41:44,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:45,063 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-16 09:41:45,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 09:41:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-16 09:41:45,241 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175786902] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 09:41:45,241 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 09:41:45,241 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 24 [2022-02-16 09:41:45,241 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13521954] [2022-02-16 09:41:45,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 09:41:45,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-16 09:41:45,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:45,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-16 09:41:45,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-02-16 09:41:45,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:45,243 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:45,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.291666666666667) internal successors, (151), 24 states have internal predecessors, (151), 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-02-16 09:41:45,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:45,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:45,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:45,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:45,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:45,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:45,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:41:45,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:45,561 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 205 transitions and produced 193 states. [2022-02-16 09:41:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:45,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:45,580 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-02-16 09:41:45,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:45,763 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:45,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:45,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2116870732, now seen corresponding path program 1 times [2022-02-16 09:41:45,763 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:45,763 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845783710] [2022-02-16 09:41:45,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:45,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-02-16 09:41:45,896 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:45,896 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845783710] [2022-02-16 09:41:45,896 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845783710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:45,896 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 09:41:45,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-16 09:41:45,897 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157196801] [2022-02-16 09:41:45,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:45,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 09:41:45,897 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:45,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 09:41:45,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-16 09:41:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:45,898 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:45,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 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-02-16 09:41:45,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:45,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:45,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:45,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:45,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:45,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:45,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:45,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:45,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:45,955 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 238 transitions and produced 226 states. [2022-02-16 09:41:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:45,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-16 09:41:45,956 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:45,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1162619167, now seen corresponding path program 2 times [2022-02-16 09:41:45,956 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:45,956 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129594417] [2022-02-16 09:41:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:45,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-16 09:41:46,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:46,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129594417] [2022-02-16 09:41:46,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129594417] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:46,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879483765] [2022-02-16 09:41:46,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-16 09:41:46,024 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:46,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:46,048 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-02-16 09:41:46,049 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-02-16 09:41:46,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-16 09:41:46,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-16 09:41:46,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-16 09:41:46,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:46,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-16 09:41:46,302 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-16 09:41:46,303 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-16 09:41:46,333 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-02-16 09:41:46,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-02-16 09:41:46,376 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-02-16 09:41:46,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-02-16 09:41:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2022-02-16 09:41:46,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-16 09:41:46,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879483765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:46,393 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-16 09:41:46,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-02-16 09:41:46,394 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941778959] [2022-02-16 09:41:46,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:46,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 09:41:46,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:46,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 09:41:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-16 09:41:46,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:46,395 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:46,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 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-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:46,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:46,465 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 255 transitions and produced 243 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:46,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:46,502 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-02-16 09:41:46,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-16 09:41:46,667 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:46,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:46,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1757402922, now seen corresponding path program 1 times [2022-02-16 09:41:46,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:46,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281055848] [2022-02-16 09:41:46,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:46,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-16 09:41:46,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:46,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281055848] [2022-02-16 09:41:46,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281055848] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:46,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602763138] [2022-02-16 09:41:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:46,747 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:46,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:46,764 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-02-16 09:41:46,788 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-02-16 09:41:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:46,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-16 09:41:46,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:47,094 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-16 09:41:47,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 09:41:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-16 09:41:47,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602763138] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 09:41:47,322 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 09:41:47,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-02-16 09:41:47,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517506183] [2022-02-16 09:41:47,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 09:41:47,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-16 09:41:47,323 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:47,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-16 09:41:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-16 09:41:47,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:47,323 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:47,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 13.5) internal successors, (189), 14 states have internal predecessors, (189), 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-02-16 09:41:47,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:47,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:47,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:47,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:47,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:47,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:47,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:47,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:47,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:47,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:47,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:47,417 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 441 transitions and produced 429 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:47,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:47,442 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-02-16 09:41:47,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:47,634 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash -106070791, now seen corresponding path program 2 times [2022-02-16 09:41:47,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:47,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525735978] [2022-02-16 09:41:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:47,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:47,770 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-16 09:41:47,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:47,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525735978] [2022-02-16 09:41:47,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525735978] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:47,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607486567] [2022-02-16 09:41:47,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-16 09:41:47,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:47,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:47,792 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-02-16 09:41:47,819 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-02-16 09:41:47,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-16 09:41:47,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-16 09:41:47,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-16 09:41:47,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:48,198 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-16 09:41:48,222 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-16 09:41:48,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-16 09:41:48,253 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-02-16 09:41:48,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-02-16 09:41:48,301 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-02-16 09:41:48,301 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-02-16 09:41:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2022-02-16 09:41:48,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-16 09:41:48,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607486567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:48,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-16 09:41:48,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-02-16 09:41:48,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231416987] [2022-02-16 09:41:48,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:48,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 09:41:48,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:48,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 09:41:48,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-02-16 09:41:48,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:48,323 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:48,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 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-02-16 09:41:48,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:48,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:48,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:48,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:48,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:48,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:48,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:48,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:48,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:48,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:48,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:48,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:48,414 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 476 transitions and produced 464 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:48,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:48,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-02-16 09:41:48,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-16 09:41:48,645 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:48,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:48,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1731045646, now seen corresponding path program 1 times [2022-02-16 09:41:48,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:48,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875273118] [2022-02-16 09:41:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:48,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-16 09:41:48,799 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:48,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875273118] [2022-02-16 09:41:48,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875273118] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:41:48,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608362054] [2022-02-16 09:41:48,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:48,800 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:41:48,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:41:48,801 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-02-16 09:41:48,839 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-02-16 09:41:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:48,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-16 09:41:48,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:41:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-16 09:41:49,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 09:41:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-02-16 09:41:49,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608362054] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 09:41:49,776 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 09:41:49,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-02-16 09:41:49,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578133674] [2022-02-16 09:41:49,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 09:41:49,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-16 09:41:49,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:49,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-16 09:41:49,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-16 09:41:49,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:49,777 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:49,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 15.608695652173912) internal successors, (359), 23 states have internal predecessors, (359), 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-02-16 09:41:49,777 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:49,778 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:50,016 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 786 transitions and produced 774 states. [2022-02-16 09:41:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:50,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:50,043 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-02-16 09:41:50,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-16 09:41:50,227 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:50,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:50,228 INFO L85 PathProgramCache]: Analyzing trace with hash -986440607, now seen corresponding path program 2 times [2022-02-16 09:41:50,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:50,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312677356] [2022-02-16 09:41:50,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:50,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:50,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:41:50,400 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:50,400 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312677356] [2022-02-16 09:41:50,400 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312677356] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:50,400 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 09:41:50,400 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-16 09:41:50,400 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26293927] [2022-02-16 09:41:50,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:50,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 09:41:50,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:50,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 09:41:50,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-16 09:41:50,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:50,401 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:50,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.2) internal successors, (96), 6 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,401 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:50,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:50,402 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:50,550 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 795 transitions and produced 783 states. [2022-02-16 09:41:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:50,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:50,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-16 09:41:50,551 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1833760666, now seen corresponding path program 1 times [2022-02-16 09:41:50,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:50,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744722713] [2022-02-16 09:41:50,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:50,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:41:50,732 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:50,732 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744722713] [2022-02-16 09:41:50,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744722713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:50,732 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 09:41:50,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-16 09:41:50,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784430203] [2022-02-16 09:41:50,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:50,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-16 09:41:50,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-16 09:41:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-16 09:41:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:50,733 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:50,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 20.8) internal successors, (104), 6 states have internal predecessors, (104), 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-02-16 09:41:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:50,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:50,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:50,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:50,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:50,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:50,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:51,942 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 34978 transitions and produced 19317 states. [2022-02-16 09:41:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:51,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:51,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-16 09:41:51,943 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:51,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:51,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1924795105, now seen corresponding path program 1 times [2022-02-16 09:41:51,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:51,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704066650] [2022-02-16 09:41:51,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:51,944 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:41:52,219 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:52,219 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704066650] [2022-02-16 09:41:52,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704066650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:52,219 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 09:41:52,219 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-16 09:41:52,219 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163454401] [2022-02-16 09:41:52,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:52,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-16 09:41:52,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:52,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-16 09:41:52,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-16 09:41:52,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:52,221 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:52,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 9 states have internal predecessors, (83), 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-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:52,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:53,032 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17833 transitions and produced 10015 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:53,034 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-16 09:41:53,034 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:53,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:53,035 INFO L85 PathProgramCache]: Analyzing trace with hash -460892034, now seen corresponding path program 1 times [2022-02-16 09:41:53,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:53,035 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058750305] [2022-02-16 09:41:53,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:53,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:41:53,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:53,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058750305] [2022-02-16 09:41:53,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058750305] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:53,351 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 09:41:53,351 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-16 09:41:53,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618819163] [2022-02-16 09:41:53,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:53,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-16 09:41:53,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:53,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-16 09:41:53,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-16 09:41:53,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:53,353 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:53,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 9 states have internal predecessors, (84), 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-02-16 09:41:53,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:53,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:53,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:53,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:53,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:53,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:54,148 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17841 transitions and produced 10023 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:54,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:54,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-16 09:41:54,159 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:54,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:54,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1402749280, now seen corresponding path program 1 times [2022-02-16 09:41:54,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:54,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591492055] [2022-02-16 09:41:54,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:54,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:41:54,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:54,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591492055] [2022-02-16 09:41:54,519 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591492055] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:54,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 09:41:54,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-16 09:41:54,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478089380] [2022-02-16 09:41:54,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:54,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-16 09:41:54,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-16 09:41:54,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-16 09:41:54,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:54,520 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:54,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.625) internal successors, (85), 9 states have internal predecessors, (85), 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-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:54,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:54,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:54,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:55,170 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17856 transitions and produced 10035 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:55,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-16 09:41:55,172 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:41:55,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:41:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash -535552803, now seen corresponding path program 1 times [2022-02-16 09:41:55,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:41:55,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741140580] [2022-02-16 09:41:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:41:55,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:41:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:41:55,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:41:55,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:41:55,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741140580] [2022-02-16 09:41:55,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741140580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 09:41:55,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 09:41:55,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-16 09:41:55,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432502828] [2022-02-16 09:41:55,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 09:41:55,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-16 09:41:55,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:41:55,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-16 09:41:55,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-16 09:41:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:55,628 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:41:55,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.75) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 09:41:55,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:41:55,629 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:42:00,278 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 135633 transitions and produced 73961 states. [2022-02-16 09:42:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:42:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:42:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:42:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:42:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:42:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:42:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:42:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:42:00,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-16 09:42:00,279 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:42:00,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:42:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2082690448, now seen corresponding path program 1 times [2022-02-16 09:42:00,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:42:00,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709934365] [2022-02-16 09:42:00,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:42:00,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:42:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:42:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:42:01,451 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:42:01,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709934365] [2022-02-16 09:42:01,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709934365] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:42:01,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598407286] [2022-02-16 09:42:01,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:42:01,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:42:01,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:42:01,466 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-02-16 09:42:01,467 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-02-16 09:42:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:42:01,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-16 09:42:01,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:42:02,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-16 09:42:02,392 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-16 09:42:02,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-02-16 09:42:02,424 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-02-16 09:42:02,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 34 [2022-02-16 09:42:02,466 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-02-16 09:42:02,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 46 [2022-02-16 09:42:02,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-16 09:42:02,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,770 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:42:02,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:42:02,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:42:02,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-16 09:42:02,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:02,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:42:02,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:42:03,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:42:03,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:42:03,456 INFO L353 Elim1Store]: treesize reduction 216, result has 14.6 percent of original size [2022-02-16 09:42:03,456 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 63 [2022-02-16 09:42:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:42:03,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 09:42:36,261 WARN L228 SmtUtils]: Spent 7.26s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-16 09:43:08,284 WARN L228 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-16 09:43:11,333 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-02-16 09:43:13,544 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-02-16 09:43:15,810 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-02-16 09:43:18,068 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-02-16 09:43:21,311 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse0 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse1 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse2 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-02-16 09:43:23,601 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_3661) .cse1 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse0 v_ArrVal_3668)) .cse1 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_3661) .cse7 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_3666) .cse6 v_ArrVal_3668)) .cse7 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-02-16 09:43:25,923 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_3658) .cse1 v_ArrVal_3661) .cse2 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse0 v_ArrVal_3666)) .cse1 v_ArrVal_3668)) .cse2 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 v_ArrVal_3658) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse3 v_ArrVal_3666)) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_3658) .cse7 v_ArrVal_3661) .cse8 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse6 v_ArrVal_3666)) .cse7 v_ArrVal_3668)) .cse8 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 v_ArrVal_3658) .cse10 v_ArrVal_3661) .cse11 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse9 v_ArrVal_3666)) .cse10 v_ArrVal_3668)) .cse11 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) is different from false [2022-02-16 09:43:28,295 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse0 v_ArrVal_3658) .cse1 v_ArrVal_3661) .cse2 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse0 v_ArrVal_3666)) .cse1 v_ArrVal_3668)) .cse2 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse3 v_ArrVal_3658) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse3 v_ArrVal_3666)) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse6 v_ArrVal_3658) .cse7 v_ArrVal_3661) .cse8 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse6 v_ArrVal_3666)) .cse7 v_ArrVal_3668)) .cse8 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse9 v_ArrVal_3658) .cse10 v_ArrVal_3661) .cse11 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse9 v_ArrVal_3666)) .cse10 v_ArrVal_3668)) .cse11 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-02-16 09:43:31,963 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse0 v_ArrVal_3658) .cse1 v_ArrVal_3661) .cse2 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse0 v_ArrVal_3666)) .cse1 v_ArrVal_3668)) .cse2 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse3 v_ArrVal_3658) .cse4 v_ArrVal_3661) .cse5 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse3 v_ArrVal_3666)) .cse4 v_ArrVal_3668)) .cse5 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse6 v_ArrVal_3658) .cse7 v_ArrVal_3661) .cse8 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse6 v_ArrVal_3666)) .cse7 v_ArrVal_3668)) .cse8 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse9 v_ArrVal_3658) .cse10 v_ArrVal_3661) .cse11 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse9 v_ArrVal_3666)) .cse10 v_ArrVal_3668)) .cse11 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) is different from false [2022-02-16 09:43:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 1550 trivial. 6 not checked. [2022-02-16 09:43:52,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598407286] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 09:43:52,358 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 09:43:52,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 20] total 39 [2022-02-16 09:43:52,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838813542] [2022-02-16 09:43:52,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 09:43:52,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-16 09:43:52,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:43:52,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-16 09:43:52,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=650, Unknown=40, NotChecked=594, Total=1560 [2022-02-16 09:43:52,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:43:52,360 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:43:52,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 6.641025641025641) internal successors, (259), 40 states have internal predecessors, (259), 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-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:43:52,360 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:43:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:43:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:43:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:43:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:43:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:43:52,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:43:55,246 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-02-16 09:44:07,398 WARN L228 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 115 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-16 09:44:09,211 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 141 |c_~#cache~0.offset|)) (.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse4 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ 142 |c_~#cache~0.offset|)) (.cse2 (+ 143 |c_~#cache~0.offset|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (not (= (+ 140 |c_~#cache~0.offset| .cse3) 0)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse4 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) .cse1)) (not (= (+ 142 |c_~#cache~0.offset| .cse3) 0)) (not (= (+ 139 |c_~#cache~0.offset| .cse3) 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (not (= (+ 138 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse0 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_3668) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (not (= (+ 141 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)))) is different from false [2022-02-16 09:44:11,219 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 141 |c_~#cache~0.offset|)) (.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse3 (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse4 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse6 (+ 142 |c_~#cache~0.offset|)) (.cse2 (+ 143 |c_~#cache~0.offset|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse2) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 140 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse4 .cse2)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse4 .cse5) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (not (= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) .cse1)) (not (= (+ 142 |c_~#cache~0.offset| .cse3) 0)) (not (= (+ 139 |c_~#cache~0.offset| .cse3) 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (not (= (+ 138 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse0 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 141 |c_~#cache~0.offset| .cse3) 0)) (= (select .cse4 .cse6) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_3671)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))))) is different from false [2022-02-16 09:44:13,593 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse17 (+ 141 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse16 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse14 (+ 142 |c_~#cache~0.offset|)) (.cse15 (+ 143 |c_~#cache~0.offset|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 1) (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse2 v_ArrVal_3658) .cse3 v_ArrVal_3661) .cse4 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse2 v_ArrVal_3666)) .cse3 v_ArrVal_3668)) .cse4 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse5 v_ArrVal_3658) .cse6 v_ArrVal_3661) .cse7 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse5 v_ArrVal_3666)) .cse6 v_ArrVal_3668)) .cse7 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse8 v_ArrVal_3658) .cse9 v_ArrVal_3661) .cse10 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse8 v_ArrVal_3666)) .cse9 v_ArrVal_3668)) .cse10 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse13 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse11 v_ArrVal_3658) .cse12 v_ArrVal_3661) .cse13 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse11 v_ArrVal_3666)) .cse12 v_ArrVal_3668)) .cse13 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse14)) (= (select .cse0 .cse15) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (= (select .cse16 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse16 .cse15)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1)) (= (select .cse0 .cse17) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse17)) (= (select .cse16 .cse17) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 .cse14) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse16 .cse14) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse15)))) is different from false [2022-02-16 09:44:15,605 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-02-16 09:45:00,012 WARN L228 SmtUtils]: Spent 18.20s on a formula simplification. DAG size of input: 85 DAG size of output: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-16 09:45:02,018 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse15 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse14 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse13 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse13 v_ArrVal_3658) .cse14 v_ArrVal_3661) .cse15 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse13 v_ArrVal_3666)) .cse14 v_ArrVal_3668)) .cse15 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (store (let ((.cse18 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse17 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse16 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse16 v_ArrVal_3658) .cse17 v_ArrVal_3661) .cse18 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse16 v_ArrVal_3666)) .cse17 v_ArrVal_3668)) .cse18 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse21 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse20 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse19 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse19 v_ArrVal_3658) .cse20 v_ArrVal_3661) .cse21 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse19 v_ArrVal_3666)) .cse20 v_ArrVal_3668)) .cse21 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse24 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse23 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse22 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3656) .cse22 v_ArrVal_3658) .cse23 v_ArrVal_3661) .cse24 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse22 v_ArrVal_3666)) .cse23 v_ArrVal_3668)) .cse24 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-02-16 09:45:04,033 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((v_ArrVal_3658 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))))) is different from false [2022-02-16 09:45:54,294 WARN L228 SmtUtils]: Spent 18.08s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-16 09:45:55,762 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (and (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_3672 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)))))))) is different from false [2022-02-16 09:45:57,816 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| Int)) (or (and (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse3 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse1 v_ArrVal_3658) .cse2 v_ArrVal_3661) .cse3 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse1 v_ArrVal_3666)) .cse2 v_ArrVal_3668)) .cse3 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse6 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse5 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse4 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse4 v_ArrVal_3658) .cse5 v_ArrVal_3661) .cse6 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse4 v_ArrVal_3666)) .cse5 v_ArrVal_3668)) .cse6 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (store (let ((.cse9 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse8 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse7 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse7 v_ArrVal_3658) .cse8 v_ArrVal_3661) .cse9 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse7 v_ArrVal_3666)) .cse8 v_ArrVal_3668)) .cse9 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|))) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28))) (forall ((v_ArrVal_3658 Int) (v_ArrVal_3656 Int) (|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3668 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| Int) (v_ArrVal_3666 Int) (v_ArrVal_3663 Int) (v_ArrVal_3664 Int) (v_ArrVal_3661 Int) (v_ArrVal_3672 Int) (v_ArrVal_3671 Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (= (select (store (let ((.cse12 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 3))) (store (let ((.cse11 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 2))) (store (let ((.cse10 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| 1))) (store (store (store (store (store (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3656) .cse10 v_ArrVal_3658) .cse11 v_ArrVal_3661) .cse12 v_ArrVal_3663) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46| v_ArrVal_3664) .cse10 v_ArrVal_3666)) .cse11 v_ArrVal_3668)) .cse12 v_ArrVal_3671)) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28) |c_~#cache~0.offset| 1) v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44_113| 28)))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_46|))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-02-16 09:46:02,995 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| Int)) (or (and (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_3672 Int)) (= (select (store (select |c_#race| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44| v_ArrVal_3672) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_44|))) (<= (div (+ |c_~#cache~0.offset| (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (- 28)) 1) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-02-16 09:46:03,596 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 124209 transitions and produced 68970 states. [2022-02-16 09:46:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:46:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:46:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:46:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:46:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:46:03,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:46:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-16 09:46:03,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-16 09:46:03,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:46:03,817 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:46:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:46:03,817 INFO L85 PathProgramCache]: Analyzing trace with hash -138892593, now seen corresponding path program 2 times [2022-02-16 09:46:03,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:46:03,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117679092] [2022-02-16 09:46:03,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:46:03,817 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:46:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:46:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:46:05,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:46:05,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117679092] [2022-02-16 09:46:05,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117679092] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:46:05,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377107111] [2022-02-16 09:46:05,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-16 09:46:05,179 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:46:05,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:46:05,180 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-16 09:46:05,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-16 09:46:05,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-16 09:46:05,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-16 09:46:05,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-16 09:46:05,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:46:07,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-16 09:46:07,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,073 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-16 09:46:07,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-02-16 09:46:07,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-02-16 09:46:07,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-16 09:46:07,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:46:07,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:46:07,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:46:07,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-16 09:46:07,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,674 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:46:07,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:46:07,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:07,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 61 [2022-02-16 09:46:08,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,351 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-16 09:46:08,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:46:08,395 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 63 [2022-02-16 09:46:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:46:08,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 09:47:25,799 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) is different from false [2022-02-16 09:47:27,889 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|) (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) is different from false [2022-02-16 09:47:29,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) is different from false [2022-02-16 09:47:42,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:47:42,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377107111] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 09:47:42,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 09:47:42,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 17] total 36 [2022-02-16 09:47:42,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29589869] [2022-02-16 09:47:42,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 09:47:42,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-16 09:47:42,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:47:42,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-16 09:47:42,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=796, Unknown=39, NotChecked=198, Total=1332 [2022-02-16 09:47:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:47:42,985 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:47:42,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 7.277777777777778) internal successors, (262), 37 states have internal predecessors, (262), 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-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-16 09:47:42,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:47:48,304 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse5 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse5 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse5 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-02-16 09:47:50,315 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-02-16 09:48:03,623 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_~#cache~0.base| 1) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int) (v_ArrVal_4279 Int) (v_ArrVal_4277 Int) (v_ArrVal_4275 Int) (v_ArrVal_4273 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4273) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4275) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4277) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4279)) |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|))) (= |c_~#cache~0.offset| 0)) is different from false [2022-02-16 09:48:05,663 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (< (+ |c_t_funThread1of1ForFork0_~i~0#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_25|) (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse1 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse2 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse3 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_25| Int)) (or (not (<= |v_t_funThread1of1ForFork0_~i~0#1_25| (+ |c_t_funThread1of1ForFork0_#t~post34#1| 1))) (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse4 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse5 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse5 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse5 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse6 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse6 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse6 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse7 (* |v_t_funThread1of1ForFork0_~i~0#1_25| 28))) (store (store (select |c_#race| |c_~#cache~0.base|) (+ .cse7 |c_~#cache~0.offset|) v_ArrVal_4281) (+ .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4283)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))))) is different from false [2022-02-16 09:48:28,398 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 175288 transitions and produced 97104 states. [2022-02-16 09:48:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:48:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:48:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:48:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:48:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:48:28,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-16 09:48:28,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-16 09:48:28,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-16 09:48:28,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-02-16 09:48:28,618 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:48:28,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:48:28,620 INFO L85 PathProgramCache]: Analyzing trace with hash -331735314, now seen corresponding path program 3 times [2022-02-16 09:48:28,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:48:28,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882446036] [2022-02-16 09:48:28,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:48:28,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:48:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:48:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:48:30,346 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:48:30,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882446036] [2022-02-16 09:48:30,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882446036] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:48:30,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852292717] [2022-02-16 09:48:30,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-16 09:48:30,347 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:48:30,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:48:30,354 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-16 09:48:30,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-16 09:48:30,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-16 09:48:30,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-16 09:48:30,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-16 09:48:30,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 09:48:32,559 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-16 09:48:32,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-16 09:48:32,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-02-16 09:48:32,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-02-16 09:48:32,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,888 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-16 09:48:32,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:48:32,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:32,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:48:33,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:48:33,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-16 09:48:33,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:48:33,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:48:33,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:33,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 61 [2022-02-16 09:48:34,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,107 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2022-02-16 09:48:34,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,194 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:48:34,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2022-02-16 09:48:34,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-16 09:48:34,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 64 [2022-02-16 09:48:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:48:34,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 09:48:37,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) is different from false [2022-02-16 09:48:50,095 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse0 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse0 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-02-16 09:48:52,445 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse0 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse0 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-02-16 09:48:55,959 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse0 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse0 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-02-16 09:48:58,296 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse0 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse0 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-02-16 09:49:00,534 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse0 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse0 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-02-16 09:49:02,920 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse0 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse0 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-02-16 09:49:06,177 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) .cse0 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse2 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) .cse2 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse5 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) .cse4 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse5 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse5 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse5 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse5 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) .cse6 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse7 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse7 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-02-16 09:49:08,512 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_4886) .cse1 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) .cse0 v_ArrVal_4894)) .cse1 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse5 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse3 v_ArrVal_4886) .cse4 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) .cse3 v_ArrVal_4894)) .cse4 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse5 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse5 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse5 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse5 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse8 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse6 v_ArrVal_4886) .cse7 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) .cse6 v_ArrVal_4894)) .cse7 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse8 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse8 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse11 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse9 v_ArrVal_4886) .cse10 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) .cse9 v_ArrVal_4894)) .cse10 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse11 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse11 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)))) is different from false [2022-02-16 09:49:10,755 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse0 v_ArrVal_4884) .cse1 v_ArrVal_4886) .cse2 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse0 v_ArrVal_4892)) .cse1 v_ArrVal_4894)) .cse2 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse4 v_ArrVal_4884) .cse5 v_ArrVal_4886) .cse6 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse4 v_ArrVal_4892)) .cse5 v_ArrVal_4894)) .cse6 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse7 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse7 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse11 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse8 v_ArrVal_4884) .cse9 v_ArrVal_4886) .cse10 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse8 v_ArrVal_4892)) .cse9 v_ArrVal_4894)) .cse10 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse11 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse11 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse15 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) .cse12 v_ArrVal_4884) .cse13 v_ArrVal_4886) .cse14 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse12 v_ArrVal_4892)) .cse13 v_ArrVal_4894)) .cse14 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse15 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse15 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-02-16 09:49:13,076 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4882) .cse0 v_ArrVal_4884) .cse1 v_ArrVal_4886) .cse2 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse0 v_ArrVal_4892)) .cse1 v_ArrVal_4894)) .cse2 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4882) .cse4 v_ArrVal_4884) .cse5 v_ArrVal_4886) .cse6 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse4 v_ArrVal_4892)) .cse5 v_ArrVal_4894)) .cse6 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse7 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse7 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|))))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse11 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4882) .cse8 v_ArrVal_4884) .cse9 v_ArrVal_4886) .cse10 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse8 v_ArrVal_4892)) .cse9 v_ArrVal_4894)) .cse10 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse11 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse11 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|))) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse15 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2))) (store (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4882) .cse12 v_ArrVal_4884) .cse13 v_ArrVal_4886) .cse14 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) .cse12 v_ArrVal_4892)) .cse13 v_ArrVal_4894)) .cse14 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse15 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse15 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-02-16 09:49:16,275 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse0 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse0 v_ArrVal_4884) .cse1 v_ArrVal_4886) .cse2 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse0 v_ArrVal_4892)) .cse1 v_ArrVal_4894)) .cse2 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse4 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse4 v_ArrVal_4884) .cse5 v_ArrVal_4886) .cse6 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse4 v_ArrVal_4892)) .cse5 v_ArrVal_4894)) .cse6 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse7 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse7 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse11 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse8 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse8 v_ArrVal_4884) .cse9 v_ArrVal_4886) .cse10 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse8 v_ArrVal_4892)) .cse9 v_ArrVal_4894)) .cse10 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse11 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse11 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse11 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse15 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse12 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse12 v_ArrVal_4884) .cse13 v_ArrVal_4886) .cse14 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse12 v_ArrVal_4892)) .cse13 v_ArrVal_4894)) .cse14 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse15 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse15 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse15 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28)))) is different from false [2022-02-16 09:49:20,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1562 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 1550 trivial. 9 not checked. [2022-02-16 09:49:20,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852292717] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 09:49:20,332 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 09:49:20,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 23] total 42 [2022-02-16 09:49:20,333 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678216527] [2022-02-16 09:49:20,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 09:49:20,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-16 09:49:20,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:49:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-16 09:49:20,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=670, Unknown=18, NotChecked=828, Total=1806 [2022-02-16 09:49:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:49:20,334 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:49:20,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 6.380952380952381) internal successors, (268), 43 states have internal predecessors, (268), 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-02-16 09:49:20,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:49:20,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:49:20,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:49:20,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-02-16 09:49:20,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:49:24,163 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (= (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= |c_~#cache~0.base| 1) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse1 v_ArrVal_4884) .cse2 v_ArrVal_4886) .cse3 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse1 v_ArrVal_4892)) .cse2 v_ArrVal_4894)) .cse3 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse4 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse4 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse8 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse5 v_ArrVal_4884) .cse6 v_ArrVal_4886) .cse7 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse5 v_ArrVal_4892)) .cse6 v_ArrVal_4894)) .cse7 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse8 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse8 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse12 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse9 v_ArrVal_4884) .cse10 v_ArrVal_4886) .cse11 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse9 v_ArrVal_4892)) .cse10 v_ArrVal_4894)) .cse11 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse12 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse12 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse16 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse15 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse13 v_ArrVal_4884) .cse14 v_ArrVal_4886) .cse15 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse13 v_ArrVal_4892)) .cse14 v_ArrVal_4894)) .cse15 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse16 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse16 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-02-16 09:49:27,084 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| 1) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse4 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse4 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-02-16 09:49:29,090 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (+ 141 |c_~#cache~0.offset|)) (.cse1 (+ 140 |c_~#cache~0.offset|)) (.cse0 (select |c_#race| |c_~#cache~0.base|)) (.cse4 (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse5 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse10 (+ 142 |c_~#cache~0.offset|)) (.cse3 (+ 143 |c_~#cache~0.offset|))) (and (= (select .cse0 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= (select .cse0 .cse3) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 140 |c_~#cache~0.offset| .cse4) 0)) (= (select .cse5 .cse1) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select .cse5 .cse3)) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse6 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse6 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse6 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse6 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse6 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| 1) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse7 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse7 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse7 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse7 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 .cse8) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse5 .cse8) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse9 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse9 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse9 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse9 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse9 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.offset| 0) (not (= (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) .cse1)) (not (= (+ 142 |c_~#cache~0.offset| .cse4) 0)) (not (= (+ 139 |c_~#cache~0.offset| .cse4) 0)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (not (= (+ 138 |c_~#cache~0.offset| .cse4) 0)) (= (select .cse0 .cse10) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= (+ 141 |c_~#cache~0.offset| .cse4) 0)) (= (select .cse5 .cse10) |c_ULTIMATE.start_main_#t~nondet41#1|) (not (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse3)))) is different from false [2022-02-16 09:49:31,101 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.base| 1) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse4 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse4 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) is different from false [2022-02-16 09:49:33,108 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse1 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse1 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse1 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse1 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))) (= |c_~#cache~0.base| 1) (= |c_t_funThread1of1ForFork0_#t~post34#1| 0) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (<= |c_t_funThread1of1ForFork0_#t~post34#1| 0) (= |c_~#cache~0.offset| 0) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_#t~post34#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select |c_#race| |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse4 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse4 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) is different from false [2022-02-16 09:49:35,126 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (<= |c_t_funThread1of1ForFork0_~i~0#1| 1) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (= |c_~#cache~0.base| 1) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse1 v_ArrVal_4884) .cse2 v_ArrVal_4886) .cse3 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse1 v_ArrVal_4892)) .cse2 v_ArrVal_4894)) .cse3 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse4 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse4 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse8 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse5 v_ArrVal_4884) .cse6 v_ArrVal_4886) .cse7 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse5 v_ArrVal_4892)) .cse6 v_ArrVal_4894)) .cse7 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse8 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse8 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.offset| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse12 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse9 v_ArrVal_4884) .cse10 v_ArrVal_4886) .cse11 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse9 v_ArrVal_4892)) .cse10 v_ArrVal_4894)) .cse11 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse12 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse12 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse16 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse15 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse13 v_ArrVal_4884) .cse14 v_ArrVal_4886) .cse15 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse13 v_ArrVal_4892)) .cse14 v_ArrVal_4894)) .cse15 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse16 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse16 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-02-16 09:49:37,269 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (and (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 143 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4898 Int) (v_ArrVal_4905 Int)) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| v_ArrVal_4898) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 1) v_ArrVal_4900) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 2) v_ArrVal_4903) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| 3) v_ArrVal_4905)) |c_~#cache~0.base|) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) (= (select .cse0 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= (select .cse0 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (<= (div (+ (* (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) |c_~#cache~0.offset|) (- 28)) 1) (= |c_~#cache~0.base| 1) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse3 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse2 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse1 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse1 v_ArrVal_4884) .cse2 v_ArrVal_4886) .cse3 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse1 v_ArrVal_4892)) .cse2 v_ArrVal_4894)) .cse3 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse4 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse4 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse0 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse8 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse7 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse6 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse5 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse5 v_ArrVal_4884) .cse6 v_ArrVal_4886) .cse7 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse5 v_ArrVal_4892)) .cse6 v_ArrVal_4894)) .cse7 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse8 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse8 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse8 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= |c_~#cache~0.offset| 0) (= (select .cse0 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse12 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse11 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse10 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse9 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse9 v_ArrVal_4884) .cse10 v_ArrVal_4886) .cse11 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse9 v_ArrVal_4892)) .cse10 v_ArrVal_4894)) .cse11 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse12 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse12 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse12 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4889 Int) (v_ArrVal_4900 Int) (v_ArrVal_4886 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4884 Int) (v_ArrVal_4882 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4890 Int) (v_ArrVal_4905 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse16 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (let ((.cse15 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 3))) (store (let ((.cse14 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 2))) (store (let ((.cse13 (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| 1))) (store (store (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4882) .cse13 v_ArrVal_4884) .cse14 v_ArrVal_4886) .cse15 v_ArrVal_4889) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| v_ArrVal_4890) .cse13 v_ArrVal_4892)) .cse14 v_ArrVal_4894)) .cse15 v_ArrVal_4897))) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse16 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse16 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse16 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-02-16 09:50:13,946 WARN L228 SmtUtils]: Spent 24.51s on a formula simplification. DAG size of input: 96 DAG size of output: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-16 09:51:32,791 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#race| |c_~#cache~0.base|))) (and (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse0 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse0 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse0 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse0 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse1 (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse2 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse2 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse2 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse2 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (= (select .cse1 (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.base| 1) (= (select .cse1 (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (= |c_~#cache~0.offset| 0) (= (select .cse1 (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (= (select (let ((.cse3 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse3 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse3 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse3 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 141 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (forall ((|aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int) (v_ArrVal_4903 Int) (v_ArrVal_4900 Int) (v_ArrVal_4897 Int) (v_ArrVal_4898 Int) (v_ArrVal_4894 Int) (v_ArrVal_4892 Int) (v_ArrVal_4905 Int) (v_ArrVal_4890 Int) (|aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| Int)) (or (> 0 |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (= (select (let ((.cse4 (* |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))) (store (store (store (store (select (store |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (store (store (store (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_4890) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 1) v_ArrVal_4892) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 2) v_ArrVal_4894) (+ |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 3) v_ArrVal_4897)) |c_~#cache~0.base|) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 1) v_ArrVal_4898) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 2 .cse4 |c_~#cache~0.offset|) v_ArrVal_4900) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 3 .cse4 |c_~#cache~0.offset|) v_ArrVal_4903) (+ |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| .cse4 |c_~#cache~0.offset| 4) v_ArrVal_4905)) (+ 142 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|) (< |c_t_funThread1of1ForFork0_~i~0#1| |aux_div_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113|) (>= |aux_mod_v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52_113| 28))))) is different from false [2022-02-16 09:51:52,224 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 173646 transitions and produced 95823 states. [2022-02-16 09:51:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:51:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:51:52,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:51:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:51:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-16 09:51:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-16 09:51:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-16 09:51:52,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-16 09:51:52,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:51:52,445 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2022-02-16 09:51:52,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 09:51:52,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1693858163, now seen corresponding path program 4 times [2022-02-16 09:51:52,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 09:51:52,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81188087] [2022-02-16 09:51:52,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 09:51:52,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 09:51:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 09:51:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1563 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1550 trivial. 0 not checked. [2022-02-16 09:51:54,249 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 09:51:54,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81188087] [2022-02-16 09:51:54,249 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81188087] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 09:51:54,249 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911647713] [2022-02-16 09:51:54,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-16 09:51:54,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:51:54,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 09:51:54,250 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-16 09:51:54,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process Received shutdown request... [2022-02-16 09:56:00,873 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-02-16 09:56:00,873 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-02-16 09:56:00,873 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-16 09:56:01,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-02-16 09:56:02,083 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forcibly destroying the process [2022-02-16 09:56:02,083 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-02-16 09:56:02,111 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-16 09:56:02,111 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-16 09:56:02,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-16 09:56:02,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538180531] [2022-02-16 09:56:02,111 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-16 09:56:02,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-16 09:56:02,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 09:56:02,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-16 09:56:02,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2022-02-16 09:56:02,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:56:02,112 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 09:56:02,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.923076923076923) internal successors, (116), 14 states have internal predecessors, (116), 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-02-16 09:56:02,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:56:02,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:56:02,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 09:56:02,112 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-02-16 09:56:02,113 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 09:56:02,121 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forcibly destroying the process [2022-02-16 09:56:02,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 09:56:02,122 WARN L594 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-02-16 09:56:02,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-02-16 09:56:02,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-02-16 09:56:02,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-02-16 09:56:02,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-02-16 09:56:02,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 9 remaining) [2022-02-16 09:56:02,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2022-02-16 09:56:02,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-02-16 09:56:02,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-02-16 09:56:02,124 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-02-16 09:56:02,128 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-16 09:56:02,131 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-16 09:56:02,131 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-16 09:56:02,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-02-16 09:56:02,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 137 [2022-02-16 09:56:02,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 09:56:02 BasicIcfg [2022-02-16 09:56:02,135 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-16 09:56:02,136 INFO L158 Benchmark]: Toolchain (without parser) took 862385.36ms. Allocated memory was 180.4MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 123.6MB in the beginning and 927.8MB in the end (delta: -804.2MB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2022-02-16 09:56:02,136 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory was 142.2MB in the beginning and 142.1MB in the end (delta: 70.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-02-16 09:56:02,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 430.43ms. Allocated memory is still 180.4MB. Free memory was 123.3MB in the beginning and 135.3MB in the end (delta: -12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-16 09:56:02,136 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.12ms. Allocated memory is still 180.4MB. Free memory was 135.3MB in the beginning and 132.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-16 09:56:02,136 INFO L158 Benchmark]: Boogie Preprocessor took 28.03ms. Allocated memory is still 180.4MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-16 09:56:02,136 INFO L158 Benchmark]: RCFGBuilder took 307.05ms. Allocated memory is still 180.4MB. Free memory was 130.2MB in the beginning and 114.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-02-16 09:56:02,137 INFO L158 Benchmark]: TraceAbstraction took 861567.80ms. Allocated memory was 180.4MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 113.9MB in the beginning and 927.8MB in the end (delta: -813.9MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-02-16 09:56:02,137 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory was 142.2MB in the beginning and 142.1MB in the end (delta: 70.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 430.43ms. Allocated memory is still 180.4MB. Free memory was 123.3MB in the beginning and 135.3MB in the end (delta: -12.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.12ms. Allocated memory is still 180.4MB. Free memory was 135.3MB in the beginning and 132.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.03ms. Allocated memory is still 180.4MB. Free memory was 132.3MB in the beginning and 130.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 307.05ms. Allocated memory is still 180.4MB. Free memory was 130.2MB in the beginning and 114.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 861567.80ms. Allocated memory was 180.4MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 113.9MB in the beginning and 927.8MB in the end (delta: -813.9MB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 940]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 940]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 937]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 158 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 861.4s, OverallIterations: 23, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 338.2s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 308, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 268.6s InterpolantComputationTime, 7740 NumberOfCodeBlocks, 7081 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 9547 ConstructedInterpolants, 118 QuantifiedInterpolants, 63701 SizeOfPredicates, 74 NumberOfNonLiveVariables, 4955 ConjunctsInSsa, 304 ConjunctsInUnsatCore, 44 InterpolantComputations, 14 PerfectInterpolantSequences, 27977/29800 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