/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-09 22:59:34,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-09 22:59:34,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-09 22:59:34,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-09 22:59:34,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-09 22:59:34,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-09 22:59:34,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-09 22:59:34,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-09 22:59:34,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-09 22:59:34,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-09 22:59:34,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-09 22:59:34,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-09 22:59:34,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-09 22:59:34,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-09 22:59:34,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-09 22:59:34,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-09 22:59:34,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-09 22:59:34,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-09 22:59:34,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-09 22:59:34,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-09 22:59:34,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-09 22:59:34,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-09 22:59:34,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-09 22:59:34,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-09 22:59:34,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-09 22:59:34,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-09 22:59:34,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-09 22:59:34,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-09 22:59:34,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-09 22:59:34,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-09 22:59:34,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-09 22:59:34,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-09 22:59:34,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-09 22:59:34,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-09 22:59:34,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-09 22:59:34,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-09 22:59:34,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-09 22:59:34,599 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-09 22:59:34,599 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-09 22:59:34,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-09 22:59:34,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-09 22:59:34,603 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-09 22:59:34,628 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-09 22:59:34,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-09 22:59:34,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-09 22:59:34,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-09 22:59:34,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-09 22:59:34,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-09 22:59:34,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-09 22:59:34,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-09 22:59:34,629 INFO L138 SettingsManager]: * Use SBE=true [2022-02-09 22:59:34,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-09 22:59:34,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-09 22:59:34,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-09 22:59:34,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-09 22:59:34,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-09 22:59:34,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-09 22:59:34,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 22:59:34,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-09 22:59:34,631 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-09 22:59:34,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-09 22:59:34,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-09 22:59:34,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-09 22:59:34,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-09 22:59:34,633 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-09 22:59:34,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-09 22:59:34,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-09 22:59:34,633 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-02-09 22:59:34,634 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-09 22:59:34,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-09 22:59:34,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-09 22:59:34,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-09 22:59:34,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-09 22:59:34,813 INFO L275 PluginConnector]: CDTParser initialized [2022-02-09 22:59:34,814 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-09 22:59:34,853 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f255ab22e/4b5d207a4ea845729d3438029beccfd1/FLAG9bf93e566 [2022-02-09 22:59:35,287 INFO L306 CDTParser]: Found 1 translation units. [2022-02-09 22:59:35,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_03-funloop_simple.i [2022-02-09 22:59:35,302 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f255ab22e/4b5d207a4ea845729d3438029beccfd1/FLAG9bf93e566 [2022-02-09 22:59:35,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f255ab22e/4b5d207a4ea845729d3438029beccfd1 [2022-02-09 22:59:35,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-09 22:59:35,645 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-09 22:59:35,647 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-09 22:59:35,648 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-09 22:59:35,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-09 22:59:35,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 10:59:35" (1/1) ... [2022-02-09 22:59:35,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33c008b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:35, skipping insertion in model container [2022-02-09 22:59:35,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 10:59:35" (1/1) ... [2022-02-09 22:59:35,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-09 22:59:35,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-09 22:59:36,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 22:59:36,025 INFO L203 MainTranslator]: Completed pre-run [2022-02-09 22:59:36,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-09 22:59:36,093 INFO L208 MainTranslator]: Completed translation [2022-02-09 22:59:36,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36 WrapperNode [2022-02-09 22:59:36,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-09 22:59:36,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-09 22:59:36,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-09 22:59:36,094 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-09 22:59:36,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,108 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,123 INFO L137 Inliner]: procedures = 262, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2022-02-09 22:59:36,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-09 22:59:36,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-09 22:59:36,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-09 22:59:36,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-09 22:59:36,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,132 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,142 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-09 22:59:36,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-09 22:59:36,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-09 22:59:36,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-09 22:59:36,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (1/1) ... [2022-02-09 22:59:36,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-09 22:59:36,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:36,189 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-09 22:59:36,200 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-09 22:59:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-09 22:59:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-09 22:59:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-09 22:59:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-09 22:59:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-09 22:59:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-09 22:59:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-09 22:59:36,231 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-09 22:59:36,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-09 22:59:36,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-09 22:59:36,232 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-09 22:59:36,303 INFO L234 CfgBuilder]: Building ICFG [2022-02-09 22:59:36,304 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-09 22:59:36,563 INFO L275 CfgBuilder]: Performing block encoding [2022-02-09 22:59:36,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-09 22:59:36,569 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-09 22:59:36,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 10:59:36 BoogieIcfgContainer [2022-02-09 22:59:36,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-09 22:59:36,571 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-09 22:59:36,571 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-09 22:59:36,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-09 22:59:36,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.02 10:59:35" (1/3) ... [2022-02-09 22:59:36,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3252e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 10:59:36, skipping insertion in model container [2022-02-09 22:59:36,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 10:59:36" (2/3) ... [2022-02-09 22:59:36,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f3252e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.02 10:59:36, skipping insertion in model container [2022-02-09 22:59:36,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 10:59:36" (3/3) ... [2022-02-09 22:59:36,575 INFO L111 eAbstractionObserver]: Analyzing ICFG 06-symbeq_03-funloop_simple.i [2022-02-09 22:59:36,578 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-09 22:59:36,578 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-09 22:59:36,578 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-02-09 22:59:36,578 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-09 22:59:36,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,605 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,606 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,607 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,608 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,608 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-09 22:59:36,608 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-09 22:59:36,609 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,609 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-09 22:59:36,609 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-09 22:59:36,609 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-09 22:59:36,609 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-09 22:59:36,609 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-09 22:59:36,609 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-09 22:59:36,610 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-09 22:59:36,610 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-09 22:59:36,610 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-09 22:59:36,610 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-09 22:59:36,610 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-09 22:59:36,610 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-09 22:59:36,610 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-09 22:59:36,610 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-09 22:59:36,610 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-09 22:59:36,610 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-09 22:59:36,611 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-09 22:59:36,611 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-09 22:59:36,611 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-09 22:59:36,611 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-09 22:59:36,611 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-09 22:59:36,611 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-09 22:59:36,611 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-09 22:59:36,611 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-09 22:59:36,611 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-09 22:59:36,612 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-09 22:59:36,612 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-09 22:59:36,612 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-09 22:59:36,612 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-09 22:59:36,612 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-09 22:59:36,612 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-09 22:59:36,612 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-09 22:59:36,613 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-09 22:59:36,613 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-09 22:59:36,613 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-09 22:59:36,613 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-09 22:59:36,613 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-09 22:59:36,613 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-09 22:59:36,613 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-09 22:59:36,613 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-09 22:59:36,614 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-09 22:59:36,614 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-09 22:59:36,614 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-09 22:59:36,614 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-09 22:59:36,614 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-09 22:59:36,614 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-09 22:59:36,614 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-09 22:59:36,615 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-09 22:59:36,615 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-09 22:59:36,615 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-09 22:59:36,615 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-09 22:59:36,615 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-09 22:59:36,615 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-09 22:59:36,615 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-09 22:59:36,616 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-09 22:59:36,616 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-09 22:59:36,616 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-09 22:59:36,616 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-09 22:59:36,617 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-09 22:59:36,617 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-09 22:59:36,617 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-09 22:59:36,617 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-09 22:59:36,617 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-09 22:59:36,617 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-09 22:59:36,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-09 22:59:36,618 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-09 22:59:36,618 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-09 22:59:36,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-09 22:59:36,618 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-09 22:59:36,618 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-09 22:59:36,618 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,621 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,621 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,623 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,623 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,624 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,624 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,626 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,626 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,632 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-09 22:59:36,632 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-09 22:59:36,632 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,634 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,635 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,636 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,636 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,639 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,639 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-09 22:59:36,639 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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,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-09 22:59:36,641 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-09 22:59:36,641 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-09 22:59:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,641 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-09 22:59:36,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-09 22:59:36,644 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-09 22:59:36,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-09 22:59:36,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:36,695 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-09 22:59:36,735 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-09 22:59:36,740 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-09 22:59:36,745 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-09 22:59:36,746 INFO L340 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-02-09 22:59:36,797 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-02-09 22:59:36,798 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-09 22:59:36,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:36,802 INFO L85 PathProgramCache]: Analyzing trace with hash 397060765, now seen corresponding path program 1 times [2022-02-09 22:59:36,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:36,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591896676] [2022-02-09 22:59:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:36,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:36,953 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-09 22:59:36,954 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:36,954 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591896676] [2022-02-09 22:59:36,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591896676] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:36,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 22:59:36,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-09 22:59:36,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351681692] [2022-02-09 22:59:36,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:36,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-09 22:59:36,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:36,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-09 22:59:36,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-09 22:59:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:36,979 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:36,980 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-09 22:59:36,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:36,991 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44 transitions and produced 45 states. [2022-02-09 22:59:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:36,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-09 22:59:36,992 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-09 22:59:36,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:36,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1657093153, now seen corresponding path program 1 times [2022-02-09 22:59:36,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:36,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118060002] [2022-02-09 22:59:36,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:36,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:37,064 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-09 22:59:37,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:37,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118060002] [2022-02-09 22:59:37,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118060002] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:37,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 22:59:37,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-09 22:59:37,065 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50634753] [2022-02-09 22:59:37,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:37,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 22:59:37,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:37,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 22:59:37,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-09 22:59:37,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,067 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:37,067 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-09 22:59:37,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,088 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 51 transitions and produced 52 states. [2022-02-09 22:59:37,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:37,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-09 22:59:37,089 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-09 22:59:37,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1891473138, now seen corresponding path program 1 times [2022-02-09 22:59:37,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:37,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463897516] [2022-02-09 22:59:37,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:37,090 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:37,187 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-09 22:59:37,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:37,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463897516] [2022-02-09 22:59:37,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463897516] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:37,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672335541] [2022-02-09 22:59:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:37,188 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:37,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:37,200 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-09 22:59:37,201 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-09 22:59:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:37,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-09 22:59:37,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:37,386 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-09 22:59:37,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 22:59:37,386 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672335541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:37,386 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 22:59:37,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-02-09 22:59:37,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270291499] [2022-02-09 22:59:37,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:37,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-09 22:59:37,387 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:37,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-09 22:59:37,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-09 22:59:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,388 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:37,388 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-09 22:59:37,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:37,388 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,402 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 63 transitions and produced 64 states. [2022-02-09 22:59:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:37,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:37,421 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-09 22:59:37,620 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-09 22:59:37,621 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-09 22:59:37,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1317859348, now seen corresponding path program 1 times [2022-02-09 22:59:37,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:37,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302704388] [2022-02-09 22:59:37,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:37,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:37,704 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-09 22:59:37,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:37,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302704388] [2022-02-09 22:59:37,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302704388] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:37,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775098847] [2022-02-09 22:59:37,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:37,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:37,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:37,707 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-09 22:59:37,708 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-09 22:59:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:37,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-09 22:59:37,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:37,869 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-09 22:59:37,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 22:59:37,938 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-09 22:59:37,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775098847] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 22:59:37,938 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 22:59:37,939 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-09 22:59:37,939 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796779549] [2022-02-09 22:59:37,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 22:59:37,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 22:59:37,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:37,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 22:59:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-09 22:59:37,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,940 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:37,940 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-09 22:59:37,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:37,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:37,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,997 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 77 transitions and produced 78 states. [2022-02-09 22:59:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:37,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:38,016 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-09 22:59:38,214 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-09 22:59:38,214 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-09 22:59:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:38,215 INFO L85 PathProgramCache]: Analyzing trace with hash -626594124, now seen corresponding path program 2 times [2022-02-09 22:59:38,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:38,215 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191082609] [2022-02-09 22:59:38,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:38,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:38,282 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-09 22:59:38,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:38,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191082609] [2022-02-09 22:59:38,283 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191082609] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:38,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262630791] [2022-02-09 22:59:38,283 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 22:59:38,283 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:38,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:38,284 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-09 22:59:38,306 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-09 22:59:38,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 22:59:38,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 22:59:38,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-09 22:59:38,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:38,467 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-09 22:59:38,491 INFO L353 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-09 22:59:38,491 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-09 22:59:38,529 INFO L353 Elim1Store]: treesize reduction 56, result has 23.3 percent of original size [2022-02-09 22:59:38,529 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-09 22:59:38,581 INFO L353 Elim1Store]: treesize reduction 104, result has 20.0 percent of original size [2022-02-09 22:59:38,581 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-09 22:59:38,602 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-09 22:59:38,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 22:59:38,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262630791] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:38,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 22:59:38,602 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2022-02-09 22:59:38,602 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378447855] [2022-02-09 22:59:38,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:38,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 22:59:38,603 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:38,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 22:59:38,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-02-09 22:59:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:38,604 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:38,604 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-09 22:59:38,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:38,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:38,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:38,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:38,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:38,639 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 94 transitions and produced 95 states. [2022-02-09 22:59:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:38,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-09 22:59:38,858 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-09 22:59:38,859 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-09 22:59:38,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:38,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1568821428, now seen corresponding path program 1 times [2022-02-09 22:59:38,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:38,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801173163] [2022-02-09 22:59:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:38,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:38,927 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-09 22:59:38,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:38,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801173163] [2022-02-09 22:59:38,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801173163] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:38,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511394485] [2022-02-09 22:59:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:38,928 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:38,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:38,934 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-09 22:59:38,979 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-09 22:59:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:39,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-09 22:59:39,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:39,136 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-09 22:59:39,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 22:59:39,260 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-09 22:59:39,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511394485] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 22:59:39,260 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 22:59:39,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-09 22:59:39,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998982790] [2022-02-09 22:59:39,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 22:59:39,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-09 22:59:39,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:39,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-09 22:59:39,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-09 22:59:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:39,262 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:39,262 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-09 22:59:39,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:39,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:39,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:39,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:39,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:39,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:39,387 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 122 transitions and produced 115 states. [2022-02-09 22:59:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:39,406 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-09 22:59:39,604 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-09 22:59:39,604 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-09 22:59:39,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:39,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1158747276, now seen corresponding path program 2 times [2022-02-09 22:59:39,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:39,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666475601] [2022-02-09 22:59:39,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:39,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:39,756 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-09 22:59:39,756 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:39,756 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666475601] [2022-02-09 22:59:39,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666475601] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:39,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210337911] [2022-02-09 22:59:39,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 22:59:39,757 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:39,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:39,758 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-09 22:59:39,771 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-09 22:59:39,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 22:59:39,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 22:59:39,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-09 22:59:39,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:40,021 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-09 22:59:40,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,047 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-09 22:59:40,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,078 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 22:59:40,079 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-09 22:59:40,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:40,115 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-09 22:59:40,115 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-09 22:59:40,138 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-09 22:59:40,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 22:59:40,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210337911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:40,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 22:59:40,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [17] total 25 [2022-02-09 22:59:40,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456693796] [2022-02-09 22:59:40,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:40,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-09 22:59:40,140 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:40,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-09 22:59:40,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-02-09 22:59:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:40,142 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:40,143 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-09 22:59:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:40,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:40,350 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 155 transitions and produced 148 states. [2022-02-09 22:59:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:40,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 22:59:40,367 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-09 22:59:40,566 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-09 22:59:40,567 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-09 22:59:40,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:40,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1001729759, now seen corresponding path program 1 times [2022-02-09 22:59:40,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:40,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722448721] [2022-02-09 22:59:40,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:40,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:40,618 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-09 22:59:40,618 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:40,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722448721] [2022-02-09 22:59:40,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722448721] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:40,618 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040032736] [2022-02-09 22:59:40,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:40,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:40,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:40,622 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-09 22:59:40,622 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-09 22:59:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:40,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-09 22:59:40,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:40,918 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-09 22:59:40,918 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 22:59:41,080 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-09 22:59:41,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040032736] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 22:59:41,080 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 22:59:41,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 17, 17] total 24 [2022-02-09 22:59:41,081 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773605883] [2022-02-09 22:59:41,081 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 22:59:41,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-09 22:59:41,081 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:41,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-09 22:59:41,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-02-09 22:59:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:41,082 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:41,082 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-09 22:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-09 22:59:41,082 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:41,372 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 205 transitions and produced 193 states. [2022-02-09 22:59:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:41,391 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-09 22:59:41,583 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-09 22:59:41,583 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-09 22:59:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2116870732, now seen corresponding path program 1 times [2022-02-09 22:59:41,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:41,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487451988] [2022-02-09 22:59:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:41,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:41,700 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-09 22:59:41,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:41,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487451988] [2022-02-09 22:59:41,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487451988] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:41,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 22:59:41,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 22:59:41,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093005724] [2022-02-09 22:59:41,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:41,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 22:59:41,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:41,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 22:59:41,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 22:59:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:41,702 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:41,702 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-09 22:59:41,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:41,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:41,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:41,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:41,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:41,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:41,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:41,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:41,703 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:41,753 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 238 transitions and produced 226 states. [2022-02-09 22:59:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:41,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:41,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-09 22:59:41,754 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-09 22:59:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:41,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1162619167, now seen corresponding path program 2 times [2022-02-09 22:59:41,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:41,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234906700] [2022-02-09 22:59:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:41,755 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:41,854 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-09 22:59:41,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:41,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234906700] [2022-02-09 22:59:41,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234906700] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:41,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447511683] [2022-02-09 22:59:41,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 22:59:41,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:41,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:41,872 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-09 22:59:41,887 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-09 22:59:41,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 22:59:41,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 22:59:41,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-09 22:59:41,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:42,146 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-09 22:59:42,162 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-09 22:59:42,162 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-09 22:59:42,189 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-02-09 22:59:42,190 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-09 22:59:42,266 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-02-09 22:59:42,267 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-09 22:59:42,282 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-09 22:59:42,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 22:59:42,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447511683] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:42,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 22:59:42,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2022-02-09 22:59:42,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629335145] [2022-02-09 22:59:42,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:42,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 22:59:42,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:42,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 22:59:42,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-09 22:59:42,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:42,283 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:42,283 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-09 22:59:42,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:42,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:42,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:42,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:42,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:42,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:42,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:42,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:42,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:42,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:42,358 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 255 transitions and produced 243 states. [2022-02-09 22:59:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:42,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:42,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:42,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-09 22:59:42,575 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-09 22:59:42,575 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-09 22:59:42,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1757402922, now seen corresponding path program 1 times [2022-02-09 22:59:42,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:42,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927871267] [2022-02-09 22:59:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:42,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:42,642 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-09 22:59:42,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:42,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927871267] [2022-02-09 22:59:42,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927871267] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:42,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179924583] [2022-02-09 22:59:42,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:42,643 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:42,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:42,660 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-09 22:59:42,679 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-09 22:59:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:42,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-09 22:59:42,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:42,987 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-09 22:59:42,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 22:59:43,174 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-09 22:59:43,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179924583] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 22:59:43,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 22:59:43,174 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-02-09 22:59:43,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797385704] [2022-02-09 22:59:43,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 22:59:43,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 22:59:43,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 22:59:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-02-09 22:59:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:43,175 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:43,176 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-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:43,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:43,295 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 441 transitions and produced 429 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:43,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:43,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:43,316 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-09 22:59:43,510 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-09 22:59:43,511 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-09 22:59:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash -106070791, now seen corresponding path program 2 times [2022-02-09 22:59:43,512 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:43,512 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407873513] [2022-02-09 22:59:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:43,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:43,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:43,709 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-09 22:59:43,709 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:43,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407873513] [2022-02-09 22:59:43,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407873513] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:43,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559153386] [2022-02-09 22:59:43,709 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 22:59:43,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:43,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:43,711 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-09 22:59:43,712 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-09 22:59:43,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-09 22:59:43,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 22:59:43,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-09 22:59:43,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:44,114 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-09 22:59:44,136 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-09 22:59:44,136 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-09 22:59:44,165 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-02-09 22:59:44,166 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-09 22:59:44,217 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-02-09 22:59:44,217 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-09 22:59:44,236 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-09 22:59:44,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-09 22:59:44,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559153386] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:44,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-09 22:59:44,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2022-02-09 22:59:44,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334916878] [2022-02-09 22:59:44,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:44,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 22:59:44,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:44,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 22:59:44,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-02-09 22:59:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:44,238 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:44,238 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-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:44,238 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:44,337 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 476 transitions and produced 464 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:44,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:44,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-09 22:59:44,558 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-09 22:59:44,558 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-09 22:59:44,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:44,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1731045646, now seen corresponding path program 1 times [2022-02-09 22:59:44,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:44,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694846223] [2022-02-09 22:59:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:44,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:44,717 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-09 22:59:44,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:44,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694846223] [2022-02-09 22:59:44,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694846223] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:44,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009752869] [2022-02-09 22:59:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:44,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:44,719 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-09 22:59:44,747 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-09 22:59:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:44,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-09 22:59:44,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:45,318 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-09 22:59:45,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 22:59:45,723 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-09 22:59:45,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009752869] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 22:59:45,724 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 22:59:45,724 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2022-02-09 22:59:45,724 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394864324] [2022-02-09 22:59:45,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 22:59:45,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-09 22:59:45,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:45,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-09 22:59:45,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-09 22:59:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:45,725 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:45,725 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-09 22:59:45,725 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:45,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:45,966 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 786 transitions and produced 774 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:45,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:45,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:45,984 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-09 22:59:46,175 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-09 22:59:46,175 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-09 22:59:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -986440607, now seen corresponding path program 2 times [2022-02-09 22:59:46,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:46,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891671092] [2022-02-09 22:59:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:46,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:46,404 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-09 22:59:46,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:46,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891671092] [2022-02-09 22:59:46,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891671092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:46,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 22:59:46,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 22:59:46,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139047993] [2022-02-09 22:59:46,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:46,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 22:59:46,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:46,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 22:59:46,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 22:59:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:46,405 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:46,406 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-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:46,406 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:46,514 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 795 transitions and produced 783 states. [2022-02-09 22:59:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-09 22:59:46,516 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-09 22:59:46,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:46,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1833760666, now seen corresponding path program 1 times [2022-02-09 22:59:46,516 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:46,516 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422946342] [2022-02-09 22:59:46,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:46,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:46,685 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-09 22:59:46,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:46,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422946342] [2022-02-09 22:59:46,685 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422946342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:46,685 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 22:59:46,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-09 22:59:46,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008529749] [2022-02-09 22:59:46,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:46,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-09 22:59:46,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:46,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-09 22:59:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-09 22:59:46,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:46,687 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:46,687 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-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:46,687 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:46,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:48,046 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 34978 transitions and produced 19317 states. [2022-02-09 22:59:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:48,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:48,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-09 22:59:48,048 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-09 22:59:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1924795105, now seen corresponding path program 1 times [2022-02-09 22:59:48,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:48,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533031359] [2022-02-09 22:59:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:48,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:48,341 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-09 22:59:48,341 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:48,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533031359] [2022-02-09 22:59:48,342 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533031359] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:48,342 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 22:59:48,342 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-09 22:59:48,342 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11052509] [2022-02-09 22:59:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:48,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-09 22:59:48,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-09 22:59:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-09 22:59:48,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:48,343 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:48,343 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-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:48,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:48,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:48,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:49,092 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17833 transitions and produced 10015 states. [2022-02-09 22:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:49,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:49,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-09 22:59:49,093 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-09 22:59:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash -460892034, now seen corresponding path program 1 times [2022-02-09 22:59:49,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:49,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038297102] [2022-02-09 22:59:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:49,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:49,444 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-09 22:59:49,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:49,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038297102] [2022-02-09 22:59:49,445 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038297102] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:49,445 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 22:59:49,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-09 22:59:49,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619257532] [2022-02-09 22:59:49,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:49,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-09 22:59:49,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-09 22:59:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-09 22:59:49,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:49,447 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:49,447 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-09 22:59:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,447 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:49,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:50,196 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17841 transitions and produced 10023 states. [2022-02-09 22:59:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:50,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:50,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-09 22:59:50,197 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-09 22:59:50,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:50,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1402749280, now seen corresponding path program 1 times [2022-02-09 22:59:50,198 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:50,198 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200568378] [2022-02-09 22:59:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:50,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:50,539 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-09 22:59:50,540 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:50,540 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200568378] [2022-02-09 22:59:50,540 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200568378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:50,540 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 22:59:50,540 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-09 22:59:50,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298682672] [2022-02-09 22:59:50,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:50,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-09 22:59:50,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:50,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-09 22:59:50,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-09 22:59:50,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:50,541 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:50,541 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-09 22:59:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:50,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:50,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:51,337 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 17856 transitions and produced 10035 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:51,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:51,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:51,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-09 22:59:51,338 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-09 22:59:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:51,339 INFO L85 PathProgramCache]: Analyzing trace with hash -535552803, now seen corresponding path program 1 times [2022-02-09 22:59:51,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:51,339 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146578107] [2022-02-09 22:59:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:51,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:51,699 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-09 22:59:51,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:51,700 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146578107] [2022-02-09 22:59:51,700 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146578107] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-09 22:59:51,700 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-09 22:59:51,700 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-09 22:59:51,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334006096] [2022-02-09 22:59:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-09 22:59:51,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-09 22:59:51,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 22:59:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-09 22:59:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-02-09 22:59:51,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:51,701 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 22:59:51,701 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-09 22:59:51,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:51,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:51,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:51,702 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:56,659 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 135633 transitions and produced 73961 states. [2022-02-09 22:59:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 22:59:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 22:59:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 22:59:56,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-09 22:59:56,661 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-09 22:59:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 22:59:56,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2082690448, now seen corresponding path program 1 times [2022-02-09 22:59:56,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 22:59:56,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387971688] [2022-02-09 22:59:56,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:56,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 22:59:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:57,844 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-09 22:59:57,844 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 22:59:57,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387971688] [2022-02-09 22:59:57,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387971688] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 22:59:57,844 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343367284] [2022-02-09 22:59:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 22:59:57,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 22:59:57,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 22:59:57,851 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-09 22:59:57,852 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-09 22:59:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 22:59:58,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 1234 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-09 22:59:58,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 22:59:58,764 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-09 22:59:58,797 INFO L353 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-02-09 22:59:58,797 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-09 22:59:58,826 INFO L353 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2022-02-09 22:59:58,826 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-09 22:59:58,863 INFO L353 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2022-02-09 22:59:58,864 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-09 22:59:59,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,132 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-09 22:59:59,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,160 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-09 22:59:59,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,190 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-09 22:59:59,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,214 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-09 22:59:59,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,299 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-09 22:59:59,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,332 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-09 22:59:59,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,358 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-09 22:59:59,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 22:59:59,394 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-09 22:59:59,828 INFO L353 Elim1Store]: treesize reduction 216, result has 14.6 percent of original size [2022-02-09 22:59:59,828 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-09 22:59:59,838 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-09 22:59:59,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 23:00:35,342 WARN L228 SmtUtils]: Spent 7.67s 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-09 23:01:09,054 WARN L228 SmtUtils]: Spent 9.34s 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-09 23:01:11,727 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-09 23:01:13,911 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-09 23:01:16,298 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-09 23:01:18,514 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-09 23:01:21,622 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-09 23:01:23,833 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-09 23:01:26,119 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-09 23:01:28,343 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-09 23:01:31,730 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-09 23:01:54,029 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-09 23:01:54,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343367284] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 23:01:54,029 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 23:01:54,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 20] total 39 [2022-02-09 23:01:54,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093543391] [2022-02-09 23:01:54,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 23:01:54,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-02-09 23:01:54,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 23:01:54,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-02-09 23:01:54,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=648, Unknown=42, NotChecked=594, Total=1560 [2022-02-09 23:01:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:01:54,031 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 23:01:54,031 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-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:01:54,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-09 23:01:54,032 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:01:57,063 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-09 23:02:08,524 WARN L228 SmtUtils]: Spent 11.40s 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-09 23:02:10,101 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-09 23:02:12,046 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-09 23:02:14,338 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-09 23:02:16,348 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-09 23:02:59,526 WARN L228 SmtUtils]: Spent 17.32s 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-09 23:03:01,533 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-09 23:03:03,545 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-09 23:03:59,778 WARN L228 SmtUtils]: Spent 24.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-09 23:04:01,854 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-09 23:04:03,936 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-09 23:04:09,293 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-09 23:04:09,840 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 124209 transitions and produced 68970 states. [2022-02-09 23:04:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:04:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:04:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 23:04:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-09 23:04:09,862 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-09 23:04:10,056 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-09 23:04:10,056 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-09 23:04:10,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 23:04:10,057 INFO L85 PathProgramCache]: Analyzing trace with hash -138892593, now seen corresponding path program 2 times [2022-02-09 23:04:10,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 23:04:10,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313637578] [2022-02-09 23:04:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 23:04:10,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 23:04:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 23:04:11,838 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-09 23:04:11,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 23:04:11,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313637578] [2022-02-09 23:04:11,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313637578] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 23:04:11,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400560341] [2022-02-09 23:04:11,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-09 23:04:11,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 23:04:11,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 23:04:11,841 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-09 23:04:11,842 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-09 23:04:12,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-09 23:04:12,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 23:04:12,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 63 conjunts are in the unsatisfiable core [2022-02-09 23:04:12,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 23:04:14,824 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-09 23:04:14,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:14,888 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-09 23:04:14,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:14,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:14,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:14,987 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-09 23:04:15,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,093 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-09 23:04:15,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,817 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-09 23:04:15,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,881 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-09 23:04:15,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,943 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-09 23:04:15,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:15,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,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-09 23:04:16,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,219 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-09 23:04:16,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,279 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-09 23:04:16,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,350 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-09 23:04:16,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:16,389 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-09 23:04:17,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,081 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-09 23:04:17,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:04:17,127 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-09 23:04:17,146 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-09 23:04:17,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 23:04:54,567 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)) (= (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 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |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)) (= (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 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |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)) (= (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 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |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)) (= (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 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |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-09 23:04:56,663 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-09 23:05:43,221 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-09 23:05:56,633 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-09 23:05:56,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400560341] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 23:05:56,633 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 23:05:56,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 17] total 36 [2022-02-09 23:05:56,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197577950] [2022-02-09 23:05:56,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 23:05:56,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-02-09 23:05:56,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 23:05:56,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-02-09 23:05:56,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=794, Unknown=40, NotChecked=198, Total=1332 [2022-02-09 23:05:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:05:56,635 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 23:05:56,635 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-09 23:05:56,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:05:56,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:05:56,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-09 23:05:56,636 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:06:02,021 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-09 23:06: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|) (= (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-09 23:06:06,100 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)) (= (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 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |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)) (= (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 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |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)) (= (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 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |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)) (= (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 (select |c_#race| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (+ |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-09 23:06:19,460 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-09 23:06:21,504 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 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 (* |c_t_funThread1of1ForFork0_~i~0#1| 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)) (+ 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 ((.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)) (+ 142 |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)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (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)) (+ 141 |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)) (+ 143 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|))))) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= (select (let ((.cse6 (* |c_t_funThread1of1ForFork0_~i~0#1| 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)) (+ 140 |c_~#cache~0.offset|)) |c_ULTIMATE.start_main_#t~nondet41#1|)) (forall ((v_ArrVal_4283 Int) (v_ArrVal_4281 Int)) (= |c_ULTIMATE.start_main_#t~nondet41#1| (select (let ((.cse7 (* |c_t_funThread1of1ForFork0_~i~0#1| 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)) (+ 141 |c_~#cache~0.offset|))))) is different from false [2022-02-09 23:06:44,001 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 163529 transitions and produced 90587 states. [2022-02-09 23:06:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:06:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:06:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:06:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:06:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:06:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:06:44,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:06:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 23:06:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-09 23:06:44,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:06:44,022 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-09 23:06:44,219 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-09 23:06:44,219 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-09 23:06:44,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 23:06:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash -331735314, now seen corresponding path program 3 times [2022-02-09 23:06:44,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 23:06:44,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613755311] [2022-02-09 23:06:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 23:06:44,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 23:06:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 23:06:46,364 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-09 23:06:46,364 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 23:06:46,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613755311] [2022-02-09 23:06:46,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613755311] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 23:06:46,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718826496] [2022-02-09 23:06:46,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-09 23:06:46,364 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 23:06:46,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 23:06:46,365 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-09 23:06:46,366 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-09 23:06:46,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-09 23:06:46,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-09 23:06:46,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-09 23:06:46,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-09 23:06:48,980 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-09 23:06:49,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,041 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-09 23:06:49,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,093 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-09 23:06:49,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,148 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-09 23:06:49,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,768 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-09 23:06:49,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,838 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-09 23:06:49,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,903 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-09 23:06:49,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:49,979 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-09 23:06:50,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,173 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-09 23:06:50,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,222 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-09 23:06:50,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,262 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-09 23:06:50,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:50,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 53 treesize of output 61 [2022-02-09 23:06:51,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,389 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-09 23:06:51,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,480 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-09 23:06:51,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,561 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-09 23:06:51,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-09 23:06:51,648 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-09 23:06:51,681 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-09 23:06:51,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-09 23:06:54,882 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-09 23:07:07,933 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-09 23:07:10,302 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-09 23:07:13,876 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-09 23:07:16,126 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-09 23:07:18,483 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-09 23:07:20,894 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-09 23:07:24,841 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-09 23:07:27,104 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-09 23:07:29,408 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-09 23:07:31,767 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-09 23:07:35,188 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-09 23:07:39,325 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-09 23:07:39,325 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718826496] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-09 23:07:39,325 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-09 23:07:39,325 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 23] total 42 [2022-02-09 23:07:39,325 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178866453] [2022-02-09 23:07:39,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-09 23:07:39,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-02-09 23:07:39,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 23:07:39,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-02-09 23:07:39,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=670, Unknown=18, NotChecked=828, Total=1806 [2022-02-09 23:07:39,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:07:39,327 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 23:07:39,328 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-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:07:39,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:07:39,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:07:43,554 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-09 23:07:46,858 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-09 23:07:48,869 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-09 23:07:50,881 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-09 23:07:52,905 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-09 23:08:29,792 WARN L228 SmtUtils]: Spent 24.52s 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-09 23:09:50,672 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-09 23:09:58,367 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 163800 transitions and produced 90741 states. [2022-02-09 23:09:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:09:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:09:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:09:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:09:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:09:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-09 23:09:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-09 23:09:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:09:58,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:09:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:09:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-09 23:09:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:09:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 23:09:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:09:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:09:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:09:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:09:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:09:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-09 23:09:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-02-09 23:09:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:09:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-02-09 23:09:58,397 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-09 23:09:58,595 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-09 23:09:58,595 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-09 23:09:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-09 23:09:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1693858163, now seen corresponding path program 4 times [2022-02-09 23:09:58,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-09 23:09:58,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371320819] [2022-02-09 23:09:58,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-09 23:09:58,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-09 23:09:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-09 23:10:00,965 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-09 23:10:00,966 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-09 23:10:00,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371320819] [2022-02-09 23:10:00,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371320819] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-09 23:10:00,966 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773282229] [2022-02-09 23:10:00,966 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-09 23:10:00,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-09 23:10:00,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-09 23:10:00,984 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-09 23:10:00,985 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-09 23:13:54,645 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-09 23:13:54,645 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-09 23:13:54,648 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-09 23:13:55,679 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-09 23:13:55,845 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-09 23:13:55,850 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forcibly destroying the process [2022-02-09 23:13:55,872 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-09 23:13:55,873 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-02-09 23:13:55,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-02-09 23:13:55,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638349178] [2022-02-09 23:13:55,873 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-02-09 23:13:55,875 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-09 23:13:55,875 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-09 23:13:55,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-09 23:13:55,876 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-09 23:13:55,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-09 23:13:55,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2022-02-09 23:13:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:13:55,877 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-09 23:13:55,877 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-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:13:55,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:13:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-09 23:13:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-02-09 23:13:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-02-09 23:13:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-02-09 23:13:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-02-09 23:13:55,878 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-09 23:13:55,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-09 23:13:55,878 WARN L594 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-02-09 23:13:55,880 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2022-02-09 23:13:55,880 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2022-02-09 23:13:55,880 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2022-02-09 23:13:55,880 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2022-02-09 23:13:55,881 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 9 remaining) [2022-02-09 23:13:55,881 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2022-02-09 23:13:55,881 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2022-02-09 23:13:55,881 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2022-02-09 23:13:55,881 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2022-02-09 23:13:55,891 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-09 23:13:55,893 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-09 23:13:55,893 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-09 23:13:55,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.02 11:13:55 BasicIcfg [2022-02-09 23:13:55,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-09 23:13:55,894 INFO L158 Benchmark]: Toolchain (without parser) took 860249.16ms. Allocated memory was 213.9MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 159.6MB in the beginning and 487.4MB in the end (delta: -327.7MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-02-09 23:13:55,895 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 213.9MB. Free memory is still 177.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-09 23:13:55,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.85ms. Allocated memory is still 213.9MB. Free memory was 159.4MB in the beginning and 171.6MB in the end (delta: -12.1MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-02-09 23:13:55,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.75ms. Allocated memory is still 213.9MB. Free memory was 171.6MB in the beginning and 169.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-02-09 23:13:55,895 INFO L158 Benchmark]: Boogie Preprocessor took 19.57ms. Allocated memory is still 213.9MB. Free memory was 169.0MB in the beginning and 166.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-09 23:13:55,895 INFO L158 Benchmark]: RCFGBuilder took 426.42ms. Allocated memory is still 213.9MB. Free memory was 166.9MB in the beginning and 151.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-02-09 23:13:55,895 INFO L158 Benchmark]: TraceAbstraction took 859322.89ms. Allocated memory was 213.9MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 150.6MB in the beginning and 487.4MB in the end (delta: -336.7MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-02-09 23:13:55,907 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 213.9MB. Free memory is still 177.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 445.85ms. Allocated memory is still 213.9MB. Free memory was 159.4MB in the beginning and 171.6MB in the end (delta: -12.1MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.75ms. Allocated memory is still 213.9MB. Free memory was 171.6MB in the beginning and 169.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.57ms. Allocated memory is still 213.9MB. Free memory was 169.0MB in the beginning and 166.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 426.42ms. Allocated memory is still 213.9MB. Free memory was 166.9MB in the beginning and 151.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 859322.89ms. Allocated memory was 213.9MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 150.6MB in the beginning and 487.4MB in the end (delta: -336.7MB). Peak memory consumption was 2.2GB. 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: 859.2s, OverallIterations: 23, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 332.3s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 306, 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.2s SatisfiabilityAnalysisTime, 285.2s 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